| /wasmtime-44.0.1/cranelift/bforest/src/ |
| H A D | path.rs | 3 use super::node::Removed;
58 self.node[level] = node; in find()
96 self.node[level] = node; in first()
178 self.node[l] = node; in next_node()
180 node = pool[node].unwrap_inner().1[0]; in next_node()
183 self.node[level] = node; in next_node()
208 self.node[l] = node; in goto_subtree_last()
222 node in goto_subtree_last()
305 let mut node = self.node[level]; in split_and_insert() localVariable
323 self.node[level] = node; in split_and_insert()
[all …]
|
| H A D | pool.rs | 37 Some(node) => { in alloc_node()
39 match self.nodes[node] { in alloc_node()
43 self.nodes[node] = data; in alloc_node()
44 Ok(node) in alloc_node()
61 self.freelist = Some(node); in free_node()
75 self.free_node(node); in free_tree()
117 match self[node] { in verify_tree()
130 node, in verify_tree()
131 self[node], in verify_tree()
173 node, in verify_tree()
[all …]
|
| H A D | lib.rs | 30 mod node; module
38 use self::node::NodeData;
|
| H A D | map.rs | 189 while let Some((node, entry)) = path.leaf_pos() { in retain()
191 let (ks, vs) = forest.nodes[node].unwrap_leaf_mut(); in retain()
351 .and_then(|(node, entry)| pool[node].unwrap_leaf().0.get(entry).cloned()) in key()
357 .and_then(|(node, entry)| pool[node].unwrap_leaf().1.get(entry).cloned()) in value()
363 .and_then(move |(node, entry)| pool[node].unwrap_leaf_mut().1.get_mut(entry)) in value_mut()
415 let node = pool.alloc_node(NodeData::leaf(key, value))?; in try_insert() localVariable
416 *root = node.into(); in try_insert()
417 self.path.set_root_node(node); in try_insert()
|
| H A D | set.rs | 162 while let Some((node, entry)) = path.leaf_pos() { in retain()
163 if predicate(forest.nodes[node].unwrap_leaf().0[entry]) { in retain()
256 .and_then(|(node, entry)| self.pool[node].unwrap_leaf().0.get(entry).cloned()) in elem()
|
| H A D | node.rs | 167 pub fn try_inner_insert(&mut self, index: usize, key: F::Key, node: Node) -> bool { in try_inner_insert()
181 slice_insert(&mut tree[1..=sz + 1], index, node); in try_inner_insert()
|
| /wasmtime-44.0.1/crates/environ/src/graphs/ |
| H A D | scc.rs | 103 |node| indices[node].is_some(), in new()
106 DfsEvent::Pre(node) => { in new()
121 stack.push(node); in new()
129 debug_assert!(lowlinks[node] <= indices[node]); in new()
138 lowlinks[node] = in new()
143 DfsEvent::Post(node) => { in new()
151 if indices[node] == lowlinks[node] { in new()
162 if v == node { in new()
316 .map(move |node| (node, PackedOption::from(Some(c)))) in evaporation()
328 for node in nodes { in evaporation()
[all …]
|
| H A D | dfs.rs | 63 if let DfsEvent::Pre(node) = event { in next()
64 if seen(node) { in next()
68 let successors = graph.successors(node); in next()
79 self.stack.push(DfsEvent::Post(node)); in next()
81 self.stack.push(DfsEvent::AfterEdge(node, succ)); in next()
|
| H A D | entity_graph.rs | 96 fn successors(&self, node: Node) -> Self::SuccessorsIter<'_> { in successors()
97 let Range { start, end } = self.edges[node].clone(); in successors()
|
| /wasmtime-44.0.1/cranelift/isle/isle/src/ |
| H A D | disjointsets.rs | 29 while let Some(node) = self.parent.get(&x) { in find_mut()
30 if node.0 == x { in find_mut()
33 let grandparent = self.parent[&node.0].0; in find_mut()
54 while let Some(node) = self.parent.get(&x) { in find()
55 if node.0 == x { in find()
58 x = node.0; in find()
|
| H A D | overlap.rs | 46 let node = self.nodes.remove(&pos).unwrap(); in report() localVariable
47 for other in node.iter() { in report()
60 rules.extend(node.into_iter().map(Span::new_single)); in report()
|
| H A D | printer.rs | 21 node: &N, in print_node()
26 let sexpr = node.to_sexpr(); in print_node()
|
| /wasmtime-44.0.1/crates/environ/src/ |
| H A D | graphs.rs | 30 fn successors(&self, node: Node) -> Self::SuccessorsIter<'_>; in successors()
70 fn successors(&self, node: Node) -> Self::SuccessorsIter<'_> { in successors()
71 (*self).successors(node) in successors()
114 fn successors(&self, node: Node) -> Self::SuccessorsIter<'_> { in successors()
115 self.graph.successors(node).filter(&self.predicate) in successors()
|
| /wasmtime-44.0.1/cranelift/codegen/src/ir/ |
| H A D | layout.rs | 232 let node = &mut self.blocks[block]; in append_block() localVariable
233 debug_assert!(node.first_inst.is_none() && node.last_inst.is_none()); in append_block()
235 node.next = None.into(); in append_block()
258 node.next = before.into(); in insert_block()
259 node.prev = after; in insert_block()
281 node.next = before; in insert_block_after()
282 node.prev = after.into(); in insert_block_after()
558 node.prev = old_block.into(); in split_block()
559 node.next = next_block; in split_block()
560 node.first_inst = before.into(); in split_block()
[all …]
|
| /wasmtime-44.0.1/cranelift/codegen/src/ |
| H A D | dominator_tree.rs | 352 let node = &mut self.nodes[block]; in compute_spanning_tree() localVariable
353 if node.pre_number != NOT_VISITED { in compute_spanning_tree()
360 node.pre_number = pre_number; in compute_spanning_tree()
492 let node = &mut self.nodes[block]; in compute_domtree_preorder() localVariable
493 node.dom_pre_number = n; in compute_domtree_preorder()
494 node.dom_pre_max = n; in compute_domtree_preorder()
495 if let Some(sibling) = node.sibling.expand() { in compute_domtree_preorder()
498 if let Some(child) = node.child.expand() { in compute_domtree_preorder()
|
| H A D | loop_analysis.rs | 231 while let Some(node) = stack.pop() { in discover_loop_blocks()
233 match self.block_loop_map[node].expand() { in discover_loop_blocks()
236 self.block_loop_map[node] = PackedOption::from(lp); in discover_loop_blocks()
237 continue_dfs = Some(node); in discover_loop_blocks()
|
| H A D | prelude_opt.isle | 7 ;; Extract any node(s) for the given eclass ID.
23 ;; Construct a pure node, returning a new (or deduplicated
112 ;; Mark a node as requiring remat when used in a different block.
116 ;; Mark a node as subsuming whatever else it's rewritten from -- this
|
| /wasmtime-44.0.1/crates/wizer/.github/actions/binary-compatible-builds/ |
| H A D | main.js | 1 #!/usr/bin/env node
|
| /wasmtime-44.0.1/cranelift/filetests/filetests/egraph/ |
| H A D | issue-5716.clif | 2 ;; set on a different node in its eclass.
|
| /wasmtime-44.0.1/crates/fuzzing/src/generators/gc_ops/ |
| H A D | types.rs | 61 fn successors(&self, node: TypeId) -> Self::SuccessorsIter<'_> { in successors()
63 .get(&node) in successors()
|
| /wasmtime-44.0.1/ |
| H A D | ADOPTERS.md | 17 …t has had Wasmtime in preview for its WebAssembly System Interface (WASI) node pools in Azure Kube…
|
| /wasmtime-44.0.1/crates/wizer/.github/workflows/ |
| H A D | release.yml | 130 run: npm install && node update.js "${{ steps.tagname.outputs.val }}"
|
| /wasmtime-44.0.1/cranelift/isle/docs/ |
| H A D | language-reference.md | 1409 Each node in the tree is either an internal decision node, or a leaf
1410 "expression" node (which we reach once we have a successful rule
1418 becomes one leaf node with expression instructions.
1421 in sequence. If we have tried all out-edges from a decision node and
1426 Though this sounds possibly very inefficient if some decision node has
1438 decision node also affects complexity: if mutually-exclusive
|
| /wasmtime-44.0.1/.github/workflows/ |
| H A D | main.yml | 238 matrix="$(node ./ci/build-test-matrix.js ./commits.log ./names.log $run_full)"
242 matrix="$(node ./ci/build-build-matrix.js)"
1318 # This is a "join node" which depends on all prior workflows. The merge queue,
1327 # to have a "join" node here which joins everything.
|
| /wasmtime-44.0.1/docs/js/ |
| H A D | mermaid.min.11.6.0.js | 449 node:
829 …lass","branchLabel"),g=m.insert("g").attr("class","label branch-label");g.node()?.appendChild(d);l…
2261 .node-icon-${n-1} {
2283 .node rect,
2284 .node circle,
2285 .node ellipse,
2286 .node polygon,
2287 .node path {
2520 …node()}var Ttt,vs,rC=N(()=>{"use strict";dr();vt();zt();gr();ir();to();o(Bye,"applyStyle");o(wtt,"…
2523 …node(e.v);var f=a.node(e.w);f?.intersect&&h?.intersect&&(l=l.slice(1,r.points.length-1),l.unshift(…
[all …]
|