Home
last modified time | relevance | path

Searched refs:insert (Results 1 – 25 of 191) sorted by relevance

12345678

/wasmtime-44.0.1/cranelift/codegen/meta/src/shared/
H A Dimmediates.rs122 intcc_values.insert("eq", "Equal"); in new()
123 intcc_values.insert("ne", "NotEqual"); in new()
142 floatcc_values.insert("ord", "Ordered"); in new()
143 floatcc_values.insert("uno", "Unordered"); in new()
144 floatcc_values.insert("eq", "Equal"); in new()
145 floatcc_values.insert("ne", "NotEqual"); in new()
148 floatcc_values.insert("lt", "LessThan"); in new()
182 atomic_rmw_op_values.insert("add", "Add"); in new()
183 atomic_rmw_op_values.insert("sub", "Sub"); in new()
184 atomic_rmw_op_values.insert("and", "And"); in new()
[all …]
/wasmtime-44.0.1/cranelift/isle/veri/veri_engine/src/
H A Dtype_inference.rs143 solutions.insert(rule.id, s); in type_rules_with_term_and_types()
303 tymap.insert(*t, ty); in type_annotations_using_rule()
318 tymap.insert(t, ty); in type_annotations_using_rule()
1342 tree.ty_vars.insert(e.clone(), t); in add_annotation_constraints()
1726 group.insert(*v); in solve_constraints()
1737 group.insert(*v); in solve_constraints()
1810 group.insert(*v2); in solve_constraints()
1815 group.insert(*v1); in solve_constraints()
1822 group.insert(*v1); in solve_constraints()
1870 set.insert(*v); in solve_constraints()
[all …]
/wasmtime-44.0.1/crates/fuzzing/tests/oom/
H A Dindex_map.rs13 map1.insert("a", try_new::<Box<_>>(42)?)?; in try_index_map_try_clone()
14 map1.insert("b", try_new::<Box<_>>(36)?)?; in try_index_map_try_clone()
41 map1.insert("a", 42)?; in try_index_map_split_off()
42 map1.insert("b", 36)?; in try_index_map_split_off()
87 map.insert(10, 20)?; in try_index_map_insert()
152 map.insert("a", 20)?; in try_index_map_insert_before()
153 map.insert("b", 30)?; in try_index_map_insert_before()
170 map.insert("a", 20)?; in try_index_map_shift_insert()
171 map.insert("b", 30)?; in try_index_map_shift_insert()
H A Dhash_map.rs27 map.insert(i, i * 2)?; in try_hash_map_insert()
30 map.insert(i, i * 2)?; in try_hash_map_insert()
41 map.insert(i, i * 2)?; in try_hash_map_try_clone()
H A Dbtree_map.rs12 m.insert(100, 100.0)?; in btree_map()
21 e.insert(43.0); in btree_map()
35 e.insert(99.0)?; in btree_map()
H A Dhash_set.rs27 set.insert(i)?; in try_hash_set_insert()
30 set.insert(i)?; in try_hash_set_insert()
/wasmtime-44.0.1/crates/environ/examples/
H A Dbtrees.rs11 fn insert(&mut self, key: Key, value: Value) -> Result<()>; in insert() method
15 fn insert(&mut self, key: Key, value: Value) -> Result<()> { in insert() method
16 BTreeMap::insert(self, key, value); in insert()
22 fn insert(&mut self, key: Key, value: Value) -> Result<()> { in insert() method
23 collections::TryBTreeMap::insert(self, key, value)?; in insert()
46 map.insert([i, i], [0; 16])?; in main()
/wasmtime-44.0.1/crates/environ/src/component/
H A Dnames.rs64 pub fn insert<I>(&mut self, name: &str, cx: &mut I, allow_shadowing: bool, item: V) -> Result<K> in insert() function
70 if let Some(prev) = self.definitions.insert(key.clone(), item) { in insert()
72 self.definitions.insert(key, prev); in insert()
86 .insert(alternate_key.clone(), (key.clone(), version.clone())) in insert()
92 .insert(alternate_key, (prev_key, prev_version)); in insert()
258 map.insert("a", &mut intern, false, 0).unwrap(); in name_map_smoke()
259 map.insert("b", &mut intern, false, 1).unwrap(); in name_map_smoke()
261 assert!(map.insert("a", &mut intern, false, 0).is_err()); in name_map_smoke()
262 assert!(map.insert("a", &mut intern, true, 0).is_ok()); in name_map_smoke()
268 map.insert("a:b/[email protected]", &mut intern, false, 2).unwrap(); in name_map_smoke()
[all …]
/wasmtime-44.0.1/cranelift/codegen/src/ir/
H A Dconstant.rs174 buffer.insert(0, byte); in from_str()
284 fn insert() { in insert() function
286 sut.insert(vec![1, 2, 3].into()); in insert()
287 sut.insert(vec![4, 5, 6].into()); in insert()
294 let a = sut.insert(vec![1, 2, 3].into()); in insert_duplicate()
295 sut.insert(vec![4, 5, 6].into()); in insert_duplicate()
296 let b = sut.insert(vec![1, 2, 3].into()); in insert_duplicate()
303 sut.insert(vec![1, 2, 3].into()); in clear()
313 sut.insert(vec![1, 2, 3].into()); in iteration_order()
314 sut.insert(vec![4, 5, 6].into()); in iteration_order()
[all …]
/wasmtime-44.0.1/cranelift/entity/src/
H A Dset.rs48 self.insert(k); in extend()
160 pub fn insert(&mut self, k: K) -> bool { in insert() function
162 self.bitset.insert(index) in insert()
229 m.insert(r2); in basic()
230 m.insert(r1); in basic()
247 m.insert(E(8)); in basic()
248 m.insert(E(15)); in basic()
270 m.insert(r0); in pop_ordered()
271 m.insert(r1); in pop_ordered()
272 m.insert(r2); in pop_ordered()
[all …]
H A Dsparse.rs150 pub fn insert(&mut self, value: V) -> Option<V> { in insert() function
303 assert_eq!(map.insert(Obj(i1, "hi")), None); in single_entry()
332 assert_eq!(map.insert(Obj(i2, "foo")), None); in multiple_entries()
333 assert_eq!(map.insert(Obj(i1, "bar")), None); in multiple_entries()
334 assert_eq!(map.insert(Obj(i0, "baz")), None); in multiple_entries()
357 assert_eq!(map.insert(Obj(i1, "barbar")), None); in multiple_entries()
365 assert_eq!(map.insert(Obj(i0, "bazbaz")), Some(Obj(i0, "baz"))); in multiple_entries()
386 assert_eq!(set.insert(i0), None); in entity_set()
387 assert_eq!(set.insert(i0), Some(i0)); in entity_set()
388 assert_eq!(set.insert(i1), None); in entity_set()
[all …]
/wasmtime-44.0.1/crates/test-programs/src/bin/
H A Dfuzz_async.rs185 State::with(|s| s.async_pending_exports_ready.insert(id, tx)); in async_pending()
197 s.async_pending_exports_cancelled.insert(self.0); in async_pending()
216 let prev = State::with(|s| s.future_readers.insert(id, f)); in future_receive()
225 let prev = State::with(|s| s.stream_readers.insert(id, f)); in stream_receive()
338 let prev = s.future_writers.insert(id, writer); in run()
340 let prev = s.future_readers.insert(id, reader); in run()
347 let prev = s.future_readers.insert(id, reader); in run()
448 let prev = s.future_readers.insert(id, reader); in run()
551 let prev = s.stream_writers.insert(id, writer); in run()
553 let prev = s.stream_readers.insert(id, reader); in run()
[all …]
/wasmtime-44.0.1/crates/environ/src/
H A Dstring_pool.rs87 new_pool.insert(s)?; in try_clone()
180 pub fn insert(&mut self, s: &str) -> Result<Atom, OutOfMemory> { in insert() method
209 let old = self.map.insert(s, atom)?; in insert_new_boxed_str()
314 let a = pool.insert("a")?; in basic()
318 let a2 = pool.insert("a")?; in basic()
322 let b = pool.insert("b")?; in basic()
330 let c = pool2.insert("c")?; in basic()
347 let atoms: TryVec<_> = (0..n).map(|i| pool.insert(&i.to_string())).try_collect()?; in stress()
361 let a = pool.insert("a")?; in roundtrip_serialize_deserialize()
362 let b = pool.insert("b")?; in roundtrip_serialize_deserialize()
[all …]
/wasmtime-44.0.1/cranelift/bforest/src/
H A Dmap.rs133 pub fn insert<C: Comparator<K>>( in insert() function
394 fn insert( in insert() function
1030 m.insert(5, 4.2, f, &()); in split_level0_leaf()
1046 m.insert(80, 4.2, f, &()); in split_level0_leaf()
1052 m.insert(35, 4.2, f, &()); in split_level0_leaf()
1058 m.insert(45, 4.2, f, &()); in split_level0_leaf()
1117 m.insert(0, 4.2, f, &()); in split_level1_leaf()
1124 m.insert(135, 4.2, f, &()); in split_level1_leaf()
1131 m.insert(145, 4.2, f, &()); in split_level1_leaf()
1138 m.insert(175, 4.2, f, &()); in split_level1_leaf()
[all …]
H A Dset.rs107 pub fn insert<C: Comparator<K>>( in insert() function
113 self.cursor(forest, comp).insert(key) in insert()
290 pub fn insert(&mut self, elem: K) -> bool { in insert() function
306 *self.root = self.path.insert(elem, SetValue(), self.pool)?.into(); in try_insert()
413 assert!(c.insert(50)); in simple_cursor()
417 assert!(c.insert(100)); in simple_cursor()
421 assert!(c.insert(10)); in simple_cursor()
459 assert!(c.insert(i)); in two_level_sparse_tree()
506 assert!(c.insert(i)); in three_level_sparse_tree()
557 assert!(s.insert((n * 7) % 4000, f, &())); in dense4l()
/wasmtime-44.0.1/crates/fuzzing/src/generators/gc_ops/
H A Dtypes.rs155 e.insert(BTreeSet::new()); in insert_rec_group()
175 .insert(id); in insert_empty_struct()
176 self.type_defs.insert( in insert_empty_struct()
217 seen.insert(id); in sort_types_topo()
246 seen.insert(id); in sort_rec_groups_topo()
270 seen.insert(id); in break_supertype_cycles()
271 active.insert(id); in break_supertype_cycles()
278 to_clear.insert(from); in break_supertype_cycles()
323 seen.insert(id); in break_rec_group_cycles()
324 active.insert(id); in break_rec_group_cycles()
[all …]
/wasmtime-44.0.1/crates/environ/src/collections/
H A Dbtree_map.rs674 m.insert(i, i as f32)?; in len()
689 m.insert(42, 42.0)?; in is_empty()
701 m.insert(42, 42.0)?; in contains_key()
715 m.insert(42, 42.0)?; in get()
729 m.insert(42, 42.0)?; in get_mut()
741 fn insert() -> Result<()> { in insert() function
755 m.insert(10, 123.0)?; in remove()
765 m.insert(i, i as f32)?; in clear()
779 m.insert(i, i as f32)?; in iter()
904 let old = e.insert(43.0); in entry()
[all …]
H A Dsecondary_map.rs78 pub fn insert(&mut self, k: K, v: V) -> Result<Option<V>, OutOfMemory> { in insert() function
251 map.insert(key, val) in deserialize()
283 map.insert(k(0), 33)?; in serialize_deserialize()
284 map.insert(k(1), 44)?; in serialize_deserialize()
285 map.insert(k(2), 55)?; in serialize_deserialize()
286 map.insert(k(3), 99)?; in serialize_deserialize()
287 map.insert(k(4), 99)?; in serialize_deserialize()
/wasmtime-44.0.1/crates/wasmtime/src/runtime/vm/component/
H A Dhandle_table.rs137 fn insert(&mut self, slot: Slot) -> Result<u32> { in insert() method
189 self.insert(Slot::ResourceOwn { in resource_own_insert()
283 self.insert(Slot::Stream { in stream_insert_read()
295 self.insert(Slot::Stream { in stream_insert_write()
386 self.insert(Slot::Future { in future_insert_read()
398 self.insert(Slot::Future { in future_insert_write()
487 self.insert(Slot::ErrorContext { rep }) in error_context_insert()
512 self.insert(Slot::GuestTask { rep }) in subtask_insert_guest()
517 self.insert(Slot::HostTask { rep }) in subtask_insert_host()
543 self.insert(Slot::WaitableSet { rep }) in waitable_set_insert()
[all …]
/wasmtime-44.0.1/cranelift/codegen/src/
H A Dscoped_hash_map.rs49 pub fn insert(self, value: V) { in insert() method
57 v.insert(val); in insert()
173 v.insert(value); in insert_if_absent_with_depth()
193 self.map.insert(key, val, ctx); in insert_with_depth()
227 Entry::Vacant(entry) => entry.insert(1), in basic()
231 Entry::Vacant(entry) => entry.insert(8), in basic()
244 Entry::Vacant(entry) => entry.insert(3), in basic()
274 Entry::Vacant(entry) => entry.insert(4), in basic()
294 Entry::Vacant(entry) => entry.insert(5), in basic()
313 Entry::Vacant(entry) => entry.insert(3), in basic()
/wasmtime-44.0.1/crates/wasmtime/src/runtime/component/
H A Dlinker.rs425 self.insert(name, Definition::Func(HostFunc::func_wrap(func)))?; in func_wrap()
472 self.insert(name, Definition::Func(HostFunc::func_wrap_async(f)))?; in func_wrap_async()
648 self.insert(name, Definition::Func(HostFunc::func_new(func)))?; in func_new()
671 self.insert(name, Definition::Func(HostFunc::func_new_async(func)))?; in func_new_async()
709 self.insert(name, Definition::Module(module.clone()))?; in module()
745 self.insert(name, Definition::Resource(ty, dtor))?; in resource()
763 self.insert(name, Definition::Resource(ty, dtor))?; in resource_async()
802 self.insert(name, Definition::Resource(ty, dtor))?; in resource_concurrent()
828 fn insert(&mut self, name: &str, item: Definition) -> Result<usize> { in insert() method
830 .insert(name, self.strings, self.allow_shadowing, item) in insert()
[all …]
/wasmtime-44.0.1/cranelift/isle/isle/src/
H A Dstablemapset.rs23 pub fn insert(&mut self, val: T) -> bool { in insert() method
24 self.0.insert(val) in insert()
56 pub(crate) fn insert(&mut self, k: K, v: V) -> Option<V> { in insert() method
57 self.0.insert(k, v) in insert()
/wasmtime-44.0.1/crates/wiggle/test-helpers/src/
H A Dlib.rs11 pub fn insert(&mut self, a: MemArea) { in insert() method
15 Ok(loc) => self.0.insert(loc, a), in insert()
17 Err(loc) => self.0.insert(loc, a), in insert()
32 out.insert(*m); in from()
92 out.insert(MemArea { in invert()
100 out.insert(MemArea { in invert()
285 all.insert(i);
/wasmtime-44.0.1/crates/fuzzing/src/generators/
H A Dcomponent_async.rs227 .insert(id, (scope, HalfState::Idle, transferable)); in insert()
229 assert!(self.droppable.insert(id)); in insert()
231 self.transferable.insert(id); in insert()
272 assert!(self.cancellable.insert(id)); in start()
285 assert!(self.transferable.insert(id)); in stop()
287 assert!(self.droppable.insert(id)); in stop()
289 assert!(self.ready.insert(id)); in stop()
304 self.cancellable.insert(id); in set_in_use_state_dropped()
535 self.futures.readers.ready.insert(id); in generate()
537 self.futures.writers.ready.insert(id); in generate()
[all …]
/wasmtime-44.0.1/crates/wasmtime/src/runtime/
H A Dlinker.rs370 self.insert(key, Definition::new(store.0, item.into()))?; in define()
391 self.insert(key, Definition::new(store.0, item.into()))?; in define_name()
400 self.insert(key, Definition::HostFunc(try_new(func)?))?; in func_insert()
646 self.insert(key, Definition::new(store.0, export))?; in instance()
973 Some(item) => self.insert(dst, item)?, in alias()
989 let module = self.pool.insert(module)?; in alias_module()
990 let as_module = self.pool.insert(as_module)?; in alias_module()
998 self.insert( in alias_module()
1018 self.map.insert(key, item)?; in insert()
1024 module: self.pool.insert(module)?, in import_key()
[all …]

12345678