Home
last modified time | relevance | path

Searched refs:succ (Results 1 – 25 of 149) sorted by relevance

123456

/netbsd-src/external/ibm-public/postfix/dist/src/util/
H A Dring.c84 ring->pred = ring->succ = ring;
93 entry->succ = ring->succ;
95 ring->succ->pred = entry;
96 ring->succ = entry;
106 entry->succ = ring;
107 ring->pred->succ = entry;
116 RING *succ = entry->succ; local
119 pred->succ = succ;
120 succ->pred = pred;
122 entry->succ = entry->pred = 0;
H A Dring.h22 RING *succ; /* successor */ member
31 #define ring_succ(c) ((c)->succ)
/netbsd-src/tests/net/icmp/
H A Dt_ping.c151 int loop, succ; in doping() local
179 succ = 0; in doping()
197 succ++; in doping()
205 return succ; in doping()
214 int succ; in ATF_TC_BODY() local
233 succ = doping("1.1.1.10", LOOPS, 56); in ATF_TC_BODY()
234 printf("got %d/%d\n", succ, LOOPS); in ATF_TC_BODY()
250 int succ; in ATF_TC_BODY() local
261 succ = doping("1.1.1.20", LOOPS, 56); in ATF_TC_BODY()
265 succ = doping("1.1.1.10", LOOPS, 56); in ATF_TC_BODY()
[all …]
/netbsd-src/external/mpl/dhcp/bind/dist/lib/isc/unix/include/isc/
H A Dstdatomic.h138 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \ argument
141 succ, fail)
142 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \ argument
145 succ, fail)
161 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \ argument
163 __atomic_compare_exchange_n(obj, expected, desired, 0, succ, fail)
164 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \ argument
166 __atomic_compare_exchange_n(obj, expected, desired, 1, succ, fail)
186 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \ argument
197 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \ argument
[all …]
/netbsd-src/external/mpl/dhcp/bind/include/isc/
H A Dstdatomic.h136 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \ argument
139 succ, fail)
140 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \ argument
143 succ, fail)
159 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \ argument
161 __atomic_compare_exchange_n(obj, expected, desired, 0, succ, fail)
162 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \ argument
164 __atomic_compare_exchange_n(obj, expected, desired, 1, succ, fail)
184 #define atomic_compare_exchange_strong_explicit(obj, expected, desired, succ, \ argument
195 #define atomic_compare_exchange_weak_explicit(obj, expected, desired, succ, \ argument
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/ProfileData/
H A DGCOV.cpp402 if (!succ.empty()) { in print()
404 for (const GCOVArc *Edge : succ) { in print()
434 if (i == u->succ.size()) { in augmentOneCycle()
442 GCOVArc *succ = u->succ[i]; in augmentOneCycle() local
446 if (succ->cycleCount == 0 || !succ->dst.traversable || &succ->dst == u) in augmentOneCycle()
448 if (succ->dst.incoming == nullptr) { in augmentOneCycle()
449 succ->dst.incoming = succ; in augmentOneCycle()
450 stack.emplace_back(&succ->dst, 0); in augmentOneCycle()
453 uint64_t minCount = succ->cycleCount; in augmentOneCycle()
457 if (v == &succ->dst) in augmentOneCycle()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dgraphds.cc37 && !g->vertices[i].succ) in dump_graph()
46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
82 vf->succ = e; in add_edge()
97 for (e = uu->succ; e; e = next) in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
103 vv->succ = e; in identify_vertices()
105 uu->succ = NULL; in identify_vertices()
178 e = (forward ? g->vertices[v].succ : g->vertices[v].pred); in dfs_fst_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
H A Dsel-sched.cc595 in_fallthru_bb_p (rtx_insn *insn, rtx succ) in in_fallthru_bb_p() argument
600 if (bb == BLOCK_FOR_INSN (succ)) in in_fallthru_bb_p()
612 return bb == BLOCK_FOR_INSN (succ); in in_fallthru_bb_p()
625 insn_t succ; in extract_new_fences_from() local
646 insn_t succ; in extract_new_fences_from() local
648 succ = (sel_bb_end_p (insn) in extract_new_fences_from()
652 if (INSN_SEQNO (succ) > 0 in extract_new_fences_from()
653 && INSN_SEQNO (succ) <= orig_max_seqno in extract_new_fences_from()
654 && INSN_SCHED_TIMES (succ) <= 0) in extract_new_fences_from()
656 FENCE_INSN (fence) = succ; in extract_new_fences_from()
[all …]
H A Dshortest-paths.h141 edge_t *succ; in shortest_paths() local
142 FOR_EACH_VEC_ELT (n->m_succs, i, succ) in shortest_paths()
145 node_t *dest = succ->m_dest; in shortest_paths()
150 m_best_edge[dest->m_index] = succ; in shortest_paths()
H A Dlcm.cc174 basic_block pred, succ; in compute_earliest() local
182 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_earliest()
184 bitmap_copy (earliest[x], antin[succ->index]); in compute_earliest()
187 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun)) in compute_earliest()
191 bitmap_and_compl (difference, antin[succ->index], in compute_earliest()
590 basic_block pred, succ; in compute_farthest() local
598 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_farthest()
599 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun)) in compute_farthest()
608 st_antin[succ->index]); in compute_farthest()
609 bitmap_not (temp_bitmap, st_avin[succ->index]); in compute_farthest()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dgraphds.c37 && !g->vertices[i].succ) in dump_graph()
46 for (e = g->vertices[i].succ; e; e = e->succ_next) in dump_graph()
81 e->succ_next = vf->succ; in add_edge()
82 vf->succ = e; in add_edge()
97 for (e = uu->succ; e; e = next) in identify_vertices()
102 e->succ_next = vv->succ; in identify_vertices()
103 vv->succ = e; in identify_vertices()
105 uu->succ = NULL; in identify_vertices()
178 e = (forward ? g->vertices[v].succ : g->vertices[v].pred); in dfs_fst_edge()
337 for (e = g->vertices[i].succ; e; e = e->succ_next) in for_each_edge()
H A Dsel-sched.c595 in_fallthru_bb_p (rtx_insn *insn, rtx succ) in in_fallthru_bb_p() argument
600 if (bb == BLOCK_FOR_INSN (succ)) in in_fallthru_bb_p()
612 return bb == BLOCK_FOR_INSN (succ); in in_fallthru_bb_p()
625 insn_t succ; in extract_new_fences_from() local
646 insn_t succ; in extract_new_fences_from() local
648 succ = (sel_bb_end_p (insn) in extract_new_fences_from()
652 if (INSN_SEQNO (succ) > 0 in extract_new_fences_from()
653 && INSN_SEQNO (succ) <= orig_max_seqno in extract_new_fences_from()
654 && INSN_SCHED_TIMES (succ) <= 0) in extract_new_fences_from()
656 FENCE_INSN (fence) = succ; in extract_new_fences_from()
[all …]
H A Dshortest-paths.h110 edge_t *succ; in shortest_paths() local
111 FOR_EACH_VEC_ELT (n->m_succs, i, succ) in shortest_paths()
114 node_t *dest = succ->m_dest; in shortest_paths()
119 m_prev[dest->m_index] = succ; in shortest_paths()
H A Dlcm.c174 basic_block pred, succ; in compute_earliest() local
182 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_earliest()
184 bitmap_copy (earliest[x], antin[succ->index]); in compute_earliest()
187 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun)) in compute_earliest()
191 bitmap_and_compl (difference, antin[succ->index], in compute_earliest()
590 basic_block pred, succ; in compute_farthest() local
598 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_farthest()
599 if (succ == EXIT_BLOCK_PTR_FOR_FN (cfun)) in compute_farthest()
608 st_antin[succ->index]); in compute_farthest()
609 bitmap_not (temp_bitmap, st_avin[succ->index]); in compute_farthest()
[all …]
H A Dsel-sched-ir.c595 insn_t succ; in init_fences() local
600 FOR_EACH_SUCC_1 (succ, si, old_fence, in init_fences()
609 flist_add (&fences, succ, in init_fences()
683 insn_t succ; in merge_fences() local
726 FOR_EACH_SUCC_1 (succ, si, last_scheduled_insn_old, in merge_fences()
729 if (succ == insn) in merge_fences()
737 FOR_EACH_SUCC_1 (succ, si, last_scheduled_insn, in merge_fences()
740 if (succ == insn) in merge_fences()
855 add_clean_fence_to_fences (flist_tail_t new_fences, insn_t succ, fence_t fence) in add_clean_fence_to_fences() argument
860 succ, state_create (), create_deps_context (), in add_clean_fence_to_fences()
[all …]
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/epiphany/
H A Dresolve-sw-modes.c155 basic_block succ = e->dest; in execute() local
158 if (!REGNO_REG_SET_P (DF_LIVE_IN (succ), jilted_reg)) in execute()
160 if (REGNO_REG_SET_P (DF_LIVE_IN (succ), selected_reg)) in execute()
162 if (bitmap_bit_p (pushed, succ->index)) in execute()
164 todo.quick_push (succ); in execute()
/netbsd-src/external/gpl3/gcc/dist/gcc/config/epiphany/
H A Dresolve-sw-modes.cc155 basic_block succ = e->dest; in execute() local
158 if (!REGNO_REG_SET_P (DF_LIVE_IN (succ), jilted_reg)) in execute()
160 if (REGNO_REG_SET_P (DF_LIVE_IN (succ), selected_reg)) in execute()
162 if (bitmap_bit_p (pushed, succ->index)) in execute()
164 todo.quick_push (succ); in execute()
/netbsd-src/tests/rump/kernspace/
H A Dalloc.c83 int succ, i; in rumptest_alloc() local
108 for (succ = 0;; succ++) { in rumptest_alloc()
109 if (succ * 1024 > thelimit) in rumptest_alloc()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dprogram-point.cc289 const superedge *succ) in on_edge() argument
293 switch (succ->m_kind) in on_edge()
297 const cfg_superedge *cfg_sedge = as_a <const cfg_superedge *> (succ); in on_edge()
307 const call_superedge *call_sedge = as_a <const call_superedge *> (succ); in on_edge()
345 if (top_of_stack != succ) in on_edge()
357 = as_a <const callgraph_superedge *> (succ); in on_edge()
/netbsd-src/external/mpl/bind/dist/lib/isc/include/isc/
H A Dstdatomic.h
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/internal/
H A Datomic.d340 …bool atomicCompareExchangeStrong(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrde… in version()
483 …bool atomicCompareExchangeStrongNoResult(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = Me… in version()
858 …bool atomicCompareExchangeWeak(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.… in version()
861 return atomicCompareExchangeImpl!(succ, fail, true)(dest, compare, value); in version()
864 …bool atomicCompareExchangeStrong(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrde… in version()
867 return atomicCompareExchangeImpl!(succ, fail, false)(dest, compare, value); in version()
870 …bool atomicCompareExchangeStrongNoResult(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = Me… in version()
873 return atomicCompareExchangeImpl!(succ, fail, false)(dest, cast(T*)&compare, value); in version()
876 …bool atomicCompareExchangeWeakNoResult(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = Memo… in version()
879 return atomicCompareExchangeImpl!(succ, fail, true)(dest, cast(T*)&compare, value); in version()
[all …]
/netbsd-src/external/gpl3/gcc/dist/libphobos/libdruntime/core/
H A Datomic.d287 template cas(MemoryOrder succ = MemoryOrder.seq, MemoryOrder fail = MemoryOrder.seq)
301 return atomicCompareExchangeStrongNoResult!(succ, fail)( in atomicPtrIsProperlyAligned()
305 return atomicCompareExchangeStrongNoResult!(succ, fail)(here, arg1, arg2); in atomicPtrIsProperlyAligned()
336 return atomicCompareExchangeStrongNoResult!(succ, fail)( in atomicPtrIsProperlyAligned()
351 return atomicCompareExchangeStrong!(succ, fail)( in atomicPtrIsProperlyAligned()
355 return atomicCompareExchangeStrong!(succ, fail)(here, ifThis, writeThis); in atomicPtrIsProperlyAligned()
395 return atomicCompareExchangeStrong!(succ, fail)( in atomicPtrIsProperlyAligned()
416 bool casWeak(MemoryOrder succ = MemoryOrder.seq,MemoryOrder fail = MemoryOrder.seq,T,V1,V2)(T* here…
427 …return atomicCompareExchangeWeakNoResult!(succ, fail)(cast(IntTy*)here, *cast(IntTy*)&arg1, *cast(… in atomicPtrIsProperlyAligned()
430 return atomicCompareExchangeWeakNoResult!(succ, fail)(here, arg1, arg2); in atomicPtrIsProperlyAligned()
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dprogram-point.cc419 const superedge *succ) in on_edge() argument
423 switch (succ->m_kind) in on_edge()
427 const cfg_superedge *cfg_sedge = as_a <const cfg_superedge *> (succ); in on_edge()
437 const call_superedge *call_sedge = as_a <const call_superedge *> (succ); in on_edge()
475 call_string::element_t current_call_string_element (succ->m_dest, in on_edge()
476 succ->m_src); in on_edge()
489 = as_a <const callgraph_superedge *> (succ); in on_edge()
/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
H A DExplodedGraph.cpp96 const ExplodedNode *succ = *(node->succ_begin()); in shouldCollect() local
97 if (succ->pred_size() != 1) in shouldCollect()
142 const ProgramPoint SuccLoc = succ->getLocation(); in shouldCollect()
161 ExplodedNode *succ = *(node->succ_begin()); in collectNode() local
162 pred->replaceSuccessor(succ); in collectNode()
163 succ->replacePredecessor(pred); in collectNode()
/netbsd-src/bin/ed/
H A Ded.h142 #define REQUE(pred, succ) (pred)->q_forw = (succ), (succ)->q_back = (pred) argument

123456