Lines Matching defs:curr
91 int curr;
93 for (curr = 0; curr < decomposed_count; )
95 /* Invariant: decomposed[0..curr-1] is fully decomposed, i.e.
101 filter->decomposer (decomposed[curr], curr_decomposed);
105 decomposed[curr], making room. It's not worth using
118 for (j = decomposed_count - 1 - shift; j > curr; j--)
122 decomposed[curr + shift] = curr_decomposed[shift];
126 /* decomposed[curr] is atomic. */
127 curr++;