Lines Matching refs:sortbuf_count
48 size_t sortbuf_count;
69 filter->sortbuf_count = 0;
133 /* Cache sortbuf and sortbuf_count in local register variables. */
135 size_t sortbuf_count = filter->sortbuf_count;
150 if (sortbuf_count > 1)
151 gl_uninorm_decompose_merge_sort_inplace (sortbuf, sortbuf_count,
152 sortbuf + sortbuf_count);
176 if (sortbuf_count > 0 && sortbuf[0].ccc == 0)
178 for (j = 1; j < sortbuf_count; )
190 for (k = j + 1; k < sortbuf_count; k++)
192 sortbuf_count--;
198 if (sortbuf_count == 1)
209 sortbuf_count = 0;
215 for (j = 0; j < sortbuf_count; j++)
224 filter->sortbuf_count = 0;
230 sortbuf_count = 0;
234 if (sortbuf_count == filter->sortbuf_allocated)
239 if (filter->sortbuf_allocated < sortbuf_count) /* integer overflow? */
245 sortbuf_count * sizeof (struct ucs4_with_ccc));
250 filter->sortbuf[sortbuf_count].code = uc;
251 filter->sortbuf[sortbuf_count].ccc = ccc;
252 sortbuf_count++;
255 filter->sortbuf_count = sortbuf_count;
270 /* Cache sortbuf and sortbuf_count in local register variables. */
272 size_t sortbuf_count = filter->sortbuf_count;
277 if (sortbuf_count > 1)
278 gl_uninorm_decompose_merge_sort_inplace (sortbuf, sortbuf_count,
279 sortbuf + sortbuf_count);
303 if (sortbuf_count > 0 && sortbuf[0].ccc == 0)
305 for (j = 1; j < sortbuf_count; )
317 for (k = j + 1; k < sortbuf_count; k++)
319 sortbuf_count--;
328 for (j = 0; j < sortbuf_count; j++)
337 filter->sortbuf_count = 0;
343 filter->sortbuf_count = 0;
360 if (filter->sortbuf_count > 0)