Home
last modified time | relevance | path

Searched refs:leaf (Results 1 – 17 of 17) sorted by relevance

/wasmtime-44.0.1/cranelift/bforest/src/
H A Dnode.rs89 pub fn leaf(key: F::Key, value: F::Value) -> Self { in leaf() method
673 fn leaf() { in leaf() function
674 let mut leaf = NodeData::<TF>::leaf('d', SetValue()); in leaf() localVariable
675 assert_eq!(leaf.to_string(), "[ d ]"); in leaf()
677 assert!(leaf.try_leaf_insert(0, 'a', SetValue())); in leaf()
678 assert_eq!(leaf.to_string(), "[ a d ]"); in leaf()
681 assert_eq!(leaf.to_string(), "[ a b c d ]"); in leaf()
693 let saved = leaf; in leaf()
694 let sp = leaf.split(12); in leaf()
707 leaf = saved; in leaf()
[all …]
H A Dpath.rs650 if let Some((leaf, entry)) = self.leaf_pos() { in normalize()
651 if entry >= pool[leaf].entries() { in normalize()
748 let root = pool.alloc_node(NodeData::leaf(10, 'a')).panic_on_oom(); in search_single_leaf()
801 let leaf1 = pool.alloc_node(NodeData::leaf(10, 'a')).panic_on_oom(); in search_single_inner()
802 let leaf2 = pool.alloc_node(NodeData::leaf(20, 'b')).panic_on_oom(); in search_single_inner()
H A Dset.rs298 let root = self.pool.alloc_node(NodeData::leaf(elem, SetValue()))?; in try_insert()
H A Dmap.rs415 let node = pool.alloc_node(NodeData::leaf(key, value))?; in try_insert()
/wasmtime-44.0.1/cranelift/filetests/filetests/isa/x64/
H A Dleaf_function_detection.clif1 ;; Test leaf function detection across different function types.
3 ;; - True leaf functions (no calls)
4 ;; - Non-leaf functions (with calls, call_indirect)
7 ;; but x64 does not yet implement the leaf-function optimization, so frame
15 ;; Test 1: Simple leaf function - just arithmetic operations
99 ;; Test 3: Non-leaf function with direct call
128 ;; Test 4: Non-leaf function with indirect call
156 ;; Test 5: Leaf function with memory operations (should still be leaf)
H A Dleaf.clif1 ;; Test compilation of leaf functions without preserving frame pointers.
8 function %leaf(i64) -> i64 {
H A Dleaf_with_preserve_frame_pointers.clif1 ;; Test compilation of leaf functions while preserving frame pointers.
8 function %leaf(i64) -> i64 {
/wasmtime-44.0.1/cranelift/filetests/filetests/isa/aarch64/
H A Dleaf_function_detection.clif1 ;; Test leaf function detection across different function types.
3 ;; - True leaf functions (no calls)
4 ;; - Non-leaf functions (with calls, call_indirect)
11 ;; Test 1: Simple leaf function - just arithmetic operations
80 ;; Test 3: Non-leaf function with direct call
107 ;; Test 4: Non-leaf function with indirect call
133 ;; Test 5: Leaf function with memory operations (should still be leaf)
H A Dleaf.clif1 ;; Test compilation of leaf functions without preserving frame pointers.
8 function %leaf(i64) -> i64 {
H A Dleaf_with_preserve_frame_pointers.clif1 ;; Test compilation of leaf functions while preserving frame pointers.
8 function %leaf(i64) -> i64 {
/wasmtime-44.0.1/cranelift/filetests/filetests/isa/s390x/
H A Dleaf_function_detection.clif1 ;; Test leaf function detection across different function types.
3 ;; - True leaf functions (no calls)
4 ;; - Non-leaf functions (with calls, call_indirect)
11 ;; Test 1: Simple leaf function - just arithmetic operations
76 ;; Test 3: Non-leaf function with direct call
103 ;; Test 4: Non-leaf function with indirect call
129 ;; Test 5: Leaf function with memory operations (should still be leaf)
H A Dleaf.clif1 ;; Test compilation of leaf functions without preserving frame pointers.
8 function %leaf(i64) -> i64 {
H A Dleaf_with_preserve_frame_pointers.clif1 ;; Test compilation of leaf functions while preserving frame pointers.
8 function %leaf(i64) -> i64 {
/wasmtime-44.0.1/cranelift/filetests/filetests/isa/riscv64/
H A Dleaf_function_detection.clif1 ;; Test leaf function detection across different function types.
3 ;; - True leaf functions (no calls)
4 ;; - Non-leaf functions (with calls, call_indirect)
11 ;; Test 1: Simple leaf function - just arithmetic operations
80 ;; Test 3: Non-leaf function with direct call
116 ;; Test 4: Non-leaf function with indirect call
150 ;; Test 5: Leaf function with memory operations (should still be leaf)
/wasmtime-44.0.1/cranelift/isle/docs/
H A Dlanguage-reference.md1409 Each node in the tree is either an internal decision node, or a leaf
1414 leaf, we have the values generated by all of the match ops, and we can
1415 execute the sequence of "expression instructions" in the leaf. Each
1418 becomes one leaf node with expression instructions.
/wasmtime-44.0.1/crates/wasi-nn/examples/classification-example-winml/fixture/
H A Dsynset.txt305 n02169497 leaf beetle, chrysomelid
/wasmtime-44.0.1/crates/wasi-nn/examples/classification-component-onnx/fixture/labels/
H A Dsqueezenet1.1-7.txt305 n02169497 leaf beetle, chrysomelid