Home
last modified time | relevance | path

Searched refs:succs (Results 1 – 25 of 2740) sorted by relevance

12345678910>>...110

/dports/lang/python27/Python-2.7.18/Lib/test/
H A Dtest_generators.py1143 succs = self.succs = []
1159 for i in succs[i0]:
1160 s = succs[i]
1172 for i in succs[i0]:
1173 succs[i].append(i0)
1218 for i in succs[self.lastij]:
1219 e = len(succs[i])
1247 e = len(succs[i])
1287 succs = self.succs
1288 del succs[:]
[all …]
/dports/lang/python-legacy/Python-2.7.18/Lib/test/
H A Dtest_generators.py1143 succs = self.succs = []
1159 for i in succs[i0]:
1160 s = succs[i]
1172 for i in succs[i0]:
1173 succs[i].append(i0)
1218 for i in succs[self.lastij]:
1219 e = len(succs[i])
1247 e = len(succs[i])
1287 succs = self.succs
1288 del succs[:]
[all …]
/dports/sysutils/uefi-edk2-bhyve-csm/uefi-edk2-aa8d718/AppPkg/Applications/Python/Python-2.7.2/Lib/test/
H A Dtest_generators.py1142 succs = self.succs = []
1158 for i in succs[i0]:
1159 s = succs[i]
1171 for i in succs[i0]:
1172 succs[i].append(i0)
1217 for i in succs[self.lastij]:
1218 e = len(succs[i])
1246 e = len(succs[i])
1286 succs = self.succs
1287 del succs[:]
[all …]
/dports/lang/guile2/guile-2.2.7/module/language/cps/
H A Dpeel-loops.scm72 (define (loop-successors scc succs)
78 (define (find-exits scc succs)
94 (define (compute-live-variables cps entry body succs)
95 (let* ((succs (intset-map (lambda (label)
117 (define (compute-out-vars cps entry body succs exit)
121 (intmap-fold (lambda (label succs live-out)
122 (if (intset-ref succs exit)
127 succs #f)
170 (define (peel-loop cps entry body-labels succs preds)
252 (let* ((succs (compute-successors cps kfun))
[all …]
/dports/math/spot/spot-2.10.2/spot/twaalgos/
H A Dcomplement.cc198 std::vector<mstate> succs; in ncsb_successors() local
219 succs[0][t.dst] = ncsb_s; in ncsb_successors()
254 succs.push_back(succs[j]); in ncsb_successors()
267 auto it = succs.begin(); in ncsb_successors()
268 auto end = succs.end(); in ncsb_successors()
278 succs.erase(it, end); in ncsb_successors()
311 succs.push_back(succs[j]); in ncsb_successors()
319 for (auto& succ: succs) in ncsb_successors()
341 for (auto& succ: succs) in ncsb_successors()
356 for (auto& succ: succs) in ncsb_successors()
[all …]
/dports/math/py-spot/spot-2.10.2/spot/twaalgos/
H A Dcomplement.cc198 std::vector<mstate> succs; in ncsb_successors() local
219 succs[0][t.dst] = ncsb_s; in ncsb_successors()
254 succs.push_back(succs[j]); in ncsb_successors()
267 auto it = succs.begin(); in ncsb_successors()
268 auto end = succs.end(); in ncsb_successors()
278 succs.erase(it, end); in ncsb_successors()
311 succs.push_back(succs[j]); in ncsb_successors()
319 for (auto& succ: succs) in ncsb_successors()
341 for (auto& succ: succs) in ncsb_successors()
356 for (auto& succ: succs) in ncsb_successors()
[all …]
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/compile/internal/test/testdata/
H A Dflowgraph_generator1.go139 goto ` + string(labels[blocks[j].succs[1]]) + `
145 goto ` + string(labels[blocks[j].succs[0]])
193 succs [2]int64 member
214 bs[j].succs[1] = int64(blocks[j][1] - 'A')
218 bs[j].succs[0] = int64(blocks[j][0] - 'A')
227 …fmt.Sprintf("blo{inc:%d, cond:%v, succs:[2]int64{%d, %d}},", b.inc, b.cond, b.succs[0], b.succs[1])
261 succs [2]int64
281 next := b.succs[0]
286 next = b.succs[1]
/dports/math/spot/spot-2.10.2/tests/core/
H A Dsccif.test59 succs:
65 succs:
69 succs: 0
75 succs:
79 succs: 0
83 succs: 0 1
/dports/math/py-spot/spot-2.10.2/tests/core/
H A Dsccif.test59 succs:
65 succs:
69 succs: 0
75 succs:
79 succs: 0
83 succs: 0 1
/dports/lang/go-devel/go-becaeea1199b875bc24800fa88f2f4fea119bf78/src/cmd/compile/internal/ssa/
H A Dlayout.go34 var succs []ID
115 succs = append(succs, c.ID)
151 for len(succs) > 0 {
153 cid := succs[len(succs)-1]
154 succs = succs[:len(succs)-1]
/dports/lang/guile/guile-3.0.7/module/language/cps/
H A Dpeel-loops.scm72 (define (loop-successors scc succs)
78 (define (find-exits scc succs)
102 (define (compute-live-variables cps entry body succs)
103 (let* ((succs (intset-map (lambda (label)
125 (define (compute-out-vars cps entry body succs exit)
126 (let ((live (compute-live-variables cps entry body succs)))
200 (define (peel-loop cps entry body-labels succs preds bailouts)
204 (loop-exits (loop-successors body-labels succs))
305 (let* ((succs (compute-successors cps kfun))
307 (preds (invert-graph succs)))
[all …]
H A Dgraphs.scm136 (define (compute-reverse-post-order succs start)
146 (intmap-ref succs label)
153 (define (invert-graph succs)
156 (intmap-fold (lambda (pred succs preds)
160 succs
162 succs
163 (intmap-map (lambda (label _) empty-intset) succs)))
165 (define (compute-strongly-connected-components succs start)
168 (let ((preds (invert-graph succs)))
223 (intmap-fold (lambda (id succs out)
[all …]
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DBlock.java56 Set<Block> succs = new HashSet<Block>(); in getSuccessors() local
58 succs.add(diagram.getBlock(b)); in getSuccessors()
60 return succs; in getSuccessors()
64 Set<Block> succs = new HashSet<Block>(); in getPredecessors() local
66 succs.add(diagram.getBlock(b)); in getPredecessors()
68 return succs; in getPredecessors()
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DBlock.java56 Set<Block> succs = new HashSet<Block>(); in getSuccessors() local
58 succs.add(diagram.getBlock(b)); in getSuccessors()
60 return succs; in getSuccessors()
64 Set<Block> succs = new HashSet<Block>(); in getPredecessors() local
66 succs.add(diagram.getBlock(b)); in getPredecessors()
68 return succs; in getPredecessors()
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java228 e.from.succs.remove(e); in doLayout()
551 return n1.succs.size() - n2.succs.size();
636 int size = n.succs.size(); in calculateOptimalUp()
1431 ArrayList<LayoutEdge> succs = new ArrayList<LayoutEdge>(n.succs);
1513 succs = new ArrayList<LayoutEdge>(n.succs);
1607 n.succs.add(result);
1757 ArrayList<LayoutEdge> succs = new ArrayList<LayoutEdge>(node.succs);
1937 ArrayList<LayoutEdge> succs = new ArrayList<LayoutEdge>(node.succs);
1954 node.succs.add(e);
1981 oldFrom.succs.remove(e);
[all …]
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DHierarchicalLayoutManager.java228 e.from.succs.remove(e); in doLayout()
551 return n1.succs.size() - n2.succs.size();
636 int size = n.succs.size(); in calculateOptimalUp()
1431 ArrayList<LayoutEdge> succs = new ArrayList<LayoutEdge>(n.succs);
1513 succs = new ArrayList<LayoutEdge>(n.succs);
1607 n.succs.add(result);
1757 ArrayList<LayoutEdge> succs = new ArrayList<LayoutEdge>(node.succs);
1937 ArrayList<LayoutEdge> succs = new ArrayList<LayoutEdge>(node.succs);
1954 node.succs.add(e);
1981 oldFrom.succs.remove(e);
[all …]
/dports/games/spring/spring_98.0/AI/Skirmish/E323AI/
H A DAAStar.cpp5 while(!succs.empty()) succs.pop(); in init()
32 successors(x, succs); in findPath()
33 while (!succs.empty()) { in findPath()
34 y = succs.front(); succs.pop(); in findPath()
/dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/devel/llvm10/llvm-10.0.1.src/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/graphics/llvm-mesa/llvm-13.0.1.src/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/devel/llvm12/llvm-project-12.0.1.src/llvm/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/devel/llvm11/llvm-11.0.1.src/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/test/CodeGen/Lanai/
H A Dlanai-misched-trivial-disjoint.ll35 ; CHECK: # succs left : 0
38 ; CHECK: # succs left : 0
41 ; CHECK: # succs left : 4
44 ; CHECK: # succs left : 0
47 ; CHECK: # succs left : 0
50 ; CHECK: # succs left : 0
53 ; CHECK: # succs left : 0
56 ; CHECK: # succs left : 0

12345678910>>...110