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

1 2 3

  /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)
  /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)) {
  /src/tests/rump/kernspace/
alloc.c 83 int succ, i; local
108 for (succ = 0;; succ++) {
109 if (succ * 1024 > thelimit)
  /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;
hw-doloop.cc 283 basic_block succ = EDGE_SUCC (bb, ei.index)->dest; local
284 if (REGNO_REG_SET_P (df_get_live_in (succ),
286 works.safe_push (succ);
382 basic_block succ = FALLTHRU_EDGE (bb)->dest; local
388 if (!REGNO_REG_SET_P (df_get_live_in (succ), REGNO (reg)))
lcm.cc 77 This is done based on the flow graph, and not on the pred-succ lists.
177 basic_block pred, succ;
185 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
187 bitmap_copy (earliest[x], antin[succ->index]);
190 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun))
194 bitmap_and_compl (difference, antin[succ->index],
590 basic_block pred, succ;
598 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
599 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun))
608 st_antin[succ->index])
176 basic_block pred, succ; local
589 basic_block pred, succ; local
    [all...]
  /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;
hw-doloop.cc 283 basic_block succ = EDGE_SUCC (bb, ei.index)->dest; local
284 if (REGNO_REG_SET_P (df_get_live_in (succ),
286 works.safe_push (succ);
382 basic_block succ = FALLTHRU_EDGE (bb)->dest; local
388 if (!REGNO_REG_SET_P (df_get_live_in (succ), REGNO (reg)))
lcm.cc 80 This is done based on the flow graph, and not on the pred-succ lists.
175 basic_block pred, succ;
183 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
185 bitmap_copy (earliest[x], antin[succ->index]);
188 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun))
192 bitmap_and_compl (difference, antin[succ->index],
591 basic_block pred, succ;
599 succ = INDEX_EDGE_SUCC_BB (edge_list, x);
600 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun))
609 st_antin[succ->index])
174 basic_block pred, succ; local
590 basic_block pred, succ; local
    [all...]
  /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);
curve448.c 188 mask_t succ; local
194 succ = gf_eq(a, b);
196 return mask_to_bool(succ);
327 mask_t succ; local
334 succ = gf_deserialize(p->y, enc2, 1, 0);
335 succ &= word_is_zero(enc2[EDDSA_448_PRIVATE_BYTES - 1]);
343 succ &= gf_isr(p->t, p->x); /* 1/sqrt(num * denom) */
374 assert(ossl_curve448_point_valid(p) || ~succ);
376 return c448_succeed_if(mask_to_bool(succ));
  /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);
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
RegionIterator.h 88 NodeRef succ; local
89 succ = getNode()->getParent()->getNode(BB);
90 assert(succ && "BB not in Region or entered subregion!");
91 return succ;
  /src/tests/net/icmp/
t_ping.c 151 int loop, succ; local
179 succ = 0;
197 succ++;
205 return succ;
214 int succ; local
233 succ = doping("1.1.1.10", LOOPS, 56);
234 printf("got %d/%d\n", succ, LOOPS);
250 int succ; local
261 succ = doping("1.1.1.20", LOOPS, 56);
265 succ = doping("1.1.1.10", LOOPS, 56)
283 int sent, succ, i; local
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
ExplodedGraph.cpp 96 const ExplodedNode *succ = *(node->succ_begin()); local
97 if (succ->pred_size() != 1)
142 const ProgramPoint SuccLoc = succ->getLocation();
161 ExplodedNode *succ = *(node->succ_begin()); local
162 pred->replaceSuccessor(succ);
163 succ->replacePredecessor(pred);
  /src/external/gpl3/gcc/dist/gcc/analyzer/
state-purge.cc 1048 superedge *succ; local
1049 FOR_EACH_VEC_ELT (snode->m_succs, i, succ)
1051 enum edge_kind kind = succ->get_kind ();
1054 add_to_worklist (function_point::before_supernode (succ->m_dest,
1055 succ),
  /src/external/gpl3/gcc.old/dist/gcc/analyzer/
state-purge.cc 1039 superedge *succ; local
1040 FOR_EACH_VEC_ELT (snode->m_succs, i, succ)
1042 enum edge_kind kind = succ->get_kind ();
1045 add_to_worklist (function_point::before_supernode (succ->m_dest,
1046 succ),
  /src/usr.bin/make/
make.c 636 GNode *succ = ln->datum; local
638 if (succ->made == DEFERRED &&
639 !MakeBuildChild(succ, toBeMadeNext))
640 succ->flags.doneOrder = true;

Completed in 31 milliseconds

1 2 3