| /third_party/boost/libs/fiber/src/numa/algo/ |
| D | work_stealing.cpp | 101 context * victim = rqueue_.pop(); in pick_next() local
102 if ( nullptr != victim) { in pick_next()
103 boost::context::detail::prefetch_range( victim, sizeof( context) ); in pick_next()
104 if ( ! victim->is_context( type::pinned_context) ) { in pick_next()
105 context::active()->attach( victim); in pick_next()
126 victim = schedulers_[cpu_id]->steal(); in pick_next()
127 } while ( nullptr == victim && count < size); in pick_next()
128 if ( nullptr != victim) { in pick_next()
129 boost::context::detail::prefetch_range( victim, sizeof( context) ); in pick_next()
130 BOOST_ASSERT( ! victim->is_context( type::pinned_context) ); in pick_next()
[all …]
|
| /third_party/boost/libs/fiber/src/algo/ |
| D | work_stealing.cpp | 59 context * victim = rqueue_.pop(); in pick_next() local
60 if ( nullptr != victim) { in pick_next()
61 boost::context::detail::prefetch_range( victim, sizeof( context) ); in pick_next()
62 if ( ! victim->is_context( type::pinned_context) ) { in pick_next()
63 context::active()->attach( victim); in pick_next()
80 victim = schedulers_[id]->steal(); in pick_next()
81 } while ( nullptr == victim && count < size); in pick_next()
82 if ( nullptr != victim) { in pick_next()
83 boost::context::detail::prefetch_range( victim, sizeof( context) ); in pick_next()
84 BOOST_ASSERT( ! victim->is_context( type::pinned_context) ); in pick_next()
[all …]
|
| D | round_robin.cpp | 30 context * victim = nullptr; in pick_next() local
32 victim = & rqueue_.front(); in pick_next()
34 boost::context::detail::prefetch_range( victim, sizeof( context) ); in pick_next()
35 BOOST_ASSERT( nullptr != victim); in pick_next()
36 BOOST_ASSERT( ! victim->ready_is_linked() ); in pick_next()
37 BOOST_ASSERT( victim->is_resumable() ); in pick_next()
39 return victim; in pick_next()
|
| /third_party/libunwind/src/riscv/ |
| D | Ginit.c | 253 int i, victim; in cache_valid_mem() local
254 victim = lga_victim; in cache_valid_mem()
256 if (last_good_addr[victim] == 0) { in cache_valid_mem()
257 last_good_addr[victim] = addr; in cache_valid_mem()
260 victim = (victim + 1) % NLGA; in cache_valid_mem()
264 last_good_addr[victim] = addr; in cache_valid_mem()
265 victim = (victim + 1) % NLGA; in cache_valid_mem()
266 lga_victim = victim; in cache_valid_mem()
289 int i, victim; in cache_valid_mem() local
290 victim = atomic_load(&lga_victim); in cache_valid_mem()
[all …]
|
| /third_party/libunwind/src/x86_64/ |
| D | Ginit.c | 234 int i, victim; in cache_valid_mem() local
235 victim = lga_victim; in cache_valid_mem()
237 if (last_good_addr[victim] == 0) { in cache_valid_mem()
238 last_good_addr[victim] = addr; in cache_valid_mem()
241 victim = (victim + 1) % NLGA; in cache_valid_mem()
245 last_good_addr[victim] = addr; in cache_valid_mem()
246 victim = (victim + 1) % NLGA; in cache_valid_mem()
247 lga_victim = victim; in cache_valid_mem()
270 int i, victim; in cache_valid_mem() local
271 victim = atomic_load(&lga_victim); in cache_valid_mem()
[all …]
|
| /third_party/libunwind/src/aarch64/ |
| D | Ginit.c | 244 int i, victim; in cache_valid_mem() local
245 victim = lga_victim; in cache_valid_mem()
247 if (last_good_addr[victim] == 0) { in cache_valid_mem()
248 last_good_addr[victim] = addr; in cache_valid_mem()
251 victim = (victim + 1) % NLGA; in cache_valid_mem()
255 last_good_addr[victim] = addr; in cache_valid_mem()
256 victim = (victim + 1) % NLGA; in cache_valid_mem()
257 lga_victim = victim; in cache_valid_mem()
280 int i, victim; in cache_valid_mem() local
281 victim = atomic_load(&lga_victim); in cache_valid_mem()
[all …]
|
| /third_party/curl/tests/unit/ |
| D | unit1655.c | 103 struct demo victim; variable
106 victim.canary1 = 87; /* magic numbers, arbritrarily picked */
107 victim.canary2 = 35;
108 victim.canary3 = 41;
109 d = doh_encode(name, DNS_TYPE_A, victim.dohbuffer,
117 fail_if(victim.canary1 == 87,
121 fail_unless(victim.canary1 == 87,
124 fail_unless(victim.canary2 == 35,
126 fail_unless(victim.canary3 == 41,
131 fail_unless(olen <= sizeof(victim.dohbuffer), "wrote outside bounds");
|
| /third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/ |
| D | rbtree.h | 97 rb_replace_node(struct rb_node *victim, struct rb_node *newnode, in rb_replace_node() argument
102 p = rb_parent(victim); in rb_replace_node()
104 if (p->rb_left == victim) in rb_replace_node()
110 if (victim->rb_left) in rb_replace_node()
111 rb_set_parent(victim->rb_left, newnode); in rb_replace_node()
112 if (victim->rb_right) in rb_replace_node()
113 rb_set_parent(victim->rb_right, newnode); in rb_replace_node()
114 *newnode = *victim; in rb_replace_node()
|
| /third_party/libunwind/src/x86/ |
| D | Ginit.c | 88 int i, victim; in validate_mem() local
117 victim = lga_victim; in validate_mem()
119 if (!last_good_addr[victim]) { in validate_mem()
120 last_good_addr[victim++] = addr; in validate_mem()
123 victim = (victim + 1) % NLGA; in validate_mem()
127 last_good_addr[victim] = addr; in validate_mem()
128 victim = (victim + 1) % NLGA; in validate_mem()
129 lga_victim = victim; in validate_mem()
|
| /third_party/libunwind/src/arm/ |
| D | Ginit.c | 85 int i, victim; in validate_mem() local
107 victim = lga_victim; in validate_mem()
109 if (!last_good_addr[victim]) { in validate_mem()
110 last_good_addr[victim++] = addr; in validate_mem()
113 victim = (victim + 1) % NLGA; in validate_mem()
117 last_good_addr[victim] = addr; in validate_mem()
118 victim = (victim + 1) % NLGA; in validate_mem()
119 lga_victim = victim; in validate_mem()
|
| /third_party/libunwind/src/s390x/ |
| D | Ginit.c | 212 int i, victim; in validate_mem() local
234 victim = lga_victim; in validate_mem()
236 if (!last_good_addr[victim]) { in validate_mem()
237 last_good_addr[victim++] = addr; in validate_mem()
240 victim = (victim + 1) % NLGA; in validate_mem()
244 last_good_addr[victim] = addr; in validate_mem()
245 victim = (victim + 1) % NLGA; in validate_mem()
246 lga_victim = victim; in validate_mem()
|
| /third_party/e2fsprogs/lib/ext2fs/ |
| D | rbtree.c | 362 void ext2fs_rb_replace_node(struct rb_node *victim, struct rb_node *new, in ext2fs_rb_replace_node() argument
365 struct rb_node *parent = ext2fs_rb_parent(victim); in ext2fs_rb_replace_node()
369 if (victim == parent->rb_left) in ext2fs_rb_replace_node()
376 if (victim->rb_left) in ext2fs_rb_replace_node()
377 ext2fs_rb_set_parent(victim->rb_left, new); in ext2fs_rb_replace_node()
378 if (victim->rb_right) in ext2fs_rb_replace_node()
379 ext2fs_rb_set_parent(victim->rb_right, new); in ext2fs_rb_replace_node()
382 *new = *victim; in ext2fs_rb_replace_node()
|
| D | rbtree.h | 161 extern void ext2fs_rb_replace_node(struct rb_node *victim, struct rb_node *new,
|
| /third_party/boost/libs/graph/test/ |
| D | biconnected_components_test.cpp | 45 Vertex victim = vertex(get(vertex_index, g, *vi), g_copy); in check_articulation_points() local
46 clear_vertex(victim, g_copy); in check_articulation_points()
47 remove_vertex(victim, g_copy); in check_articulation_points()
|
| /third_party/boost/boost/function/ |
| D | function_base.hpp | 468 functor_wrapper_type* victim = in manager() local
470 wrapper_allocator_type wrapper_allocator(static_cast<Allocator const &>(*victim)); in manager()
472 wrapper_allocator.destroy(victim); in manager()
474 std::allocator_traits<wrapper_allocator_type>::destroy(wrapper_allocator, victim); in manager()
476 wrapper_allocator.deallocate(victim,1); in manager()
|
| /third_party/python/Lib/test/ |
| D | list_tests.py | 374 def __init__(self, victim): argument
375 self.victim = victim
377 del self.victim[:]
|
| D | test_shutil.py | 187 victim = os.path.join(tmp, 'killme')
188 os.mkdir(victim)
189 write_file(os.path.join(victim, 'somefile'), 'foo')
190 victim = os.fsencode(victim)
191 self.assertIsInstance(victim, bytes)
192 shutil.rmtree(victim)
|
| /third_party/boost/boost/property_map/parallel/impl/ |
| D | distributed_property_map.ipp | 66 boost::parallel::detail::untracked_pair<key_type, value_type> const& victim
68 send(data->process_group, get(data->global, victim.first).first,
69 property_map_put, victim);
|
| /third_party/boost/boost/graph/distributed/ |
| D | dehne_gotz_min_spanning_tree.hpp | 213 vertex_descriptor victim = u; in boruvka_merge_step() local
214 if (dset.find_set(u) == u) victim = v; in boruvka_merge_step()
215 supervertices[get(supervertex_map, victim)] = in boruvka_merge_step()
|
| /third_party/boost/libs/fiber/doc/ |
| D | tuning.qbk | 43 victim (implemented in __work_stealing__ and __numa_work_stealing__)
47 selects another fiber-scheduler and requests for a ready fibers, the victim
|
| D | numa.qbk | 305 The victim scheduler (from which a ready fiber is stolen) is selected at random.
|
| /third_party/boost/libs/math/doc/interpolators/ |
| D | barycentric_rational_interpolation.qbk | 91 you will probably not fall victim to this problem.
|
| /third_party/node/deps/npm/node_modules/protoduck/ |
| D | README.md | 142 peck (victim) { return 'Can I just bite ' + victim + ' instead?...' }
|
| /third_party/python/Doc/library/ |
| D | logging.config.rst | 167 victim user's process, simply by connecting to the victim's
169 code the attacker wants to have executed in the victim's process. This is
|
| /third_party/openssl/doc/man3/ |
| D | SSL_CTX_dane_enable.pod | 150 convince a client that a connection to a victim server is instead a secure
|