HomeSort by: relevance | last modified time | path
    Searched refs:rank (Results 1 - 11 of 11) sorted by relevancy

  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/llvmpipe/
lp_fence.c 38 * The rank will be the number of bins in the scene. Whenever a rendering
40 * the counter == the rank, the fence is finished.
42 * \param rank the expected finished value of the fence counter.
45 lp_fence_create(unsigned rank)
59 fence->rank = rank;
83 * When the counter == the rank, the fence is finished.
94 assert(fence->count <= fence->rank);
97 debug_printf("%s count=%u rank=%u\n", __FUNCTION__,
98 fence->count, fence->rank);
    [all...]
lp_fence.h 50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/llvmpipe/
lp_fence.c 38 * The rank will be the number of bins in the scene. Whenever a rendering
40 * the counter == the rank, the fence is finished.
42 * \param rank the expected finished value of the fence counter.
45 lp_fence_create(unsigned rank)
59 fence->rank = rank;
83 * When the counter == the rank, the fence is finished.
94 assert(fence->count <= fence->rank);
97 debug_printf("%s count=%u rank=%u\n", __FUNCTION__,
98 fence->count, fence->rank);
    [all...]
lp_fence.h 50 unsigned rank; member in struct:lp_fence
56 lp_fence_create(unsigned rank);
  /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/
ir3_sched.c 606 dec_rank_name(enum choose_instr_dec_rank rank)
608 switch (rank) {
651 enum choose_instr_dec_rank rank; local
657 rank = DEC_FREED_READY;
659 rank = DEC_FREED;
669 rank = DEC_NEUTRAL_READY;
671 rank = DEC_NEUTRAL;
674 /* Prefer higher-ranked instructions, or in the case of a rank tie, the
677 if (!chosen || rank > chosen_rank ||
678 (rank == chosen_rank && chosen->max_delay < n->max_delay))
742 enum choose_instr_inc_rank rank; local
    [all...]
  /xsrc/external/mit/pixman/dist/pixman/dither/
make-blue-noise.c 519 int x, y, rank; local
534 // Compute initial rank
547 for (rank = initial_rank; rank > 0; --rank)
551 *array_get (array, x, y) = rank - 1;
562 for (rank = initial_rank; rank < width * height; ++rank)
566 *array_get (array, x, y) = rank;
    [all...]
  /xsrc/external/mit/xedit/dist/lisp/
core.c 373 if (count >= array->data.array.rank)
381 if (count < array->data.array.rank)
2617 long rank = 0, count = 1, offset, zero, c; local
2636 rank = 1;
2642 for (rank = 0; CONSP(dim); rank++, dim = CDR(dim)) {
2651 rank = count = 0;
2686 if (rank) {
2731 if (rank == 0)
2733 else if (rank == 1)
6929 long rank, count, sequence, offset, accum; local
    [all...]
helper.c 115 left->data.array.rank == right->data.array.rank &&
319 if (sequence->data.array.rank != 1)
543 if (ARRAYP(object) && object->data.array.rank == 1)
internal.h 603 unsigned int rank : 8; /* i.e. array-rank-limit => 256 */ member in struct:_LispObj::__anon6613::__anon6620
string.c 791 if (ARRAYP(ochars) && ochars->data.array.rank == 1)
lisp.c 2865 array->data.array.rank = 1;

Completed in 46 milliseconds