| /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/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/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/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/mpl/dhcp/bind/dist/lib/isc/unix/include/isc/ |
| stdatomic.h | 138 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \
141 succ, fail)
142 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \
145 succ, fail)
161 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \
163 __atomic_compare_exchange_n(obj, expected, desired, 0, succ, fail)
164 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \
166 __atomic_compare_exchange_n(obj, expected, desired, 1, succ, fail)
186 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \
197 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \
[all...] |
| /src/external/mpl/dhcp/bind/include/isc/ |
| stdatomic.h | 136 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \
139 succ, fail)
140 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \
143 succ, fail)
159 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \
161 __atomic_compare_exchange_n(obj, expected, desired, 0, succ, fail)
162 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \
164 __atomic_compare_exchange_n(obj, expected, desired, 1, succ, fail)
184 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \
195 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \
[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;
|
| graphds.cc | 37 && !g->vertices[i].succ)
46 for (e = g->vertices[i].succ; e; e = e->succ_next)
81 e->succ_next = vf->succ;
82 vf->succ = e;
97 for (e = uu->succ; e; e = next)
102 e->succ_next = vv->succ;
103 vv->succ = e;
105 uu->succ = NULL;
178 e = (forward ? g->vertices[v].succ : g->vertices[v].pred);
337 for (e = g->vertices[i].succ; e; e = e->succ_next
[all...] |
| sel-sched.cc | 596 /* Returns true when SUCC in a fallthru bb of INSN, possibly
599 in_fallthru_bb_p (rtx_insn *insn, rtx succ)
604 if (bb == BLOCK_FOR_INSN (succ))
616 return bb == BLOCK_FOR_INSN (succ);
629 insn_t succ;
650 insn_t succ;
652 succ = (sel_bb_end_p (insn)
656 if (INSN_SEQNO (succ) > 0
657 && INSN_SEQNO (succ) <= orig_max_seqno
658 && INSN_SCHED_TIMES (succ) <= 0
625 insn_t succ; local
646 insn_t succ; local
2731 insn_t succ, zero_succ = NULL; local
3165 rtx_insn *succ; local
4575 basic_block succ; local
5377 insn_t succ; local
6307 insn_t succ; local
6739 basic_block succ = BLOCK_FOR_INSN (succ_insn); local
[all...] |
| /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;
|
| graphds.cc | 37 && !g->vertices[i].succ)
46 for (e = g->vertices[i].succ; e; e = e->succ_next)
81 e->succ_next = vf->succ;
82 vf->succ = e;
97 for (e = uu->succ; e; e = next)
102 e->succ_next = vv->succ;
103 vv->succ = e;
105 uu->succ = NULL;
178 e = (forward ? g->vertices[v].succ : g->vertices[v].pred);
344 for (e = g->vertices[i].succ; e; e = e->succ_next
[all...] |
| sel-sched.cc | 596 /* Returns true when SUCC in a fallthru bb of INSN, possibly
599 in_fallthru_bb_p (rtx_insn *insn, rtx succ)
604 if (bb == BLOCK_FOR_INSN (succ))
616 return bb == BLOCK_FOR_INSN (succ);
629 insn_t succ;
650 insn_t succ;
652 succ = (sel_bb_end_p (insn)
656 if (INSN_SEQNO (succ) > 0
657 && INSN_SEQNO (succ) <= orig_max_seqno
658 && INSN_SCHED_TIMES (succ) <= 0
625 insn_t succ; local
646 insn_t succ; local
2739 insn_t succ, zero_succ = NULL; local
3173 rtx_insn *succ; local
4583 basic_block succ; local
5385 insn_t succ; local
6315 insn_t succ; local
6747 basic_block succ = BLOCK_FOR_INSN (succ_insn); local
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/ProfileData/ |
| GCOV.cpp | 402 if (!succ.empty()) {
404 for (const GCOVArc *Edge : succ) {
434 if (i == u->succ.size()) {
442 GCOVArc *succ = u->succ[i]; local
446 if (succ->cycleCount == 0 || !succ->dst.traversable || &succ->dst == u)
448 if (succ->dst.incoming == nullptr) {
449 succ->dst.incoming = succ
[all...] |
| /src/bin/ed/ |
| ed.h | 141 /* REQUE: link pred before succ */
142 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred)
|
| /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/analyzer/ |
| program-point.cc | 407 /* Check to see if SUCC is a valid edge to take (ensuring that we have
411 Update the call string if SUCC is a call or a return.
413 Return true if SUCC can be taken, or false otherwise.
419 const superedge *succ)
423 switch (succ->m_kind)
427 const cfg_superedge *cfg_sedge = as_a <const cfg_superedge *> (succ);
450 const call_superedge *call_sedge = as_a <const call_superedge *> (succ);
491 call_string::element_t current_call_string_element (succ->m_dest,
492 succ->m_src);
505 = as_a <const callgraph_superedge *> (succ);
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| program-point.cc | 407 /* Check to see if SUCC is a valid edge to take (ensuring that we have
411 Update the call string if SUCC is a call or a return.
413 Return true if SUCC can be taken, or false otherwise.
419 const superedge *succ)
423 switch (succ->m_kind)
427 const cfg_superedge *cfg_sedge = as_a <const cfg_superedge *> (succ);
437 const call_superedge *call_sedge = as_a <const call_superedge *> (succ);
475 call_string::element_t current_call_string_element (succ->m_dest,
476 succ->m_src);
489 = as_a <const callgraph_superedge *> (succ);
[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.old/dist/libphobos/libdruntime/core/internal/ |
| atomic.d | 340 bool atomicCompareExchangeStrong(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq, T)(T* dest, T* compare, T value) pure nothrow @nogc @trusted
483 bool atomicCompareExchangeStrongNoResult(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq, T)(T* dest, const T compare, T value) pure nothrow @nogc @trusted
858 bool atomicCompareExchangeWeak(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq, T)(T* dest, T* compare, T value) pure nothrow @nogc @trusted
861 return atomicCompareExchangeImpl!(succ, fail, true)(dest, compare, value);
864 bool atomicCompareExchangeStrong(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq, T)(T* dest, T* compare, T value) pure nothrow @nogc @trusted
867 return atomicCompareExchangeImpl!(succ, fail, false)(dest, compare, value);
870 bool atomicCompareExchangeStrongNoResult(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq, T)(T* dest, const T compare, T value) pure nothrow @nogc @trusted
873 return atomicCompareExchangeImpl!(succ, fail, false)(dest, cast(T*)&compare, value);
876 bool atomicCompareExchangeWeakNoResult(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq, T)(T* dest, const T compare, T value) pure nothrow @nogc @trusted
879 return atomicCompareExchangeImpl!(succ, fail, true)(dest, cast(T*)&compare, value)
[all...] |
| /src/external/apache2/llvm/dist/llvm/bindings/ocaml/target/ |
| llvm_target.ml | 89 external succ : t -> t option = "llvm_target_succ"
101 | Some target -> step (succ target) (target :: lst)
|
