| /wasmtime-44.0.1/cranelift/isle/veri/veri_engine/src/ |
| H A D | type_inference.rs | 358 tree: &mut RuleParseTree, in add_annotation_constraints()
411 tree.bv_constraints in add_annotation_constraints()
665 tree.bv_constraints in add_annotation_constraints()
1350 tree: &mut RuleParseTree, in add_isle_constraints()
1388 _ => tree in add_isle_constraints()
1397 tree: &mut RuleParseTree, in add_rule_constraints()
1410 tree, in add_rule_constraints()
1582 tree, in add_rule_constraints()
1594 tree, in add_rule_constraints()
1991 tree: &mut RuleParseTree, in create_parse_tree_pattern()
[all …]
|
| /wasmtime-44.0.1/tests/misc_testsuite/gc/ |
| H A D | issue-10171.wast | 4 (type $tree (struct (field $left anyref)
11 struct.new $tree
14 struct.new $tree
15 struct.get $tree $left
16 ref.cast (ref null $tree)
17 struct.get $tree $left
|
| /wasmtime-44.0.1/cranelift/bforest/src/ |
| H A D | node.rs | 29 tree: [Node; INNER_SIZE],
79 let mut tree = [right; INNER_SIZE]; in inner() localVariable
80 tree[0] = left; in inner()
84 tree, in inner()
103 ref tree, in unwrap_inner()
172 ref mut tree, in try_inner_insert()
229 ref tree, in split()
251 let mut r_tree = *tree; in split()
261 tree: r_tree, in split()
314 ref mut tree, in inner_remove()
[all …]
|
| H A D | pool.rs | 66 if let NodeData::Inner { size, tree, .. } = self[node] { in free_tree()
72 self.free_tree(tree[i]); in free_tree()
118 NodeData::Inner { size, keys, tree } => { in verify_tree()
120 let capacity = tree.len(); in verify_tree()
154 todo.push((lower, tree[i], upper)); in verify_tree()
|
| H A D | path.rs | 60 NodeData::Inner { size, keys, tree } => { in find()
70 node = tree[i]; in find()
99 NodeData::Inner { tree, .. } => node = tree[0], in first()
210 NodeData::Inner { size, ref tree, .. } => { in goto_subtree_last()
212 node = tree[usize::from(size)]; in goto_subtree_last()
454 size: 0, ref tree, .. in balance_nodes()
458 self.node[ns] = tree[0]; in balance_nodes()
620 let (keys, tree) = pool[self.node[bl]].unwrap_inner(); in right_sibling()
622 node = tree[be + 1]; in right_sibling()
665 NodeData::Inner { size, tree, .. } => { in verify()
[all …]
|
| /wasmtime-44.0.1/crates/wiggle/ |
| H A D | README.md | 13 …m/bytecodealliance/wasmtime/tree/main/crates/wiggle) (this crate), and [Lucet](https://github.com/…
15 The [wasi-common crate](https://github.com/bytecodealliance/wasmtime/tree/main/crates/wasi-common) …
16 crate](https://github.com/bytecodealliance/wasmtime/tree/main/crates/wasi) integrates wasi-common w…
|
| /wasmtime-44.0.1/docs/ |
| H A D | contributing-implementing-wasm-proposals.md | 51 [`wasmparser`]: https://github.com/bytecodealliance/wasm-tools/tree/main/crates/wasmparser
52 [`wast`]: https://github.com/bytecodealliance/wasm-tools/tree/main/crates/wast
53 [`wasmprinter`]: https://github.com/bytecodealliance/wasm-tools/tree/main/crates/wasmprinter
54 [`wasm-encoder`]: https://github.com/bytecodealliance/wasm-tools/tree/main/crates/wasm-encoder
55 [`wasm-smith`]: https://github.com/bytecodealliance/wasm-tools/tree/main/crates/wasm-smith
65 … directory of the [wasi crate](https://github.com/bytecodealliance/wasmtime/tree/main/crates/wasi).
76 3. Build the [wasi-preview1-component-adapter](https://github.com/bytecodealliance/wasmtime/tree/ma…
|
| H A D | lang.md | 101 [examples](https://github.com/bytecodealliance/wasmtime-dotnet/tree/main/examples)
109 examples](https://github.com/bytecodealliance/wasmtime-rb/tree/main/examples)
|
| H A D | contributing-ci.md | 12 [dir]: https://github.com/bytecodealliance/wasmtime/tree/main/.github
54 folder](https://github.com/bytecodealliance/wasmtime/tree/main/docs)) are
|
| H A D | introduction.md | 45 GitHub](https://github.com/bytecodealliance/wasmtime/tree/main/docs) and
|
| H A D | contributing-rfc-process.md | 29 subdirectory](https://github.com/bytecodealliance/rfcs/tree/main/accepted) and
|
| H A D | contributing-fuzzing.md | 155 OSS-Fuzz.](https://github.com/google/oss-fuzz/tree/master/projects/wasmtime)
164 as "DNA" or pre-determined choices through a decision tree and using it to
|
| /wasmtime-44.0.1/ |
| H A D | deny.toml | 41 skip-tree = [
43 # ignore its dependency tree until it updates.
47 # dependencies relative to Wasmtime's main dependency tree.
|
| /wasmtime-44.0.1/pulley/macros/ |
| H A D | Cargo.toml | 7 repository = "https://github.com/bytecodealliance/wasmtime/tree/main/pulley/macros"
|
| /wasmtime-44.0.1/ci/ |
| H A D | vendor-c-api-headers.sh | 18 // Wasmtime maintainers can update this vendored copy in-tree with the
|
| /wasmtime-44.0.1/cranelift/isle/isle/ |
| H A D | Cargo.toml | 9 repository = "https://github.com/bytecodealliance/wasmtime/tree/main/cranelift/isle"
|
| H A D | README.md | 8 rules get compiled down into Rust source test that uses a tree of `match`
|
| /wasmtime-44.0.1/crates/wizer/ |
| H A D | README.md | 49 [regex-bench]: https://github.com/bytecodealliance/wasmtime/tree/main/crates/wizer/benches/regex-be…
50 [uap-bench]: https://github.com/bytecodealliance/wasmtime/tree/main/crates/wizer/benches/uap-bench
78 For a complete C++ example, see [this](https://github.com/bytecodealliance/wizer/tree/main/examples…
|
| /wasmtime-44.0.1/pulley/ |
| H A D | Cargo.toml | 9 repository = "https://github.com/bytecodealliance/wasmtime/tree/main/pulley"
|
| /wasmtime-44.0.1/cranelift/isle/ |
| H A D | README.md | 16 -- some sort of compiler IR -- is, conceptually, a tree of terms, and we have a
17 set of rewrite rules that turn this into another tree of terms.
22 all rules into a decision tree, sharing work where possible, while respecting
433 that efficient, compact tree of `match` expressions in the generated Rust code
489 Parsing translates the stream of tokens into an abstract syntax tree (AST). Our
511 of the decision tree that will be emitted during code generation.
|
| /wasmtime-44.0.1/cranelift/isle/docs/ |
| H A D | language-reference.md | 8 by and lives in the Cranelift tree in
56 generate a decision tree in Rust that can call into arbitrary
148 statements, i.e., resembles a very large decision tree, while
150 that, when composed and combined, become that more complex tree. This
156 A term-rewriting system typically operates on data that is in a *tree*
163 terms with balanced parentheses; then we have our tree.
174 which we can write more clearly as the tree:
282 different rules on different "shapes" of the tree of constructors in
1169 bottoms out on the output side, the "term tree" is reified as a tree
1417 existing tree as we process rules) and each rule's right-hand side
[all …]
|
| /wasmtime-44.0.1/.github/actions/install-rust/ |
| H A D | action.yml | 66 # Deny warnings on CI to keep our code warning-free as it lands in-tree.
|
| /wasmtime-44.0.1/crates/wasi-common/ |
| H A D | README.md | 28 [lucet-wasi]: https://github.com/fastly/lucet/tree/master/lucet-wasi
|
| /wasmtime-44.0.1/cranelift/isle/isle/isle_examples/pass/ |
| H A D | prio_trie_bug.isle | 73 ;; `iadd` tree fully.
|
| /wasmtime-44.0.1/.github/workflows/ |
| H A D | release-process.yml | 106 [branch]: https://github.com/${{ github.repository }}/tree/release-$cur
147 [branch]: https://github.com/${{ github.repository }}/tree/release-$cur
|