| /dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/gc/g1/ |
| H A D | g1Allocator.inline.hpp | 39 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in mutator_alloc_region()
40 return &_mutator_alloc_regions[node_index]; in mutator_alloc_region()
44 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in survivor_gc_alloc_region()
45 return &_survivor_gc_alloc_regions[node_index]; in survivor_gc_alloc_region()
55 uint node_index = current_node_index(); in attempt_allocation() local
66 uint node_index = current_node_index(); in attempt_allocation_using_new_region() local
76 uint node_index = current_node_index(); in attempt_allocation_locked() local
85 uint node_index = current_node_index(); in attempt_allocation_force() local
94 return alloc_buffer(dest.type(), node_index); in alloc_buffer()
104 return _alloc_buffers[dest][node_index]; in alloc_buffer()
[all …]
|
| H A D | heapRegionSet.inline.hpp | 120 increase_length(hr->node_index()); in add_ordered()
172 decrease_length(hr->node_index()); in remove_region()
230 decrease_length(cur->node_index()); in remove_region_with_node_index()
236 if (node_index < _num_nodes) { in increase_length()
237 _length_of_node[node_index] += 1; in increase_length()
242 if (node_index < _num_nodes) { in decrease_length()
243 assert(_length_of_node[node_index] > 0, in decrease_length()
245 _length_of_node[node_index], node_index); in decrease_length()
246 _length_of_node[node_index] -= 1; in decrease_length()
251 return _length_of_node[node_index]; in length()
[all …]
|
| H A D | g1Allocator.cpp | 71 uint node_index = current_node_index(); in has_mutator_alloc_region() local
145 for (uint node_index = 0; node_index < _num_alloc_regions; node_index++) { in release_gc_alloc_regions() local
147 survivor_gc_alloc_region(node_index)->release(); in release_gc_alloc_regions()
192 uint node_index = current_node_index(); in unsafe_max_tlab_alloc() local
292 for (uint node_index = 0; node_index < length; node_index++) { in G1PLABAllocator() local
301 for (uint node_index = 0; node_index < length; node_index++) { in ~G1PLABAllocator() local
302 delete _alloc_buffers[state][node_index]; in ~G1PLABAllocator()
324 PLAB* alloc_buf = alloc_buffer(dest, node_index); in allocate_direct_or_new_plab()
365 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in flush_and_retire_stats() local
379 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in waste() local
[all …]
|
| /dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/gc/g1/ |
| H A D | g1Allocator.inline.hpp | 38 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in mutator_alloc_region()
39 return &_mutator_alloc_regions[node_index]; in mutator_alloc_region()
43 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in survivor_gc_alloc_region()
44 return &_survivor_gc_alloc_regions[node_index]; in survivor_gc_alloc_region()
54 uint node_index = current_node_index(); in attempt_allocation() local
63 uint node_index = current_node_index(); in attempt_allocation_locked() local
71 uint node_index = current_node_index(); in attempt_allocation_force() local
80 return alloc_buffer(dest.type(), node_index); in alloc_buffer()
88 assert(node_index < alloc_buffers_length(dest), in alloc_buffer()
90 return _alloc_buffers[dest][node_index]; in alloc_buffer()
[all …]
|
| H A D | heapRegionSet.inline.hpp | 119 increase_length(hr->node_index()); in add_ordered()
171 decrease_length(hr->node_index()); in remove_region()
229 decrease_length(cur->node_index()); in remove_region_with_node_index()
235 if (node_index < _num_nodes) { in increase_length()
236 _length_of_node[node_index] += 1; in increase_length()
241 if (node_index < _num_nodes) { in decrease_length()
242 assert(_length_of_node[node_index] > 0, in decrease_length()
244 _length_of_node[node_index], node_index); in decrease_length()
245 _length_of_node[node_index] -= 1; in decrease_length()
250 return _length_of_node[node_index]; in length()
[all …]
|
| H A D | g1Allocator.cpp | 70 uint node_index = current_node_index(); in has_mutator_alloc_region() local
144 for (uint node_index = 0; node_index < _num_alloc_regions; node_index++) { in release_gc_alloc_regions() local
146 survivor_gc_alloc_region(node_index)->release(); in release_gc_alloc_regions()
191 uint node_index = current_node_index(); in unsafe_max_tlab_alloc() local
291 for (uint node_index = 0; node_index < length; node_index++) { in G1PLABAllocator() local
300 for (uint node_index = 0; node_index < length; node_index++) { in ~G1PLABAllocator() local
301 delete _alloc_buffers[state][node_index]; in ~G1PLABAllocator()
323 PLAB* alloc_buf = alloc_buffer(dest, node_index); in allocate_direct_or_new_plab()
364 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in flush_and_retire_stats() local
378 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in waste() local
[all …]
|
| /dports/math/py-optuna/optuna-2.10.0/optuna/importance/_fanova/ |
| H A D | _tree.py | 38 node_index
105 node_index = active_nodes.pop()
136 node_indices.append(node_index)
159 for node_index in range(n_nodes):
160 subspace = subspaces[node_index]
162 if self._is_node_leaf(node_index):
214 for node_index in range(self._n_nodes):
261 return self._get_node_left_child(node_index), self._get_node_right_child(node_index)
264 return self._tree.value[node_index]
267 return self._tree.threshold[node_index]
[all …]
|
| /dports/science/frontistr/FrontISTR-c66bdc397de319ca59a0565b3f3b1a3b33f0c50c/hecmw1/src/common/ |
| H A D | hecmw_ucd_print.c | 97 int node_index; in ucd_print() local
154 node_index = mesh->elem_node_index[i]; in ucd_print()
167 node_index = mesh->elem_node_index[i]; in ucd_print()
180 node_index = mesh->elem_node_index[i]; in ucd_print()
193 node_index = mesh->elem_node_index[i]; in ucd_print()
206 node_index = mesh->elem_node_index[i]; in ucd_print()
219 node_index = mesh->elem_node_index[i]; in ucd_print()
232 node_index = mesh->elem_node_index[i]; in ucd_print()
245 node_index = mesh->elem_node_index[i]; in ucd_print()
258 node_index = mesh->elem_node_index[i]; in ucd_print()
[all …]
|
| /dports/net/openmpi/openmpi-4.1.1/ompi/patterns/net/ |
| H A D | netpatterns_multinomial_tree.c | 35 int cnt, n_nodes_in_this_level,node_index; in ompi_netpatterns_setup_multinomial_tree() local
61 node_index=-1; in ompi_netpatterns_setup_multinomial_tree()
68 node_index++; in ompi_netpatterns_setup_multinomial_tree()
71 if( node_index == num_nodes) { in ompi_netpatterns_setup_multinomial_tree()
75 tree_nodes[node_index].my_rank=node_index; in ompi_netpatterns_setup_multinomial_tree()
76 tree_nodes[node_index].children_ranks=NULL; in ompi_netpatterns_setup_multinomial_tree()
82 tree_nodes[node_index].n_parents=0; in ompi_netpatterns_setup_multinomial_tree()
84 tree_nodes[node_index].parent_rank=-1; in ompi_netpatterns_setup_multinomial_tree()
86 tree_nodes[node_index].n_parents=1; in ompi_netpatterns_setup_multinomial_tree()
97 tree_nodes[node_index].parent_rank= in ompi_netpatterns_setup_multinomial_tree()
[all …]
|
| /dports/net/openmpi3/openmpi-3.1.6/ompi/patterns/net/ |
| H A D | netpatterns_multinomial_tree.c | 35 int cnt, n_nodes_in_this_level,node_index; in ompi_netpatterns_setup_multinomial_tree() local
61 node_index=-1; in ompi_netpatterns_setup_multinomial_tree()
68 node_index++; in ompi_netpatterns_setup_multinomial_tree()
71 if( node_index == num_nodes) { in ompi_netpatterns_setup_multinomial_tree()
75 tree_nodes[node_index].my_rank=node_index; in ompi_netpatterns_setup_multinomial_tree()
76 tree_nodes[node_index].children_ranks=NULL; in ompi_netpatterns_setup_multinomial_tree()
82 tree_nodes[node_index].n_parents=0; in ompi_netpatterns_setup_multinomial_tree()
84 tree_nodes[node_index].parent_rank=-1; in ompi_netpatterns_setup_multinomial_tree()
86 tree_nodes[node_index].n_parents=1; in ompi_netpatterns_setup_multinomial_tree()
97 tree_nodes[node_index].parent_rank= in ompi_netpatterns_setup_multinomial_tree()
[all …]
|
| /dports/cad/ngspice_rework/ngspice-35/src/xspice/evt/ |
| H A D | evtiter.c | 97 int node_index; in EVTiter() local
155 node_index = output_table[output_index]->node_index; in EVTiter()
158 if(! node_queue->to_eval[node_index]) { in EVTiter()
161 = node_index; in EVTiter()
180 node_index = node_queue->to_eval_index[i]; in EVTiter()
189 rhs[node_index].output_value, in EVTiter()
190 rhs[node_index].node_value); in EVTiter()
192 (rhs[node_index].node_value, in EVTiter()
193 rhsold[node_index].node_value, in EVTiter()
210 if(node_table[node_index]->invert) { in EVTiter()
[all …]
|
| /dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/gc/g1/ |
| H A D | g1Allocator.inline.hpp | 38 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in mutator_alloc_region()
39 return &_mutator_alloc_regions[node_index]; in mutator_alloc_region()
43 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in survivor_gc_alloc_region()
44 return &_survivor_gc_alloc_regions[node_index]; in survivor_gc_alloc_region()
54 uint node_index = current_node_index(); in attempt_allocation() local
63 uint node_index = current_node_index(); in attempt_allocation_locked() local
71 uint node_index = current_node_index(); in attempt_allocation_force() local
80 return alloc_buffer(dest.type(), node_index); in alloc_buffer()
88 assert(node_index < alloc_buffers_length(dest), in alloc_buffer()
90 return _alloc_buffers[dest][node_index]; in alloc_buffer()
[all …]
|
| H A D | heapRegionSet.inline.hpp | 119 increase_length(hr->node_index()); in add_ordered()
171 decrease_length(hr->node_index()); in remove_region()
229 decrease_length(cur->node_index()); in remove_region_with_node_index()
235 if (node_index < _num_nodes) { in increase_length()
236 _length_of_node[node_index] += 1; in increase_length()
241 if (node_index < _num_nodes) { in decrease_length()
242 assert(_length_of_node[node_index] > 0, in decrease_length()
244 _length_of_node[node_index], node_index); in decrease_length()
245 _length_of_node[node_index] -= 1; in decrease_length()
250 return _length_of_node[node_index]; in length()
[all …]
|
| H A D | g1Allocator.cpp | 70 uint node_index = current_node_index(); in has_mutator_alloc_region() local
144 for (uint node_index = 0; node_index < _num_alloc_regions; node_index++) { in release_gc_alloc_regions() local
146 survivor_gc_alloc_region(node_index)->release(); in release_gc_alloc_regions()
191 uint node_index = current_node_index(); in unsafe_max_tlab_alloc() local
304 for (uint node_index = 0; node_index < length; node_index++) { in G1PLABAllocator() local
313 for (uint node_index = 0; node_index < length; node_index++) { in ~G1PLABAllocator() local
314 delete _alloc_buffers[state][node_index]; in ~G1PLABAllocator()
336 PLAB* alloc_buf = alloc_buffer(dest, node_index); in allocate_direct_or_new_plab()
377 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in flush_and_retire_stats() local
391 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in waste() local
[all …]
|
| /dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/gc/g1/ |
| H A D | g1Allocator.inline.hpp | 38 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in mutator_alloc_region()
39 return &_mutator_alloc_regions[node_index]; in mutator_alloc_region()
43 assert(node_index < _num_alloc_regions, "Invalid index: %u", node_index); in survivor_gc_alloc_region()
44 return &_survivor_gc_alloc_regions[node_index]; in survivor_gc_alloc_region()
54 uint node_index = current_node_index(); in attempt_allocation() local
63 uint node_index = current_node_index(); in attempt_allocation_locked() local
71 uint node_index = current_node_index(); in attempt_allocation_force() local
80 return alloc_buffer(dest.type(), node_index); in alloc_buffer()
88 assert(node_index < alloc_buffers_length(dest), in alloc_buffer()
90 return _alloc_buffers[dest][node_index]; in alloc_buffer()
[all …]
|
| H A D | heapRegionSet.inline.hpp | 119 increase_length(hr->node_index()); in add_ordered()
171 decrease_length(hr->node_index()); in remove_region()
229 decrease_length(cur->node_index()); in remove_region_with_node_index()
235 if (node_index < _num_nodes) { in increase_length()
236 _length_of_node[node_index] += 1; in increase_length()
241 if (node_index < _num_nodes) { in decrease_length()
242 assert(_length_of_node[node_index] > 0, in decrease_length()
244 _length_of_node[node_index], node_index); in decrease_length()
245 _length_of_node[node_index] -= 1; in decrease_length()
250 return _length_of_node[node_index]; in length()
[all …]
|
| H A D | g1Allocator.cpp | 70 uint node_index = current_node_index(); in has_mutator_alloc_region() local
144 for (uint node_index = 0; node_index < _num_alloc_regions; node_index++) { in release_gc_alloc_regions() local
146 survivor_gc_alloc_region(node_index)->release(); in release_gc_alloc_regions()
191 uint node_index = current_node_index(); in unsafe_max_tlab_alloc() local
304 for (uint node_index = 0; node_index < length; node_index++) { in G1PLABAllocator() local
313 for (uint node_index = 0; node_index < length; node_index++) { in ~G1PLABAllocator() local
314 delete _alloc_buffers[state][node_index]; in ~G1PLABAllocator()
336 PLAB* alloc_buf = alloc_buffer(dest, node_index); in allocate_direct_or_new_plab()
377 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in flush_and_retire_stats() local
391 for (uint node_index = 0; node_index < alloc_buffers_length(state); node_index++) { in waste() local
[all …]
|
| /dports/textproc/tkxmlive/tkxmlive/library/ |
| H A D | richtext-updatewidget.tcl | 86 if { [$widget compare $node_index != "$node_index linestart"] } {
103 if { [$widget compare $node_index != "$node_index linestart"] } {
117 set node_index [insNode $widget $node_index \
142 set node_index [updateWidget $widget $children -index $node_index]
152 set node_index [insNode $widget $node_index ${xml_node} " " \
162 if { [$widget compare $node_index != "$node_index linestart"] } {
179 set node_index [insNode $widget $node_index \
201 set node_index [insNode $widget $node_index ${xml_node} \
223 if { [$widget compare $node_index != "$node_index linestart"] } {
239 set node_index [insNode $widget $node_index \
[all …]
|
| /dports/archivers/lhasa/lhasa-0.3.1/lib/ |
| H A D | lh1_decoder.c | 183 int node_index; in init_tree() local
203 --node_index; in init_tree()
211 while (node_index >= 0) { in init_tree()
243 --node_index; in init_tree()
356 return node_index; in make_group_leader()
554 uint16_t node_index; in increment_for_code() local
575 node_index = make_group_leader(decoder, node_index); in increment_for_code()
581 node_index = decoder->nodes[node_index].parent; in increment_for_code()
589 unsigned int node_index; in read_code() local
595 node_index = 0; in read_code()
[all …]
|
| /dports/math/lis/lis-2.0.30/src/fortran/amg/ |
| H A D | lis_m_queue_mod.F90 | 55 i = node_index(node)
72 node_index(w2) = i
74 node_index(w1) = p
92 i = node_index(node)
114 node_index(w) = i
161 node_index(node) = 0
177 node_index(node) = 0
200 node_index(node)=0
215 if(node_index(node)>0) then
219 node_index(node)=0
[all …]
|
| H A D | lis_s_queue_mod.F90 | 48 i=node_index(node)
64 node_index(w2)=i
66 node_index(w1)=p
84 i=node_index(node)
101 node_index(w)=i
139 if(node_index(node)>0) then
142 node_index(node)=0
155 if(node_index(node)>0) then
158 node_index(node)=0
178 node_index(node)=0
[all …]
|
| /dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/naga/src/front/spv/ |
| H A D | flow.rs | 15 graph::{node_index, NodeIndex},
244 Some(node_index) in classify()
254 Some(node_index) in classify()
267 Some(node_index) in classify()
275 enclosing.push(node_index); in classify()
277 node_index in classify()
465 if node_index.is_none() { in compute_postorder_traverse()
468 let node_index = node_index.unwrap(); in compute_postorder_traverse() localVariable
547 node_index: BlockNodeIndex, in convert_to_naga_traverse()
864 node_index.index(), in to_graphviz()
[all …]
|
| /dports/www/firefox-esr/firefox-91.8.0/third_party/rust/naga/src/front/spv/ |
| H A D | flow.rs | 15 graph::{node_index, NodeIndex},
244 Some(node_index) in classify()
254 Some(node_index) in classify()
267 Some(node_index) in classify()
275 enclosing.push(node_index); in classify()
277 node_index in classify()
465 if node_index.is_none() { in compute_postorder_traverse()
468 let node_index = node_index.unwrap(); in compute_postorder_traverse() localVariable
547 node_index: BlockNodeIndex, in convert_to_naga_traverse()
864 node_index.index(), in to_graphviz()
[all …]
|
| /dports/misc/vxl/vxl-3.3.2/contrib/rpl/rgtl/ |
| H A D | rgtl_compact_tree_node_data.h | 53 if (node_index < node_count-1) in node_data_link_destroy()
59 if (link const& ndl = node_data_link(node_index)) in node_data_link_destroy()
73 return node_data_link(node_index); in node_data_get_impl()
79 if (link& ndl = node_data_link(node_index)) in node_data_insert_impl()
90 node_data_link(node_index) = l; in node_data_insert_impl()
93 node_data_owners_.push_back(node_index); in node_data_insert_impl()
104 void node_data_erase_impl(node_index_type node_index) in node_data_erase_impl() argument
109 if (link const& ndl = node_data_link(node_index)) in node_data_erase_impl()
140 link& node_data_link(node_index_type node_index) in node_data_link() argument
142 return node_data_links_[node_index]; in node_data_link()
[all …]
|
| /dports/games/alephone/alephone-release-20190331/Source_Files/GameWorld/ |
| H A D | flood_map.cpp | 126 for (node= nodes, node_index= 0; node_index<node_count; ++node_index, ++node) in flood_map()
130 lowest_cost_node_index= node_index; in flood_map()
140 for (node= nodes+node_index; node_index<node_count; ++node_index, ++node) in flood_map()
144 if (node_index==node_count) in flood_map()
151 lowest_cost_node_index= node_index; in flood_map()
298 short node_index; in add_node() local
309 assert(node_index>=0&&node_index<node_count); in add_node()
310 node= nodes+node_index; in add_node()
315 node_index= node_count; in add_node()
316 node= nodes + node_index; in add_node()
[all …]
|