curr 203 maint/gnulib/lib/dfa.c succeeds_in_context (int constraint, int prev, int curr) curr 205 maint/gnulib/lib/dfa.c return !! (((curr & CTX_NONE ? other_constraint (constraint) : 0) \ curr 206 maint/gnulib/lib/dfa.c | (curr & CTX_LETTER ? letter_constraint (constraint) : 0) \ curr 207 maint/gnulib/lib/dfa.c | (curr & CTX_NEWLINE ? newline_constraint (constraint) : 0)) \ curr 610 maint/gnulib/lib/dfa.c accepts_in_context (int prev, int curr, state_num state, struct dfa const *dfa) curr 612 maint/gnulib/lib/dfa.c return succeeds_in_context (dfa->states[state].constraint, prev, curr); curr 327 maint/gnulib/lib/git-merge-changelog.c struct entry *curr; curr 347 maint/gnulib/lib/git-merge-changelog.c curr = entry_create (start, ptr - start); curr 348 maint/gnulib/lib/git-merge-changelog.c gl_list_add_last (result->entries_list, curr); curr 349 maint/gnulib/lib/git-merge-changelog.c gl_list_add_first (result->entries_reversed, curr); curr 77 maint/gnulib/lib/uninorm/u-normalize-internal.h int curr; curr 79 maint/gnulib/lib/uninorm/u-normalize-internal.h for (curr = 0; curr < decomposed_count; ) curr 86 maint/gnulib/lib/uninorm/u-normalize-internal.h curr_decomposed_count = decomposer (decomposed[curr], curr_decomposed); curr 103 maint/gnulib/lib/uninorm/u-normalize-internal.h for (j = decomposed_count - 1 - shift; j > curr; j--) curr 107 maint/gnulib/lib/uninorm/u-normalize-internal.h decomposed[curr + shift] = curr_decomposed[shift]; curr 112 maint/gnulib/lib/uninorm/u-normalize-internal.h curr++; curr 99 maint/gnulib/lib/uninorm/uninorm-filter.c int curr; curr 101 maint/gnulib/lib/uninorm/uninorm-filter.c for (curr = 0; curr < decomposed_count; ) curr 109 maint/gnulib/lib/uninorm/uninorm-filter.c filter->decomposer (decomposed[curr], curr_decomposed); curr 126 maint/gnulib/lib/uninorm/uninorm-filter.c for (j = decomposed_count - 1 - shift; j > curr; j--) curr 130 maint/gnulib/lib/uninorm/uninorm-filter.c decomposed[curr + shift] = curr_decomposed[shift]; curr 135 maint/gnulib/lib/uninorm/uninorm-filter.c curr++;