| /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/ |
| bi_validate.c | 58 bi_validate(bi_context *ctx, const char *after)
66 fprintf(stderr, "Uninitialized data read after %s\n", after);
|
| /xsrc/external/mit/ctwm/dist/ |
| win_ring.c | 65 AddWindowToRingUnchecked(TwmWindow *win, TwmWindow *after)
67 TwmWindow *before = after->ring.next;
70 win->ring.prev = after;
72 after->ring.next = win;
|
| /xsrc/external/mit/freetype/dist/src/base/ |
| ftutil.c | 297 FT_ListNode after; local
303 after = list->head;
305 node->next = after;
308 if ( !after )
311 after->prev = node;
323 FT_ListNode before, after; local
330 after = node->next;
333 before->next = after;
335 list->head = after;
337 if ( after )
350 FT_ListNode before, after; local
[all...] |
| /xsrc/external/mit/xorg-server/dist/mi/ |
| mivalidate.h | 48 } after; member in union:_Validate
|
| /xsrc/external/mit/xorg-server.old/dist/mi/ |
| mivalidate.h | 48 } after; member in union:_Validate
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/nir/ |
| nir_control_flow.c | 38 * after.
104 * We're trying to link an if to a block after it; this just means linking
132 * We're trying to link a block to an if after it; this just means linking
182 * some kind of cleanup *must* be performed after this call.
357 * "after" arguments are filled out with the blocks resulting from the split
367 nir_block *before, *after; local
370 after = cursor.block;
376 after = split_block_end(cursor.block);
380 after = cursor.instr->block;
386 * after-a-jump-instr case contained to split_block_end()
476 nir_cf_node *after = nir_cf_node_next(&loop->cf_node); local
584 nir_block *before, *after; local
782 nir_block *before, *after; local
[all...] |
| nir_control_flow.h | 54 /** puts a control flow node immediately after another control flow node */
56 nir_cf_node_insert_after(nir_cf_node *node, nir_cf_node *after)
58 nir_cf_node_insert(nir_after_cf_node(node), after); local
95 * 1) After an if statement, if neither branch ends in a jump.
96 * 2) After a loop, if there are multiple breaks.
103 * extracting all the phi nodes after it is not allowed, and neither is
116 * uses after all is said and done. Either the caller must ensure that this
|
| nir_opt_dead_cf.c | 44 * Another way is that control flow can end in a jump so that code after it
45 * never gets executed. In particular, this can happen after optimizing
67 * issues with needing to be careful with restarting after deleting the
86 /* First, we need to remove any phi nodes after the if by rewriting uses to
89 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(&if_stmt->cf_node)); local
93 nir_foreach_instr_safe(instr, after) {
115 * list after the if since it's unreachable and the validator will balk if
142 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(node)); local
159 use->parent_instr->block->index >= after->index)
169 use_block->index >= after->index
197 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(node)); local
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/ |
| nir_control_flow.c | 38 * after.
104 * We're trying to link an if to a block after it; this just means linking
132 * We're trying to link a block to an if after it; this just means linking
182 * some kind of cleanup *must* be performed after this call.
364 * "after" arguments are filled out with the blocks resulting from the split
374 nir_block *before, *after; local
377 after = cursor.block;
383 after = split_block_end(cursor.block);
387 after = cursor.instr->block;
393 * after-a-jump-instr case contained to split_block_end()
482 nir_cf_node *after = nir_cf_node_next(&loop->cf_node); local
574 nir_block *before, *after; local
706 nir_block *before, *after; local
[all...] |
| nir_control_flow.h | 54 /** puts a control flow node immediately after another control flow node */
56 nir_cf_node_insert_after(nir_cf_node *node, nir_cf_node *after)
58 nir_cf_node_insert(nir_after_cf_node(node), after); local
95 * 1) After an if statement, if neither branch ends in a jump.
96 * 2) After a loop, if there are multiple breaks.
103 * extracting all the phi nodes after it is not allowed, and neither is
116 * uses after all is said and done. Either the caller must ensure that this
|
| nir_opt_dead_cf.c | 44 * Another way is that control flow can end in a jump so that code after it
45 * never gets executed. In particular, this can happen after optimizing
67 * issues with needing to be careful with restarting after deleting the
86 /* First, we need to remove any phi nodes after the if by rewriting uses to
89 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(&if_stmt->cf_node)); local
93 nir_foreach_instr_safe(instr, after) {
115 * list after the if since it's unreachable and the validator will balk if
142 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(node)); local
159 use->parent_instr->block->index >= after->index)
169 use_block->index >= after->index
197 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(node)); local
[all...] |
| nir_opt_conditional_discard.c | 62 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(&if_stmt->cf_node));
63 nir_foreach_instr_safe(instr, after) {
|
| /xsrc/external/mit/libXmu/dist/src/ |
| ClientWin.c | 48 unsigned long nitems, after; local
56 &type, &format, &nitems, &after, &data);
76 unsigned long nitems, after; local
86 &after, &data);
|
| /xsrc/external/mit/MesaLib/dist/src/microsoft/resource_state_manager/ |
| D3D12ResourceState.cpp | 270 D3D12_RESOURCE_STATES after = DestinationState.GetSubresourceState(i); local
271 if (after == UNKNOWN_RESOURCE_STATE)
281 after,
298 D3D12_RESOURCE_STATES after,
322 auto StateIfPromoted = CurrentState.StateIfPromoted(after, SubresourceIndex);
326 if (TransitionRequired(CurrentLogicalState.State, /*inout*/ after))
330 TransitionDesc.Transition.StateAfter = D3D12_RESOURCE_STATES(after);
334 MayDecay = CurrentState.SupportsSimultaneousAccess() && !IsD3D12WriteState(after);
341 if(after != StateIfPromoted)
343 after = StateIfPromoted
[all...] |
| /xsrc/external/mit/pixman/dist/test/ |
| radial-perf-test.c | 24 double before, after; local
52 after = gettime();
56 printf ("Average time to composite: %f\n", (after - before) / N_COMPOSITE);
|
| /xsrc/external/mit/xorg-server/dist/miext/rootless/ |
| rootlessValTree.c | 226 RegionNull(&pChild->valdata->after.borderExposed);
228 RegionSubtract(&pChild->valdata->after.
232 RegionNull(&pChild->valdata->after.exposed);
270 RegionNull(&pParent->valdata->after.borderExposed);
271 RegionNull(&pParent->valdata->after.exposed);
296 RegionSubtract(&pParent->valdata->after.borderExposed,
300 RegionSubtract(&pParent->valdata->after.borderExposed,
376 RegionCopy(&pParent->valdata->after.exposed, universe);
380 RegionSubtract(&pParent->valdata->after.exposed,
525 RegionNull(&pRoot->valdata->after.exposed)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/ |
| radeon_program.h | 204 struct rc_instruction *rc_insert_new_instruction(struct radeon_compiler * c, struct rc_instruction * after);
205 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst);
|
| radeon_program.c | 184 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst)
186 inst->Prev = after;
187 inst->Next = after->Next;
193 struct rc_instruction *rc_insert_new_instruction(struct radeon_compiler * c, struct rc_instruction * after)
197 rc_insert_instruction(after, inst);
|
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/ |
| radeon_program.h | 204 struct rc_instruction *rc_insert_new_instruction(struct radeon_compiler * c, struct rc_instruction * after);
205 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst);
|
| radeon_program.c | 184 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst)
186 inst->Prev = after;
187 inst->Next = after->Next;
193 struct rc_instruction *rc_insert_new_instruction(struct radeon_compiler * c, struct rc_instruction * after)
197 rc_insert_instruction(after, inst);
|
| /xsrc/external/mit/MesaLib/dist/src/compiler/glsl/ |
| list.h | 81 * Insert a node in the list after the current node
83 void insert_after(exec_node *after);
86 * Insert another list in the list after the current node
88 void insert_after(struct exec_list *after);
165 exec_node_insert_after(struct exec_node *n, struct exec_node *after)
167 after->next = n->next;
168 after->prev = n;
170 n->next->prev = after;
171 n->next = after;
237 inline void exec_node::insert_after(exec_node *after)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/ |
| list.h | 81 * Insert a node in the list after the current node
83 void insert_after(exec_node *after);
86 * Insert another list in the list after the current node
88 void insert_after(struct exec_list *after);
165 exec_node_insert_after(struct exec_node *n, struct exec_node *after)
167 after->next = n->next;
168 after->prev = n;
170 n->next->prev = after;
171 n->next = after;
237 inline void exec_node::insert_after(exec_node *after)
[all...] |
| /xsrc/external/mit/xorg-server.old/dist/miext/rootless/ |
| rootlessValTree.c | 296 RegionNull(&pChild->valdata->after.borderExposed);
299 RegionSubtract(&pChild->valdata->after.borderExposed,
303 RegionNull(&pChild->valdata->after.exposed);
344 RegionNull(&pParent->valdata->after.borderExposed);
345 RegionNull(&pParent->valdata->after.exposed);
373 RegionSubtract(&pParent->valdata->after.borderExposed,
377 RegionSubtract(&pParent->valdata->after.borderExposed,
465 RegionCopy(&pParent->valdata->after.exposed, universe);
470 RegionSubtract(&pParent->valdata->after.exposed,
619 RegionNull(&pRoot->valdata->after.exposed)
[all...] |
| /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 70 /* When walking the instructions in reverse, we need to swap before/after in
76 * Marks a dependency between two intructions, that \p after must appear after
86 struct schedule_node *after)
88 if (!before || !after)
91 assert(before != after);
95 before = after;
96 after = t;
99 dag_add_edge(&after->dag, &before->dag, NULL);
105 struct schedule_node *after)
[all...] |
| /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/ |
| vc4_qir_schedule.c | 70 /* When walking the instructions in reverse, we need to swap before/after in
76 * Marks a dependency between two intructions, that \p after must appear after
86 struct schedule_node *after)
88 if (!before || !after)
91 assert(before != after);
95 before = after;
96 after = t;
99 dag_add_edge(&after->dag, &before->dag, NULL);
105 struct schedule_node *after)
[all...] |
