j 226 lib/tty/color-internal.c int j; j 228 lib/tty/color-internal.c for (j = 0; attributes_table[j].name != NULL; j++) j 230 lib/tty/color-internal.c if (strcmp (attr_list[i], attributes_table[j].name) == 0) j 232 lib/tty/color-internal.c attr_bits |= attributes_table[j].value; j 104 lib/tty/win.c int bytes, i, j, cols = 0; j 116 lib/tty/win.c j = 0; j 125 lib/tty/win.c if (j < bytes) j 126 lib/tty/win.c k[j++] = c; j 132 lib/tty/win.c if (j < bytes) j 133 lib/tty/win.c k[j++] = c; j 136 lib/tty/win.c for (i = 0; i < j; i++) j 458 lib/util.c int j = 0; j 478 lib/util.c for (j = 0; j < units; j++) j 488 lib/util.c for (j = units; sfx[j] != NULL; j++) j 492 lib/util.c if (j == units) j 500 lib/util.c g_snprintf (buffer, len + 1, (len > 1) ? "~%s" : "%s", (j > 1) ? sfx[j - 1] : "B"); j 505 lib/util.c if (size < power10[len - (j > 0 ? 1 : 0)]) j 507 lib/util.c g_snprintf (buffer, len + 1, "%" PRIuMAX "%s", size, sfx[j]); j 1019 lib/util.c int j, prevlen = -1, currlen; j 1031 lib/util.c for (j = 0; j < 2; j++) j 1062 lib/util.c if (j != 0) j 460 lib/widget/input_complete.c int j; j 462 lib/widget/input_complete.c j = hosts_p - hosts; j 464 lib/widget/input_complete.c if (j >= hosts_alloclen) j 468 lib/widget/input_complete.c hosts_p = hosts + j; j 759 lib/widget/input_complete.c size_t j; j 767 lib/widget/input_complete.c j = i + 1; j 768 lib/widget/input_complete.c while (j < matches + 1) j 773 lib/widget/input_complete.c for (si = match_list[i], sj = match_list[j]; si[0] != '\0' && sj[0] != '\0';) j 790 lib/widget/input_complete.c g_free (match_list[j]); j 791 lib/widget/input_complete.c j++; j 792 lib/widget/input_complete.c if (j > matches) j 798 lib/widget/input_complete.c if (i + 1 != j) /* So there's some gap */ j 799 lib/widget/input_complete.c match_list[i + 1] = match_list[j]; j 801 lib/widget/input_complete.c j++; j 325 src/diffviewer/ydiff.c size_t j = 0; j 332 src/diffviewer/ydiff.c for (i = fs->pos; j < size && i < fs->len && !stop; i++, j++) j 334 src/diffviewer/ydiff.c buf[j] = fs->buf[i]; j 335 src/diffviewer/ydiff.c if (buf[j] == '\n') j 340 src/diffviewer/ydiff.c if (j == size || stop) j 348 src/diffviewer/ydiff.c return j; j 1038 src/diffviewer/ydiff.c int i, j; j 1069 src/diffviewer/ydiff.c for (j = 0; j < n; j++) j 1072 src/diffviewer/ydiff.c Lcurr[j + 1] = 0; j 1074 src/diffviewer/ydiff.c if (s[i] == t[j]) j 1078 src/diffviewer/ydiff.c v = Lprev[j] + 1; j 1079 src/diffviewer/ydiff.c Lcurr[j + 1] = v; j 1091 src/diffviewer/ydiff.c off1 = j - z + 1; j 1291 src/diffviewer/ydiff.c int j; j 1293 src/diffviewer/ydiff.c j = TAB_SKIP (ts, i + base); j 1294 src/diffviewer/ydiff.c i += j - 1; j 1295 src/diffviewer/ydiff.c while (j-- > 0) j 1333 src/diffviewer/ydiff.c int j; j 1335 src/diffviewer/ydiff.c j = TAB_SKIP (ts, i + base); j 1336 src/diffviewer/ydiff.c if (j > dstsize - i) j 1337 src/diffviewer/ydiff.c j = dstsize - i; j 1338 src/diffviewer/ydiff.c i += j - 1; j 1339 src/diffviewer/ydiff.c while (j-- > 0) j 1380 src/diffviewer/ydiff.c int j; j 1382 src/diffviewer/ydiff.c j = TAB_SKIP (ts, i + base); j 1383 src/diffviewer/ydiff.c i += j - 1; j 1384 src/diffviewer/ydiff.c while (j-- > 0) j 1479 src/diffviewer/ydiff.c int j; j 1481 src/diffviewer/ydiff.c j = TAB_SKIP (ts, i + base); j 1482 src/diffviewer/ydiff.c i += j - 1; j 1483 src/diffviewer/ydiff.c while (j-- > 0) j 2531 src/diffviewer/ydiff.c int j; j 2573 src/diffviewer/ydiff.c for (i = dview->skip_rows, j = 0; i < dview->a[ord]->len && j < height; j++, i++) j 2583 src/diffviewer/ydiff.c tty_gotoyx (r + j, c - 2); j 2590 src/diffviewer/ydiff.c tty_gotoyx (r + j, c - xwidth); j 2615 src/diffviewer/ydiff.c tty_gotoyx (r + j, c); j 2680 src/diffviewer/ydiff.c tty_gotoyx (r + j, c - xwidth); j 2692 src/diffviewer/ydiff.c tty_gotoyx (r + j, c); j 2742 src/diffviewer/ydiff.c for (; j < height; j++) j 2746 src/diffviewer/ydiff.c tty_gotoyx (r + j, c - xwidth); j 2750 src/diffviewer/ydiff.c tty_gotoyx (r + j, c); j 692 src/editor/edit.c long i, j = 0; j 719 src/editor/edit.c j = i; j 723 src/editor/edit.c return edit->line_offsets[j]; /* know the offset exactly */ j 724 src/editor/edit.c if (m == 1 && j >= 3) j 725 src/editor/edit.c i = j; /* one line different - caller might be looping, so stay in this cache */ j 728 src/editor/edit.c if (line > edit->line_numbers[j]) j 730 src/editor/edit.c edit_buffer_get_forward_offset (&edit->buffer, edit->line_offsets[j], j 731 src/editor/edit.c line - edit->line_numbers[j], 0); j 734 src/editor/edit.c edit_buffer_get_backward_offset (&edit->buffer, edit->line_offsets[j], j 735 src/editor/edit.c edit->line_numbers[j] - line); j 1524 src/editor/edit.c unsigned long j = 0; j 1550 src/editor/edit.c if (j++ > furthest_bracket_search) j 575 src/editor/editbuffer.c guint j; j 577 src/editor/editbuffer.c j = buf->b2->len - 1; j 578 src/editor/editbuffer.c b = g_ptr_array_index (buf->b2, j); j 579 src/editor/editbuffer.c g_ptr_array_remove_index (buf->b2, j); j 616 src/editor/editbuffer.c guint j; j 618 src/editor/editbuffer.c j = buf->b1->len - 1; j 619 src/editor/editbuffer.c b = g_ptr_array_index (buf->b1, j); j 620 src/editor/editbuffer.c g_ptr_array_remove_index (buf->b1, j); j 706 src/editor/editbuffer.c off_t i, j; j 728 src/editor/editbuffer.c for (j = 0; j < ret; j++) j 729 src/editor/editbuffer.c if (*((char *) b + j) == '\n') j 749 src/editor/editbuffer.c for (j = 0; j < sz; j++) j 750 src/editor/editbuffer.c if (*((char *) b + j) == '\n') j 351 src/editor/editmacros.c int i, j; j 356 src/editor/editmacros.c for (j = 0; j < count_repeat; j++) j 251 src/editor/syntax.c int c, d, j; j 282 src/editor/syntax.c j = 0; j 288 src/editor/syntax.c j = i; j 292 src/editor/syntax.c if (j != 0 && strchr ((const char *) p + 1, c) != NULL) /* c exists further down, so it will get matched later */ j 301 src/editor/syntax.c if (j == 0) j 303 src/editor/syntax.c i = j; j 317 src/editor/syntax.c for (j = 0; p[j] != SYNTAX_TOKEN_BRACKET && p[j] != '\0'; j++) j 318 src/editor/syntax.c if (c == p[j]) j 1233 src/editor/syntax.c size_t j; j 1239 src/editor/syntax.c for (j = 1; j < c->keyword->len; j++) j 1243 src/editor/syntax.c k = SYNTAX_KEYWORD (g_ptr_array_index (c->keyword, j)); j 235 src/filemanager/cmd.c int i, j; j 260 src/filemanager/cmd.c for (j = 0; j < other->dir.len; j++) j 264 src/filemanager/cmd.c other_fname = other->dir.list[j].fname->str; j 272 src/filemanager/cmd.c if (j >= other->dir.len) j 278 src/filemanager/cmd.c file_entry_t *target = &other->dir.list[j]; j 588 src/filemanager/mountlist.c size_t i, j = 0; j 599 src/filemanager/mountlist.c str[j++] = (str[i + 1] - '0') * 64 + (str[i + 2] - '0') * 8 + (str[i + 3] - '0'); j 603 src/filemanager/mountlist.c str[j++] = str[i]; j 4060 src/filemanager/panel.c int i, j; j 4066 src/filemanager/panel.c for (i = 0, j = 0; i < list->len; i++) j 4075 src/filemanager/panel.c if (j != i) j 4076 src/filemanager/panel.c list->list[j] = list->list[i]; j 4077 src/filemanager/panel.c j++; j 4081 src/filemanager/panel.c if (j == 0) j 4084 src/filemanager/panel.c list->len = j; j 268 src/filemanager/tree.c int i, j; j 318 src/filemanager/tree.c for (j = strlen (cname) - 1; !IS_PATH_SEP (cname[j]); j--) j 320 src/filemanager/tree.c if (vfs_path_equal_len (current->name, tree->selected_ptr->name, j)) j 325 src/filemanager/tree.c j = vfs_path_len (tree->selected_ptr->name); j 326 src/filemanager/tree.c if (j > 1 && vfs_path_equal_len (current->name, tree->selected_ptr->name, j)) j 373 src/filemanager/tree.c for (j = 0; j < current->sublevel - topsublevel - 1; j++) j 375 src/filemanager/tree.c if (tree_cols - 8 - 3 * j < 9) j 378 src/filemanager/tree.c if ((current->submask & (1 << (j + topsublevel + 1))) != 0) j 385 src/filemanager/tree.c j++; j 396 src/filemanager/tree.c (current->subname, tree_cols - x - 3 * j, J_LEFT_FIT)); j 415 src/filemanager/tree.c for (j = strlen (cname) - 1; !IS_PATH_SEP (cname[j]); j--) j 417 src/filemanager/tree.c if (vfs_path_equal_len (current->name, tree->selected_ptr->name, j)) j 454 src/filemanager/tree.c int j = 0; j 457 src/filemanager/tree.c while (j < i && current->prev != NULL j 464 src/filemanager/tree.c j++; j 467 src/filemanager/tree.c i = j; j 484 src/filemanager/tree.c int j = 0; j 487 src/filemanager/tree.c while (j < i && current->next != NULL j 494 src/filemanager/tree.c j++; j 497 src/filemanager/tree.c i = j; j 1453 src/vfs/ftpfs/ftpfs.c int s, j, data; j 1471 src/vfs/ftpfs/ftpfs.c j = ftpfs_command (me, super, WAIT_REPLY, "REST %d", reget); j 1472 src/vfs/ftpfs/ftpfs.c if (j != CONTINUE) j 1480 src/vfs/ftpfs/ftpfs.c j = ftpfs_command (me, super, WAIT_REPLY, "%s", cmd); j 1486 src/vfs/ftpfs/ftpfs.c j = ftpfs_command (me, super, WAIT_REPLY, "%s /%s", cmd, j 1492 src/vfs/ftpfs/ftpfs.c if (j != PRELIM) j 581 src/viewer/ascii.c int i, j; j 682 src/viewer/ascii.c j = 0; j 684 src/viewer/ascii.c j += mcview_char_display (view, cs[i], str + j); j 685 src/viewer/ascii.c str[j] = '\0'; j 192 src/viewer/hex.c int j; j 197 src/viewer/hex.c for (j = 0; j < UTF8_CHAR_LEN; j++) j 199 src/viewer/hex.c if (mcview_get_byte (view, from + j, &res)) j 200 src/viewer/hex.c utf8buf[j] = res; j 203 src/viewer/hex.c utf8buf[j] = '\0'; j 206 src/viewer/hex.c if (curr != NULL && from + j == curr->offset) j 208 src/viewer/hex.c utf8buf[j] = curr->value; j 210 src/viewer/hex.c first_changed = j; j 212 src/viewer/hex.c if (curr != NULL && from + j >= curr->offset) j 225 tests/lib/strutil/filevercmp.c const char *j = filevercmp_test_ds2[_j]; j 228 tests/lib/strutil/filevercmp.c result = test_filevercmp (i, j); j 262 tests/lib/strutil/filevercmp.c const char *j = filevercmp_test_ds3[_j]; j 265 tests/lib/strutil/filevercmp.c result = filevercmp (i, j); j 300 tests/lib/strutil/filevercmp.c const char *j = filevercmp_test_ds4[_j]; j 303 tests/lib/strutil/filevercmp.c result = filevercmp (i, j); j 366 tests/lib/strutil/filevercmp.c const char *j = filevercmp_test_ds5[jj]; j 368 tests/lib/strutil/filevercmp.c ck_assert_int_eq (test_filevercmp (i, j), 0); j 369 tests/lib/strutil/filevercmp.c ck_assert_int_eq (test_filevercmp (j, i), 0); j 208 tests/lib/utilunix__mc_pstream_get_string.c int j = 0; j 220 tests/lib/utilunix__mc_pstream_get_string.c ck_assert_int_eq (stream.pos, data->pos[j]); j 226 tests/lib/utilunix__mc_pstream_get_string.c ck_assert_int_eq (ret->len, data->len[j]); j 227 tests/lib/utilunix__mc_pstream_get_string.c mctest_assert_str_eq (ret->str, data->str[j]); j 231 tests/lib/utilunix__mc_pstream_get_string.c j++;