Searched refs:after (Results 1 - 25 of 710) sorted by relevance

1234567891011>>

/xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
H A Dbi_validate.c58 bi_validate(bi_context *ctx, const char *after) argument
66 fprintf(stderr, "Uninitialized data read after %s\n", after);
/xsrc/external/mit/freetype/dist/src/base/
H A Dftutil.c297 FT_ListNode after; local in function:FT_List_Insert
303 after = list->head;
305 node->next = after;
308 if ( !after )
311 after->prev = node;
323 FT_ListNode before, after; local in function:FT_List_Remove
330 after = node->next;
333 before->next = after;
335 list->head = after;
337 if ( after )
350 FT_ListNode before, after; local in function:FT_List_Up
[all...]
/xsrc/external/mit/xorg-server.old/dist/mi/
H A Dmivalidate.h48 } after; member in union:_Validate
/xsrc/external/mit/xorg-server/dist/mi/
H A Dmivalidate.h48 } after; member in union:_Validate
/xsrc/external/mit/ctwm/dist/
H A Dwin_ring.c65 AddWindowToRingUnchecked(TwmWindow *win, TwmWindow *after) argument
67 TwmWindow *before = after->ring.next;
70 win->ring.prev = after;
72 after->ring.next = win;
/xsrc/external/mit/MesaLib/dist/src/compiler/nir/
H A Dnir_control_flow.c38 * 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 in function:split_block_cursor
370 after = cursor.block;
376 after = split_block_end(cursor.block);
380 after = cursor.instr->block;
386 * after
412 insert_non_block(nir_block * before,nir_cf_node * node,nir_block * after) argument
476 nir_cf_node *after = nir_cf_node_next(&loop->cf_node); local in function:nir_handle_add_jump
552 stitch_blocks(nir_block * before,nir_block * after) argument
584 nir_block *before, *after; local in function:nir_cf_node_insert
782 nir_block *before, *after; local in function:nir_cf_reinsert
[all...]
H A Dnir_control_flow.h54 /** 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) argument
58 nir_cf_node_insert(nir_after_cf_node(node), after);
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
H A Dnir_opt_dead_cf.c44 * 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 in function:opt_constant_if
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 in function:def_only_used_in_cf_node
159 use->parent_instr->block->index >= after->index)
169 use_block->index >= after
197 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(node)); local in function:node_is_dead
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/compiler/nir/
H A Dnir_control_flow.c38 * 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 in function:split_block_cursor
377 after = cursor.block;
383 after = split_block_end(cursor.block);
387 after = cursor.instr->block;
393 * after
419 insert_non_block(nir_block * before,nir_cf_node * node,nir_block * after) argument
482 nir_cf_node *after = nir_cf_node_next(&loop->cf_node); local in function:nir_handle_add_jump
542 stitch_blocks(nir_block * before,nir_block * after) argument
574 nir_block *before, *after; local in function:nir_cf_node_insert
706 nir_block *before, *after; local in function:nir_cf_reinsert
[all...]
H A Dnir_control_flow.h54 /** 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) argument
58 nir_cf_node_insert(nir_after_cf_node(node), after);
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
H A Dnir_opt_dead_cf.c44 * 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 in function:opt_constant_if
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 in function:def_only_used_in_cf_node
159 use->parent_instr->block->index >= after->index)
169 use_block->index >= after
197 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(node)); local in function:node_is_dead
[all...]
H A Dnir_opt_conditional_discard.c62 nir_block *after = nir_cf_node_as_block(nir_cf_node_next(&if_stmt->cf_node)); local in function:nir_opt_conditional_discard_block
63 nir_foreach_instr_safe(instr, after) {
/xsrc/external/mit/libXmu/dist/src/
H A DClientWin.c48 unsigned long nitems, after; local in function:XmuClientWindow
56 &type, &format, &nitems, &after, &data);
76 unsigned long nitems, after; local in function:TryChildren
86 &after, &data);
/xsrc/external/mit/MesaLib/dist/src/microsoft/resource_state_manager/
H A DD3D12ResourceState.cpp270 D3D12_RESOURCE_STATES after = DestinationState.GetSubresourceState(i); local in function:ResourceStateManager::ProcessTransitioningResource
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
294 ProcessTransitioningSubresourceExplicit(CCurrentResourceState & CurrentState,UINT SubresourceIndex,D3D12_RESOURCE_STATES state,D3D12_RESOURCE_STATES after,TransitionableResourceState & TransitionableResourceState,D3D12_RESOURCE_BARRIER & TransitionDesc,UINT64 ExecutionId) argument
[all...]
/xsrc/external/mit/pixman/dist/test/
H A Dradial-perf-test.c24 double before, after; local in function:main
52 after = gettime();
56 printf ("Average time to composite: %f\n", (after - before) / N_COMPOSITE);
/xsrc/external/mit/xorg-server/dist/miext/rootless/
H A DrootlessValTree.c226 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
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/r300/compiler/
H A Dradeon_program.h204 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);
H A Dradeon_program.c184 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst) argument
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) argument
197 rc_insert_instruction(after, inst);
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/r300/compiler/
H A Dradeon_program.h204 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);
H A Dradeon_program.c184 void rc_insert_instruction(struct rc_instruction * after, struct rc_instruction * inst) argument
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) argument
197 rc_insert_instruction(after, inst);
/xsrc/external/mit/MesaLib/dist/src/compiler/glsl/
H A Dlist.h81 * 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) argument
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) argument
524 exec_node_insert_list_after(struct exec_node * n,struct exec_list * after) argument
666 insert_after(exec_list * after) argument
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/compiler/glsl/
H A Dlist.h81 * 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) argument
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) argument
524 exec_node_insert_list_after(struct exec_node * n,struct exec_list * after) argument
666 insert_after(exec_list * after) argument
[all...]
/xsrc/external/mit/xorg-server.old/dist/miext/rootless/
H A DrootlessValTree.c296 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
[all...]
/xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/vc4/
H A Dvc4_qir_schedule.c70 /* 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)
84 add_dep(enum direction dir,struct schedule_node * before,struct schedule_node * after) argument
103 add_write_dep(enum direction dir,struct schedule_node ** before,struct schedule_node * after) argument
558 latency_between(struct schedule_node * before,struct schedule_node * after) argument
[all...]
/xsrc/external/mit/MesaLib/dist/src/gallium/drivers/vc4/
H A Dvc4_qir_schedule.c70 /* 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)
84 add_dep(enum direction dir,struct schedule_node * before,struct schedule_node * after) argument
103 add_write_dep(enum direction dir,struct schedule_node ** before,struct schedule_node * after) argument
558 latency_between(struct schedule_node * before,struct schedule_node * after) argument
[all...]

Completed in 36 milliseconds

1234567891011>>