HomeSort by: relevance | last modified time | path
    Searched defs:succ (Results 1 - 25 of 105) sorted by relevancy

1 2 3 4 5

  /src/external/ibm-public/postfix/dist/src/util/
ring.c 83 ring->pred = ring->succ = ring;
90 entry->succ = ring->succ;
92 ring->succ->pred = entry;
93 ring->succ = entry;
101 entry->succ = ring;
102 ring->pred->succ = entry;
110 RING *succ = entry->succ; local
113 pred->succ = succ
    [all...]
ring.h 22 RING *succ; /* successor */ member in struct:RING
31 #define ring_succ(c) ((c)->succ)
  /xsrc/external/mit/MesaLib/dist/src/freedreno/ir3/
ir3_remove_unreachable.c 59 struct ir3_block *succ = block->successors[i]; local
60 if (!succ)
63 unsigned pred_idx = ir3_block_get_pred_index(succ, block);
68 bool swap_pred = pred_idx != succ->predecessors_count - 1;
70 foreach_instr (phi, &succ->instr_list) {
79 succ->predecessors[pred_idx] =
80 succ->predecessors[succ->predecessors_count - 1];
82 succ->predecessors_count--;
86 struct ir3_block *succ = block->physical_successors[i] local
    [all...]
  /src/external/bsd/ntp/dist/sntp/libopts/
reset.c 82 tSuccess succ; local
110 succ = opt_find_short(pOpts, (uint8_t)*pzArg, &opt_state);
111 if (! SUCCESSFUL(succ)) {
118 succ = opt_find_long(pOpts, __UNCONST(pzArg), &opt_state);
119 if (! SUCCESSFUL(succ)) {
  /xsrc/external/mit/MesaLib/dist/src/panfrost/bifrost/
bir.c 214 struct bi_block *succ = block->successors[0]; local
215 assert(succ->predecessors);
218 return (succ->predecessors->entries > 1);
  /xsrc/external/mit/MesaLib/dist/src/panfrost/midgard/
midgard_ra_pipeline.c 140 bool succ = mir_pipeline_ins(ctx, block, bundle, 0, 0); local
141 mir_pipeline_ins(ctx, block, bundle, 1, succ);
  /src/tests/rump/kernspace/
alloc.c 83 int succ, i; local
108 for (succ = 0;; succ++) {
109 if (succ * 1024 > thelimit)
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/pp/
liveness.c 207 ppir_block *succ = block->successors[i]; local
208 if (!succ)
213 while (list_is_empty(&succ->instr_list)) {
214 assert(succ->successors[0] && !succ->successors[1]);
215 succ = succ->successors[0];
218 next_instr = list_first_entry(&succ->instr_list, ppir_instr, list);
scheduler.c 139 ppir_instr *succ = dep->succ; local
140 if (!succ->scheduled) {
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/gp/
value_regalloc.c 60 gpir_node *succ = dep->succ; local
61 gpir_load_node *load = gpir_node_create(succ->block, gpir_op_load_reg);
63 gpir_node_replace_child(succ, spill, &load->node);
64 list_addtail(&load->node.list, &succ->list);
66 /* only valid for succ already scheduled, succ not scheduled will
72 load->node.vreg.last = succ;
94 gpir_node *succ = dep->succ; local
    [all...]
reduce_scheduler.c 143 gpir_node *succ = dep->succ; local
144 if (!succ->rsched.scheduled) {
  /src/external/gpl3/gcc/dist/gcc/
graphds.h 37 struct graph_edge *pred, *succ; member in struct:vertex
shortest-paths.h 141 edge_t *succ; local
142 FOR_EACH_VEC_ELT (n->m_succs, i, succ)
145 node_t *dest = succ->m_dest;
150 m_best_edge[dest->m_index] = succ;
  /src/external/gpl3/gcc.old/dist/gcc/
graphds.h 37 struct graph_edge *pred, *succ; member in struct:vertex
shortest-paths.h 141 edge_t *succ; local
142 FOR_EACH_VEC_ELT (n->m_succs, i, succ)
145 node_t *dest = succ->m_dest;
150 m_best_edge[dest->m_index] = succ;
  /xsrc/external/mit/MesaLib/dist/src/gallium/drivers/lima/ir/gp/
reduce_scheduler.c 150 gpir_node *succ = dep->succ; local
151 if (!succ->rsched.scheduled) {
  /xsrc/external/mit/MesaLib.old/dist/src/gallium/drivers/lima/ir/pp/
node_to_instr.c 95 ppir_node *succ = dep->succ; local
96 assert(succ->type == ppir_node_type_alu);
98 if (!ppir_instr_insert_node(succ->instr, node)) {
117 ppir_node_replace_child(succ, node, move);
140 ppir_node *succ = dep->succ; local
144 node->instr = succ->instr;
148 if (succ->instr == node->instr)
152 if (succ->instr == dup->instr)
196 ppir_node *succ = ppir_node_first_succ(node); local
344 ppir_node *succ = dep->succ; local
    [all...]
scheduler.c 139 ppir_instr *succ = dep->succ; local
140 if (!succ->scheduled) {
  /src/crypto/external/apache2/openssl/dist/crypto/ec/curve448/
f_generic.c 74 mask_t succ; local
92 succ = with_hibit ? 0 - (mask_t)1 : ~gf_hibit(x);
93 return succ & word_is_zero((word_t)buffer) & ~word_is_zero((word_t)scarry);
  /src/crypto/external/bsd/openssl/dist/crypto/ec/curve448/
f_generic.c 74 mask_t succ; local
95 succ = with_hibit ? 0 - (mask_t) 1 : ~gf_hibit(x);
96 return succ & word_is_zero((word_t)buffer) & ~word_is_zero((word_t)scarry);
  /src/crypto/external/bsd/openssl.old/dist/crypto/ec/curve448/
f_generic.c 74 mask_t succ; local
95 succ = with_hibit ? 0 - (mask_t) 1 : ~gf_hibit(x);
96 return succ & word_is_zero((word_t)buffer) & ~word_is_zero((word_t)scarry);
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
UnreachableBlockElim.cpp 127 MachineBasicBlock* succ = *BB.succ_begin(); local
129 MachineBasicBlock::iterator start = succ->begin();
130 while (start != succ->end() && start->isPHI()) {
  /src/external/gpl3/gcc/dist/gcc/config/epiphany/
resolve-sw-modes.cc 155 basic_block succ = e->dest; local
158 if (!REGNO_REG_SET_P (DF_LIVE_IN (succ), jilted_reg))
160 if (REGNO_REG_SET_P (DF_LIVE_IN (succ), selected_reg))
162 if (bitmap_bit_p (pushed, succ->index))
164 todo.quick_push (succ);
  /src/external/gpl3/gcc.old/dist/gcc/config/epiphany/
resolve-sw-modes.cc 155 basic_block succ = e->dest; local
158 if (!REGNO_REG_SET_P (DF_LIVE_IN (succ), jilted_reg))
160 if (REGNO_REG_SET_P (DF_LIVE_IN (succ), selected_reg))
162 if (bitmap_bit_p (pushed, succ->index))
164 todo.quick_push (succ);
  /xsrc/external/mit/MesaLib/dist/src/amd/compiler/
aco_ssa_elimination.cpp 225 Block& succ = ctx.program->blocks[block->linear_succs[0]]; local
228 branch.target[0] = succ.index;
229 branch.target[1] = succ.index;
231 branch.target[0] = succ.index;
232 } else if (branch.target[0] == succ.index) {
234 branch.target[1] = succ.index;
237 /* check if there is a fall-through path from block to succ */
238 bool falls_through = block->index < succ.index;
239 for (unsigned j = block->index + 1; falls_through && j < succ.index; j++) {
245 branch.target[1] = succ.index
    [all...]

Completed in 58 milliseconds

1 2 3 4 5