| /xsrc/external/mit/xorg-server/dist/Xext/ |
| sleepuntil.c | 156 unsigned long delay; local
173 * set delay to 0 to prevent blocking in WaitForSomething().
180 delay = pReq->revive.milliseconds - now.milliseconds;
181 AdjustWaitForDelay(wt, delay);
|
| /xsrc/external/mit/xorg-server/dist/present/ |
| present_fake.c | 91 INT32 delay = ((int64_t) (ust - now)) / 1000; local
94 if (delay <= 0) {
105 fake_vblank->timer = TimerSet(NULL, 0, delay, present_fake_do_timer, fake_vblank);
|
| /xsrc/external/mit/xorg-server.old/dist/Xext/ |
| sleepuntil.c | 172 unsigned long delay; local
190 * set delay to 0 to prevent blocking in WaitForSomething().
197 delay = pReq->revive.milliseconds - now.milliseconds;
198 AdjustWaitForDelay (wt, delay);
|
| /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/ |
| ir3_delay.c | 33 /* The soft delay for approximating the cost of (ss). On a6xx, it takes the
34 * number of delay slots to get a SFU result back (ie. using nop's instead of
47 * Helpers to figure out the necessary delay slots between instructions. Used
55 /* calculate required # of delay slots between the instruction that
86 /* As far as we know, shader outputs don't need any delay. */
145 unsigned delay = 0; local
158 delay = MAX2(delay, d);
161 delay = ir3_delayslots(assigner, consumer, srcn, false);
162 delay -= distance(block, assigner, delay)
175 unsigned delay = 0; local
235 unsigned delay = ir3_delayslots(assigner, consumer, consumer_n, soft); local
310 unsigned delay = 0; local
[all...] |
| ir3_postsched.c | 82 unsigned delay; member in struct:ir3_postsched_node
264 for (unsigned delay = 0; delay < 4; delay++) {
272 if (d > delay)
280 di(chosen->instr, "csp: chose (soft ready, delay=%u)", delay);
285 /* Next try to find a ready leader w/ soft delay (ie. including extra
286 * delay for things like tex fetch which can be synchronized w/ sync
399 node->delay = MAX2(node->delay, d)
680 unsigned delay = local
[all...] |
| ir3_legalize.c | 807 unsigned delay = ir3_delay_calc_exact(block, instr, so->mergedregs); local
814 if ((delay > 0) && (ir->compiler->gen >= 6) && last &&
818 unsigned transfer = MIN2(delay, 3 - last->nop);
820 delay -= transfer;
823 if ((delay > 0) && last && (last->opc == OPC_NOP)) {
825 unsigned transfer = MIN2(delay, 5 - last->repeat);
827 delay -= transfer;
830 if (delay > 0) {
831 debug_assert(delay <= 6);
832 ir3_NOP(block)->repeat = delay - 1
[all...] |
| ir3_sched.c | 62 * Where possible, it tries to pick instructions that avoid nop delay
125 unsigned delay; member in struct:ir3_sched_node
654 * delay.
729 /* Pick the max delay of the remaining ready set. */
1001 n->delay = MAX2(n->delay, d);
1095 n->max_delay = MAX2(n->max_delay, max_delay + n->delay);
1175 unsigned delay = ir3_delay_calc_prera(ctx->block, instr); local
1176 d("delay=%u", delay);
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 52 uint32_t delay; member in struct:schedule_node
517 if (n->delay > chosen->delay) {
520 } else if (n->delay < chosen->delay) {
575 /* There are two QPU delay slots before we can
590 /** Recursive computation of the delay member of a node. */
602 n->delay = 1000;
604 n->delay = 1;
610 n->delay = MAX2(n->delay, (child->delay
[all...] |
| vc4_qpu_schedule.c | 59 uint32_t delay; member in struct:schedule_node
558 * will handle pairing it along with filling the delay slots.
576 * last one, if the remaining instructions fit in the delay
616 * other instructions, allowing us to delay the
645 if (n->delay > chosen->delay) {
648 } else if (n->delay < chosen->delay) {
768 /** Recursive computation of the delay member of a node. */
774 n->delay = 1
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 52 uint32_t delay; member in struct:schedule_node
517 if (n->delay > chosen->delay) {
520 } else if (n->delay < chosen->delay) {
575 /* There are two QPU delay slots before we can
590 /** Recursive computation of the delay member of a node. */
602 n->delay = 1000;
604 n->delay = 1;
610 n->delay = MAX2(n->delay, (child->delay
[all...] |
| vc4_qpu_schedule.c | 59 uint32_t delay; member in struct:schedule_node
558 * will handle pairing it along with filling the delay slots.
576 * last one, if the remaining instructions fit in the delay
616 * other instructions, allowing us to delay the
645 if (n->delay > chosen->delay) {
648 } else if (n->delay < chosen->delay) {
768 /** Recursive computation of the delay member of a node. */
774 n->delay = 1
[all...] |
| /xsrc/external/mit/xorg-server/dist/render/ |
| animcur.c | 52 CARD32 delay; /* in ms */ member in struct:_AnimCurElt
152 return ac->elts[elt].delay;
188 ac->timer = TimerSet(ac->timer, 0, ac->elts[0].delay,
361 ac->elts[i].delay = deltas[i];
|
| /xsrc/external/mit/xorg-server.old/dist/render/ |
| animcur.c | 52 CARD32 delay; /* in ms */ member in struct:_AnimCurElt
184 dev->spriteInfo->anim.time = now + ac->elts[elt].delay;
223 pDev->spriteInfo->anim.time = GetTimeInMillis () + ac->elts[0].delay;
412 ac->elts[i].delay = deltas[i];
|
| /xsrc/external/mit/xrefresh/dist/ |
| xrefresh.c | 87 " -delay ms time to hold refresh\n"
90 fprintf(out, "\nThe default is: %s -none -delay 0\n\n", ProgramName);
197 unsigned long delay = 0; local
236 } else if (isabbreviation("-delay", arg, 2)) {
238 delay = ((unsigned long)atol(argv[i])) * 1000000L;
397 tim.tv_sec = delay / 1000000000L;
398 tim.tv_nsec = delay % 1000000000L;
|
| /xsrc/external/mit/MesaLib/dist/src/intel/compiler/ |
| brw_schedule_instructions.cpp | 87 * This is the sum of the instruction's latency plus the maximum delay of
90 int delay; member in class:schedule_node
969 this->delay = 0;
993 /** Computation of the delay member of each node. */
999 n->delay = issue_time(n->inst);
1002 assert(n->children[i]->delay);
1003 n->delay = MAX2(n->delay, n->latency + n->children[i]->delay);
1676 * the one with the highest delay to the end of the program. This i
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/freedreno/ir3/ |
| ir3_sched.c | 272 /* calculate delay for specified src: */
279 unsigned delay = 0; local
286 delay = MAX2(delay, d);
291 delay = 4;
293 delay = ir3_delayslots(assigner, consumer, srcn);
296 delay = ir3_delayslots(assigner, consumer, srcn);
298 delay -= distance(block, assigner, delay, pred);
301 return delay;
309 unsigned delay = 0; local
503 unsigned delay; local
654 unsigned delay = delay_calc(ctx->block, instr, false, false); local
706 unsigned delay = 6; local
765 unsigned delay = 0; local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/intel/compiler/ |
| brw_schedule_instructions.cpp | 85 * This is the sum of the instruction's latency plus the maximum delay of
88 int delay; member in class:schedule_node
897 this->delay = 0;
923 /** Computation of the delay member of each node. */
929 n->delay = issue_time(n->inst);
932 assert(n->children[i]->delay);
933 n->delay = MAX2(n->delay, n->latency + n->children[i]->delay);
1597 * the one with the highest delay to the end of the program. This i
[all...] |
| /xsrc/external/mit/libXcursor/dist/include/X11/Xcursor/ |
| Xcursor.h | 175 * CARD32 delay animation delay
191 XcursorUInt delay; /* animation delay to next frame (ms) */ member in struct:_XcursorImage
|
| /xsrc/external/mit/xf86-video-intel/dist/src/sna/ |
| sna_present.c | 183 int64_t delay, subframe; local
187 delay = target - swap->msc;
188 assert(delay >= 0);
189 if (delay > 1) { /* try to use the hw vblank for the last frame */
190 delay--;
197 delay *= mode->VTotal * mode->HTotal / mode->Clock;
198 if (subframe < delay)
199 delay -= subframe;
201 delay = 0;
204 (int)(target - swap->msc), (long long)delay));
238 uint32_t delay; local
291 uint32_t delay; local
[all...] |
| /xsrc/external/mit/xf86-video-xgi/dist/src/ |
| vb_i2c.c | 38 /* #include <linux/delay.h> */ /* udelay */
832 ULONG i, delay, delay2; local
835 delay = pHWDE->I2CDelay / 10 / 2;
839 I2C_DelayUS(delay);
842 I2C_DelayUS(delay);
845 delay2 = delay * 2;
858 I2C_DelayUS(delay); /* Jong@08052008 */
860 I2C_DelayUS(delay);
868 I2C_DelayUS(delay);
871 I2C_DelayUS(delay); /* Jong@08052008 *
912 ULONG i, delay, delay2; local
955 ULONG i, delay, delay2; local
1014 ULONG i, delay, delay2; local
1058 ULONG i, j, delay, delay2; local
1105 ULONG ulReadData, data, i, j, delay, delay2; local
[all...] |
| /xsrc/external/mit/xorgproto/dist/include/X11/extensions/ |
| xf86misc.h | 104 int delay; member in struct:__anon11871
|
| xf86mscstr.h | 117 CARD32 delay; member in struct:__anon11876
149 CARD32 delay; member in struct:_XF86MiscSetKbdSettings
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_schedule.c | 66 /* Approximate estimate of the delay between starting this instruction and
74 uint32_t delay; member in struct:__anon799
76 /* Cost of the maximum-delay path from this node to the leaves. */
103 /* An abstract approximation of the number of nir_scheduler_node->delay
769 /* Pick the max delay of the remaining ready set. */
778 fprintf(stderr, "chose (ready max delay): ");
785 /* Pick the max delay of the remaining leaders. */
792 fprintf(stderr, "chose (max delay): ");
937 scoreboard->time + n->delay);
1026 n->max_delay = MAX2(n->max_delay, max_delay + n->delay);
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/broadcom/compiler/ |
| qpu_schedule.c | 59 uint32_t delay; member in struct:schedule_node
702 * will handle pairing it along with filling the delay slots.
714 * left. We'll move it up to fit its delay slots after we
772 * other instructions, allowing us to delay the
803 if (n->delay > chosen->delay) {
806 } else if (n->delay < chosen->delay) {
937 /** Recursive computation of the delay member of a node. */
943 n->delay = 1
[all...] |
| /xsrc/external/mit/xf86-video-openchrome/dist/src/ |
| via_mode.h | 782 CARD16 delay[4]; member in struct:_VIALCDPOWERSEQUENCE
|
