Searched refs:max_n (Results 1 - 6 of 6) sorted by relevance

/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/
H A Dlima_gpu.h105 int i = 0, max_n = max; \
107 uint32_t *plbu_cmd = util_dynarray_ensure_cap(plbu_cmd_array, plbu_cmd_array->size + max_n * 4);
110 assert(i <= max_n); \
160 int i = 0, max_n = max; \
162 uint32_t *vs_cmd = util_dynarray_ensure_cap(vs_cmd_array, vs_cmd_array->size + max_n * 4);
165 assert(i <= max_n); \
/xsrc/external/mit/xf86-video-s3/dist/src/
H A Ds3_IBMRGB.c161 volatile int df, n, m, max_n, min_df; local in function:S3IBMRGBSetClock
195 max_n = fref / 1000 / 2;
197 max_n = fref / 1000;
198 if (max_n > 31)
199 max_n = 31;
201 for (n=2; n <= max_n; n++) {
/xsrc/external/mit/xf86-video-i128/dist/src/
H A Di128IBMDAC.c250 unsigned char tmp2, m, n, df, best_m, best_n, best_df, max_n; local in function:I128ProgramIBMRGB
283 max_n = REF_FREQ / MIN_VREF;
285 max_n >>= 1;
286 for (n=2; n<max_n; n++)
459 unsigned char tmp2, m, n, df, best_m, best_n, best_df, max_n; local in function:I128ProgramSilverHammer
494 max_n = REF_FREQ / MIN_VREF;
496 max_n >>= 1;
497 for (n=2; n<max_n; n++)
/xsrc/external/mit/pixman/dist/test/
H A Daffine-bench.c203 uint32_t max_n,
250 while (++n < max_n && (t1 - t0) < max_time);
202 bench(const bench_info_t * bi,uint32_t max_n,uint32_t max_time,uint32_t * ret_n,uint32_t * ret_time,void (* func)(const pixman_composite_info_t * info)) argument
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/
H A Dlima_draw.c125 int i = 0, max_n = max; \
126 uint32_t *plbu_cmd = util_dynarray_grow_cap(&ctx->plbu_cmd_array, max_n * 4);
129 assert(i <= max_n); \
174 int i = 0, max_n = max; \
175 uint32_t *vs_cmd = util_dynarray_grow_cap(&ctx->vs_cmd_array, max_n * 4);
178 assert(i <= max_n); \
/xsrc/external/mit/xf86-video-intel-old/dist/src/
H A Di830_display.c637 int max_n; local in function:intel_find_pll_g4x
658 max_n = limit->n.max;
660 for (clock.n = limit->n.min; clock.n <= max_n; clock.n++) {
678 max_n = clock.n;

Completed in 11 milliseconds