Home
last modified time | relevance | path

Searched refs:temp_node (Results 1 – 25 of 167) sorted by relevance

1234567

/dports/cad/impact/Impact/src/run/writers/
H A DFembicWriter.java84 Node temp_node; in write() local
105 temp_node = (Node) nodelist.elementAt(k); in write()
107 if (temp_node.getNumber() >= 0) { in write()
109 bw.write(temp_node.getNumber() + " \t"); in write()
110 bw.write(" x = " + temp_node.getX_pos_orig() + " \t"); in write()
111 bw.write(" y = " + temp_node.getY_pos_orig() + " \t"); in write()
112 bw.write(" z = " + temp_node.getZ_pos_orig() + " \t"); in write()
114 if (temp_node.getConstraint() != null) in write()
116 + temp_node.getConstraint().getName() + "\t"); in write()
118 if (temp_node.getLoad() != null) in write()
[all …]
H A DGidWriter.java237 Node temp_node; in writeResult() local
306 if (temp_node.getNumber() >= 0 && !temp_node.isDeActivated()) { in writeResult()
307 bw.write(temp_node.getNumber() + " \t"); in writeResult()
309 temp_node.getX_pos() - in writeResult()
313 temp_node.getY_pos() - in writeResult()
317 temp_node.getZ_pos() - in writeResult()
555 Node temp_node; in writeResultParallel() local
605 if (temp_node.getNumber() >= 0 && !temp_node.isDeActivated()) { in writeResultParallel()
608 temp_node.getX_pos() - in writeResultParallel()
612 temp_node.getY_pos() - in writeResultParallel()
[all …]
/dports/net-mgmt/net-snmp/net-snmp-5.9/agent/mibgroup/
H A Dutil_funcs.c1098 prefix_cbx *temp_node; in net_snmp_search_update_prefix_info() local
1114 for (temp_node = *head; temp_node->next_info != NULL ; temp_node = temp_node->next_info) { in net_snmp_search_update_prefix_info()
1121 temp_node->next_info = node_to_use; in net_snmp_search_update_prefix_info()
1124 for (temp_node = *head; temp_node != NULL ; temp_node = temp_node->next_info) { in net_snmp_search_update_prefix_info()
1141 prefix_cbx *temp_node,*prev_node; in net_snmp_delete_prefix_info() local
1147 for (temp_node = *head, prev_node = NULL; temp_node; in net_snmp_delete_prefix_info()
1148 prev_node = temp_node, temp_node = temp_node->next_info) { in net_snmp_delete_prefix_info()
1150 if (strcmp(temp_node->in6p, address) == 0) { in net_snmp_delete_prefix_info()
1152 prev_node->next_info = temp_node->next_info; in net_snmp_delete_prefix_info()
1154 *head = temp_node->next_info; in net_snmp_delete_prefix_info()
[all …]
/dports/cad/impact/Impact/bin_cluster/genjpsource/run/writers/
H A DGidWriter.java196 Node temp_node; in writeResult() local
220 if (temp_node.getNumber() >= 0 && !temp_node.isDeActivated()) { in writeResult()
221 bw.write(temp_node.getNumber() + " \t"); in writeResult()
222 bw.write(temp_node.getX_pos() - temp_node.getX_pos_orig() + " \t\t"); in writeResult()
223 bw.write(temp_node.getY_pos() - temp_node.getY_pos_orig() + " \t\t"); in writeResult()
224 bw.write(temp_node.getZ_pos() - temp_node.getZ_pos_orig() + "\n"); in writeResult()
340 Node temp_node; in writeResultParallel() local
369 if (temp_node.getNumber() >= 0 && !temp_node.isDeActivated()) { in writeResultParallel()
371 bw.write(temp_node.getX_pos() - temp_node.getX_pos_orig() + " \t\t"); in writeResultParallel()
372 bw.write(temp_node.getY_pos() - temp_node.getY_pos_orig() + " \t\t"); in writeResultParallel()
[all …]
H A DFembicWriter.java136 Node temp_node; in write() local
147 temp_node = (Node)this.nodelist.elementAt(k); in write()
148 if (temp_node.getNumber() >= 0) { in write()
149 bw.write(temp_node.getNumber() + " \t"); in write()
150 bw.write(" x = " + temp_node.getX_pos_orig() + " \t"); in write()
151 bw.write(" y = " + temp_node.getY_pos_orig() + " \t"); in write()
152 bw.write(" z = " + temp_node.getZ_pos_orig() + " \t"); in write()
153 …if (temp_node.getConstraint() != null) bw.write(" constraint = " + temp_node.getConstraint().getNa… in write()
154 … if (temp_node.getLoad() != null) bw.write(" load = " + temp_node.getLoad().getName() + "\t"); in write()
/dports/science/conduit/conduit-0.8.0/src/tests/conduit/
H A Dt_conduit_node_to_array.cpp81 Node temp_node; in TEST() local
82 convert_to_uint8_array(type_node, temp_node); in TEST()
83 EXPECT_FALSE(memcmp(temp_node.data_ptr(), data_node.data_ptr(), in TEST()
112 Node temp_node; in TEST() local
113 convert_to_uint8_array(to_node, temp_node); in TEST()
114 EXPECT_FALSE(memcmp(temp_node.data_ptr(), data_node.data_ptr(), in TEST()
/dports/cad/impact/Impact/src/run/
H A DModelSmp.java91 Node temp_node; in assembleMassMatrix() local
128 temp_node.determineMassMatrix(); in assembleMassMatrix()
382 Node temp_node; in setInitialConditions() local
394 temp_node = (Node) nodelist.elementAt(i); in setInitialConditions()
395 temp_node.setInitialConditions(); in setInitialConditions()
412 temp_node = (Node) nodelist.elementAt(j); in setInitialConditions()
428 temp_node = (Node) nodelist.firstElement(); in setInitialConditions()
430 while (temp_node.getLeft_neighbour() != null) in setInitialConditions()
431 temp_node = temp_node.getLeft_neighbour(); in setInitialConditions()
436 temp_node = temp_node.getRight_neighbour(); in setInitialConditions()
[all …]
/dports/math/fricas/fricas-1.3.7/src/hyper/
H A Dmem.c148 TextNode *temp_node; in alloc_node() local
151 temp_node->type = 0; in alloc_node()
152 temp_node->space = 0; in alloc_node()
153 temp_node->height = 0; in alloc_node()
154 temp_node->width = 0; in alloc_node()
155 temp_node->x = -1; in alloc_node()
156 temp_node->y = -1; in alloc_node()
158 temp_node->next = NULL; in alloc_node()
159 temp_node->link = NULL; in alloc_node()
160 temp_node->image.pm = 0; in alloc_node()
[all …]
/dports/science/InsightToolkit/ITK-5.0.1/Modules/Filtering/FastMarching/include/
H A DitkFastMarchingExtensionImageFilterBase.hxx237 InternalNodeStructure temp_node; in UpdateValue() local
262 temp_node = NodesUsed[j]; in UpdateValue()
264 if ( outputPixel < temp_node.m_Value ) in UpdateValue()
269 auxVal = this->m_AuxImages[k]->GetPixel( temp_node.m_Node ); in UpdateValue()
270 numer += auxVal * ( outputPixel - temp_node.m_Value ); in UpdateValue()
271 denom += outputPixel - temp_node.m_Value; in UpdateValue()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc9/gcc-9.4.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gnat_util/gcc-6-20180516/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/devel/avr-gcc/gcc-10.2.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc10/gcc-10.3.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]
/dports/lang/gcc8/gcc-8.5.0/gcc/cp/
H A Dvtable-class-hierarchy.c411 struct vtv_graph_node *temp_node = in vtv_compute_class_hierarchy_transitive_closure() local
414 gcc_assert (temp_node != NULL); in vtv_compute_class_hierarchy_transitive_closure()
415 temp_node->descendants = sbitmap_alloc (num_vtable_map_nodes); in vtv_compute_class_hierarchy_transitive_closure()
416 bitmap_clear (temp_node->descendants); in vtv_compute_class_hierarchy_transitive_closure()
417 bitmap_set_bit (temp_node->descendants, temp_node->class_uid); in vtv_compute_class_hierarchy_transitive_closure()
418 for (i = 0; i < (temp_node->children).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
419 bitmap_ior (temp_node->descendants, temp_node->descendants, in vtv_compute_class_hierarchy_transitive_closure()
420 temp_node->children[i]->descendants); in vtv_compute_class_hierarchy_transitive_closure()
421 for (i = 0; i < (temp_node->parents).length(); ++i) in vtv_compute_class_hierarchy_transitive_closure()
423 temp_node->parents[i]->num_processed_children = in vtv_compute_class_hierarchy_transitive_closure()
[all …]

1234567