k 37 gnulib-tests/test-float.c int k = n; k 41 gnulib-tests/test-float.c if (k < 0) k 44 gnulib-tests/test-float.c k = - k; k 46 gnulib-tests/test-float.c while (k > 0) k 48 gnulib-tests/test-float.c if (k != 2 * (k / 2)) k 51 gnulib-tests/test-float.c k = k - 1; k 53 gnulib-tests/test-float.c if (k == 0) k 56 gnulib-tests/test-float.c k = k / 2; k 66 gnulib-tests/test-float.c int k = n; k 70 gnulib-tests/test-float.c if (k < 0) k 73 gnulib-tests/test-float.c k = - k; k 75 gnulib-tests/test-float.c while (k > 0) k 77 gnulib-tests/test-float.c if (k != 2 * (k / 2)) k 80 gnulib-tests/test-float.c k = k - 1; k 82 gnulib-tests/test-float.c if (k == 0) k 85 gnulib-tests/test-float.c k = k / 2; k 95 gnulib-tests/test-float.c int k = n; k 99 gnulib-tests/test-float.c if (k < 0) k 102 gnulib-tests/test-float.c k = - k; k 104 gnulib-tests/test-float.c while (k > 0) k 106 gnulib-tests/test-float.c if (k != 2 * (k / 2)) k 109 gnulib-tests/test-float.c k = k - 1; k 111 gnulib-tests/test-float.c if (k == 0) k 114 gnulib-tests/test-float.c k = k / 2; k 87 gnulib-tests/test-hash.c unsigned int k; k 192 gnulib-tests/test-hash.c for (k = 0; k < 2; k++) k 194 gnulib-tests/test-hash.c Hash_tuning const *tune = (k == 0 ? NULL : &tuning); k 32 gnulib-tests/test-inttypes.c const char *k = /* implicit string concatenation */ k 114 gnulib-tests/test-memchr.c size_t k; k 119 gnulib-tests/test-memchr.c for (k = i + 1; k < n + limit; k++) k 120 gnulib-tests/test-memchr.c ASSERT (MEMCHR (mem, 'U', k) == mem + i); k 122 gnulib-tests/test-memchr.c for (k = i + 1; k < n + limit; k++) k 123 gnulib-tests/test-memchr.c ASSERT (MEMCHR (mem, 0, k) == mem + i); k 379 gnulib-tests/vasnprintf.c size_t k, i, j; k 385 gnulib-tests/vasnprintf.c for (k = len2; k > 0; ) k 386 gnulib-tests/vasnprintf.c dp[--k] = 0; k 308 lib/diffseq.h int k; k 310 lib/diffseq.h for (k = 1; XREF_YREF_EQUAL (x - k, y - k); k++) k 311 lib/diffseq.h if (k == SNAKE_LIMIT) k 347 lib/diffseq.h int k; k 349 lib/diffseq.h for (k = 0; XREF_YREF_EQUAL (x + k, y + k); k++) k 350 lib/diffseq.h if (k == SNAKE_LIMIT - 1) k 294 lib/mbrtowc.c size_t k = nstate; k 296 lib/mbrtowc.c pstate[++k] = s[0]; k 297 lib/mbrtowc.c if (k < m) k 299 lib/mbrtowc.c pstate[++k] = s[1]; k 300 lib/mbrtowc.c if (k < m) k 301 lib/mbrtowc.c pstate[++k] = s[2]; k 303 lib/mbrtowc.c if (k != m) k 3604 lib/regexec.c Idx i, j, k; k 3728 lib/regexec.c for (k = 0; k < BITSET_WORDS; ++k) k 3729 lib/regexec.c has_intersec |= intersec[k] = accepts[k] & dests_ch[j][k]; k 3736 lib/regexec.c for (k = 0; k < BITSET_WORDS; ++k) k 3738 lib/regexec.c not_subset |= remains[k] = ~accepts[k] & dests_ch[j][k]; k 3739 lib/regexec.c not_consumed |= accepts[k] = accepts[k] & ~dests_ch[j][k]; k 300 src/context.c lin i, j, k; k 364 src/context.c k = next->deleted; k 365 src/context.c while (k--) k 376 src/context.c k = next->inserted; k 377 src/context.c while (k--)