j 730 gnulib-tests/setlocale.c size_t j;
j 733 gnulib-tests/setlocale.c for (j = country_range.lo; j < country_range.hi; j++)
j 738 gnulib-tests/setlocale.c const char *part2 = country_table[j].english;
j 79 gnulib-tests/test-memchr.c int i, j;
j 82 gnulib-tests/test-memchr.c for (j = 0; j < 256; j++)
j 83 gnulib-tests/test-memchr.c input[i + j] = j;
j 84 gnulib-tests/test-memchr.c for (j = 0; j < 256; j++)
j 86 gnulib-tests/test-memchr.c ASSERT (MEMCHR (input + i, j, 256) == input + i + j);
j 248 gnulib-tests/test-stdint.c uintmax_t j[2] = { UINTMAX_C (17), UINTMAX_MAX };
j 54 gnulib-tests/test-strnlen.c size_t j = i;
j 58 gnulib-tests/test-strnlen.c if (i != j)
j 60 gnulib-tests/test-strnlen.c start[j] = 0;
j 61 gnulib-tests/test-strnlen.c ASSERT (strnlen (start, i + j) == j);
j 63 gnulib-tests/test-strnlen.c ASSERT (strnlen (start, i) == j);
j 64 gnulib-tests/test-strnlen.c ASSERT (strnlen (start, j) == j);
j 66 gnulib-tests/test-strnlen.c while (j--);
j 379 gnulib-tests/vasnprintf.c size_t k, i, j;
j 391 gnulib-tests/vasnprintf.c for (j = 0; j < len2; j++)
j 393 gnulib-tests/vasnprintf.c mp_limb_t digit2 = p2[j];
j 395 gnulib-tests/vasnprintf.c carry += dp[i + j];
j 396 gnulib-tests/vasnprintf.c dp[i + j] = (mp_limb_t) carry;
j 639 gnulib-tests/vasnprintf.c size_t j = a_len - b_len; /* m-n */
j 650 gnulib-tests/vasnprintf.c if (r_ptr[j + b_len] < b_msd) /* r[j+n] < b[n-1] ? */
j 654 gnulib-tests/vasnprintf.c ((mp_twolimb_t) r_ptr[j + b_len] << GMP_LIMB_BITS)
j 655 gnulib-tests/vasnprintf.c | r_ptr[j + b_len - 1];
j 670 gnulib-tests/vasnprintf.c if (r_ptr[j + b_len] > b_msd
j 671 gnulib-tests/vasnprintf.c || (c1 = r_ptr[j + b_len - 1] + b_msd) < b_msd)
j 681 gnulib-tests/vasnprintf.c ((mp_twolimb_t) c1 << GMP_LIMB_BITS) | r_ptr[j + b_len - 2];
j 702 gnulib-tests/vasnprintf.c mp_limb_t *destptr = r_ptr + j;
j 720 gnulib-tests/vasnprintf.c if (cr > r_ptr[j + b_len])
j 727 gnulib-tests/vasnprintf.c mp_limb_t *destptr = r_ptr + j;
j 745 gnulib-tests/vasnprintf.c q_ptr[j] = q_star;
j 746 gnulib-tests/vasnprintf.c if (j == 0)
j 748 gnulib-tests/vasnprintf.c j--;
j 1105 gnulib-tests/vasnprintf.c size_t j;
j 1107 gnulib-tests/vasnprintf.c for (j = 0; j < pow5_len; j++)
j 1109 gnulib-tests/vasnprintf.c mp_limb_t digit2 = pow5_ptr[j];
j 1111 gnulib-tests/vasnprintf.c pow5_ptr[j] = (mp_limb_t) carry;
j 57 lib/mbsstr.c size_t j;
j 59 lib/mbsstr.c j = 0;
j 60 lib/mbsstr.c for (mbui_init (iter, needle); mbui_avail (iter); mbui_advance (iter), j++)
j 61 lib/mbsstr.c mb_copy (&needle_mbchars[j], &mbui_cur (iter));
j 80 lib/mbsstr.c size_t i, j;
j 84 lib/mbsstr.c j = 0;
j 99 lib/mbsstr.c if (mb_equal (*b, needle_mbchars[j]))
j 102 lib/mbsstr.c table[i] = i - ++j;
j 108 lib/mbsstr.c if (j == 0)
j 125 lib/mbsstr.c j = j - table[j];
j 133 lib/mbsstr.c size_t j;
j 138 lib/mbsstr.c j = 0;
j 143 lib/mbsstr.c if (mb_equal (needle_mbchars[j], mbui_cur (phaystack)))
j 145 lib/mbsstr.c j++;
j 147 lib/mbsstr.c if (j == m)
j 154 lib/mbsstr.c else if (j > 0)
j 157 lib/mbsstr.c size_t count = table[j];
j 158 lib/mbsstr.c j -= count;
j 527 lib/quotearg.c size_t j;
j 528 lib/quotearg.c for (j = 1; j < bytes; j++)
j 529 lib/quotearg.c switch (arg[i + m + j])
j 351 lib/regcomp.c int j;
j 353 lib/regcomp.c for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch)
j 354 lib/regcomp.c if (w & ((bitset_word_t) 1 << j))
j 611 lib/regcomp.c Idx i, j;
j 635 lib/regcomp.c for (j = 0; j < entry->num; ++j)
j 637 lib/regcomp.c re_dfastate_t *state = entry->array[j];
j 917 lib/regcomp.c int i, j, ch;
j 925 lib/regcomp.c for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch)
j 929 lib/regcomp.c dfa->sb_char[i] |= (bitset_word_t) 1 << j;
j 952 lib/regcomp.c int i, j, ch;
j 955 lib/regcomp.c for (j = 0; j < BITSET_WORD_BITS; ++j, ++ch)
j 957 lib/regcomp.c dfa->word_char[i] |= (bitset_word_t) 1 << j;
j 3365 lib/regexec.c Idx i, j;
j 3464 lib/regexec.c for (j = 0; j < dests_node[i].nelem; ++j)
j 3466 lib/regexec.c next_node = dfa->nexts[dests_node[i].elems[j]];
j 3522 lib/regexec.c for (j = 0; (dests_ch[j][i] & mask) == 0; ++j)
j 3527 lib/regexec.c trtable[ch] = dest_states_word[j];
j 3529 lib/regexec.c trtable[ch] = dest_states[j];
j 3553 lib/regexec.c for (j = 0; (dests_ch[j][i] & mask) == 0; ++j)
j 3557 lib/regexec.c trtable[ch] = dest_states[j];
j 3558 lib/regexec.c trtable[ch + SBC_MAX] = dest_states_word[j];
j 3566 lib/regexec.c for (j = 0; j < ndests; ++j)
j 3567 lib/regexec.c if (bitset_contain (dests_ch[j], NEWLINE_CHAR))
j 3570 lib/regexec.c trtable[NEWLINE_CHAR] = dest_states_nl[j];
j 3572 lib/regexec.c trtable[NEWLINE_CHAR + SBC_MAX] = dest_states_nl[j];
j 3604 lib/regexec.c Idx i, j, k;
j 3683 lib/regexec.c for (j = 0; j < BITSET_WORDS; ++j)
j 3684 lib/regexec.c any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j]));
j 3687 lib/regexec.c for (j = 0; j < BITSET_WORDS; ++j)
j 3688 lib/regexec.c any_set |= (accepts[j] &= dfa->word_char[j]);
j 3702 lib/regexec.c for (j = 0; j < BITSET_WORDS; ++j)
j 3703 lib/regexec.c any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j]));
j 3706 lib/regexec.c for (j = 0; j < BITSET_WORDS; ++j)
j 3707 lib/regexec.c any_set |= (accepts[j] &= ~dfa->word_char[j]);
j 3715 lib/regexec.c for (j = 0; j < ndests; ++j)
j 3723 lib/regexec.c if (type == CHARACTER && !bitset_contain (dests_ch[j], node->opr.c))
j 3729 lib/regexec.c has_intersec |= intersec[k] = accepts[k] & dests_ch[j][k];
j 3738 lib/regexec.c not_subset |= remains[k] = ~accepts[k] & dests_ch[j][k];
j 3739 lib/regexec.c not_consumed |= accepts[k] = accepts[k] & ~dests_ch[j][k];
j 3747 lib/regexec.c bitset_copy (dests_ch[j], intersec);
j 3748 lib/regexec.c err = re_node_set_init_copy (dests_node + ndests, &dests_node[j]);
j 3755 lib/regexec.c ok = re_node_set_insert (&dests_node[j], cur_nodes->elems[i]);
j 3764 lib/regexec.c if (j == ndests)
j 3776 lib/regexec.c for (j = 0; j < ndests; ++j)
j 3777 lib/regexec.c re_node_set_free (dests_node + j);
j 3876 lib/regexec.c Idx j;
j 3925 lib/regexec.c for (j = 0; j < *coll_sym; j++)
j 3926 lib/regexec.c if (pin[j] != coll_sym[1 + j])
j 3928 lib/regexec.c if (j == *coll_sym)
j 3931 lib/regexec.c match_len = j;
j 64 lib/str-kmp.h size_t i, j;
j 68 lib/str-kmp.h j = 0;
j 83 lib/str-kmp.h if (b == CANON_ELEMENT (needle[j]))
j 86 lib/str-kmp.h table[i] = i - ++j;
j 92 lib/str-kmp.h if (j == 0)
j 109 lib/str-kmp.h j = j - table[j];
j 117 lib/str-kmp.h size_t j;
j 122 lib/str-kmp.h j = 0;
j 127 lib/str-kmp.h if (CANON_ELEMENT (needle[j]) == CANON_ELEMENT (*phaystack))
j 129 lib/str-kmp.h j++;
j 131 lib/str-kmp.h if (j == m)
j 138 lib/str-kmp.h else if (j > 0)
j 141 lib/str-kmp.h rhaystack += table[j];
j 142 lib/str-kmp.h j -= table[j];
j 1070 lib/strftime.c int j;
j 1071 lib/strftime.c for (j = width; j < 9; j++)
j 132 src/analyze.c register lin j;
j 138 src/analyze.c for (j = i; j < end; j++)
j 140 src/analyze.c if (discards[j] == 0)
j 142 src/analyze.c if (discards[j] == 2)
j 147 src/analyze.c while (j > i && discards[j - 1] == 2)
j 148 src/analyze.c discards[--j] = 0, --provisional;
j 152 src/analyze.c length = j - i;
j 158 src/analyze.c while (j > i)
j 159 src/analyze.c if (discards[--j] == 2)
j 160 src/analyze.c discards[j] = 0;
j 178 src/analyze.c for (j = 0, consec = 0; j < length; j++)
j 179 src/analyze.c if (discards[i + j] != 2)
j 183 src/analyze.c j -= consec;
j 185 src/analyze.c discards[i + j] = 0;
j 191 src/analyze.c for (j = 0, consec = 0; j < length; j++)
j 193 src/analyze.c if (j >= 8 && discards[i + j] == 1)
j 195 src/analyze.c if (discards[i + j] == 2)
j 196 src/analyze.c consec = 0, discards[i + j] = 0;
j 197 src/analyze.c else if (discards[i + j] == 0)
j 209 src/analyze.c for (j = 0, consec = 0; j < length; j++)
j 211 src/analyze.c if (j >= 8 && discards[i - j] == 1)
j 213 src/analyze.c if (discards[i - j] == 2)
j 214 src/analyze.c consec = 0, discards[i - j] = 0;
j 215 src/analyze.c else if (discards[i - j] == 0)
j 232 src/analyze.c lin j = 0;
j 236 src/analyze.c filevec[f].undiscarded[j] = filevec[f].equivs[i];
j 237 src/analyze.c filevec[f].realindexes[j++] = i;
j 241 src/analyze.c filevec[f].nondiscarded_lines = j;
j 269 src/analyze.c lin j = 0;
j 281 src/analyze.c while (other_changed[j++])
j 295 src/analyze.c while (other_changed[j])
j 296 src/analyze.c j++;
j 314 src/analyze.c while (other_changed[--j])
j 321 src/analyze.c corresponding = other_changed[j - 1] ? i : i_end;
j 335 src/analyze.c while (other_changed[++j])
j 348 src/analyze.c while (other_changed[--j])
j 148 src/context.c int i, j;
j 152 src/context.c for (j = i; j < i + 40 && function[j] != '\n'; j++)
j 154 src/context.c while (i < j && c_isspace ((unsigned char) function[j - 1]))
j 155 src/context.c j--;
j 156 src/context.c fwrite (function + i, sizeof (char), j - i, out);
j 300 src/context.c lin i, j, k;
j 345 src/context.c j = first1;
j 347 src/context.c while (i <= last0 || j <= last1)
j 358 src/context.c j++;
j 379 src/context.c char const * const *line = &files[1].linbuf[j++];
j 277 src/side.c register lin i, j;
j 298 src/side.c for (i = first0, j = first1; i <= last0 && j <= last1; i++, j++)
j 299 src/side.c print_1sdiff_line (&files[0].linbuf[i], '|', &files[1].linbuf[j]);
j 300 src/side.c changes = (i <= last0 ? OLD : 0) + (j <= last1 ? NEW : 0);
j 302 src/side.c next1 = first1 = j;
j 308 src/side.c for (j = first1; j <= last1; ++j)
j 309 src/side.c print_1sdiff_line (0, '>', &files[1].linbuf[j]);
j 310 src/side.c next1 = j;