| /dports/cad/tochnog/Sources/Tochnog-Latest-jan-2014/ |
| H A D | renumber.cc | 23 long int lowest_node, long int old_node_numbers[], in renumbering() argument
43 tmp_node_number = lowest_node; in renumbering()
|
| /dports/multimedia/v4l_compat/linux-5.13-rc2/fs/ocfs2/cluster/ |
| H A D | heartbeat.c | 1078 int i, ret, highest_node, lowest_node; in o2hb_do_disk_heartbeat() local
1103 lowest_node = o2hb_lowest_node(configured_nodes, O2NM_MAX_NODES); in o2hb_do_disk_heartbeat()
1104 if (highest_node >= O2NM_MAX_NODES || lowest_node >= O2NM_MAX_NODES) { in o2hb_do_disk_heartbeat()
1114 ret = o2hb_read_slots(reg, lowest_node, highest_node + 1); in o2hb_do_disk_heartbeat()
|
| /dports/multimedia/libv4l/linux-5.13-rc2/fs/ocfs2/cluster/ |
| H A D | heartbeat.c | 1078 int i, ret, highest_node, lowest_node; in o2hb_do_disk_heartbeat() local
1103 lowest_node = o2hb_lowest_node(configured_nodes, O2NM_MAX_NODES); in o2hb_do_disk_heartbeat()
1104 if (highest_node >= O2NM_MAX_NODES || lowest_node >= O2NM_MAX_NODES) { in o2hb_do_disk_heartbeat()
1114 ret = o2hb_read_slots(reg, lowest_node, highest_node + 1); in o2hb_do_disk_heartbeat()
|
| /dports/multimedia/v4l-utils/linux-5.13-rc2/fs/ocfs2/cluster/ |
| H A D | heartbeat.c | 1078 int i, ret, highest_node, lowest_node; in o2hb_do_disk_heartbeat() local
1103 lowest_node = o2hb_lowest_node(configured_nodes, O2NM_MAX_NODES); in o2hb_do_disk_heartbeat()
1104 if (highest_node >= O2NM_MAX_NODES || lowest_node >= O2NM_MAX_NODES) { in o2hb_do_disk_heartbeat()
1114 ret = o2hb_read_slots(reg, lowest_node, highest_node + 1); in o2hb_do_disk_heartbeat()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | tree-ssa-structalias.c | 1419 unsigned int lowest_node; in scc_visit() local
1432 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1433 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1441 if (unite (lowest_node, i)) in scc_visit()
1442 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1446 unite (lowest_node, i); in scc_visit()
1447 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | tree-ssa-structalias.c | 1416 unsigned int lowest_node; in scc_visit() local
1429 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1430 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1438 if (unite (lowest_node, i)) in scc_visit()
1439 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1443 unite (lowest_node, i); in scc_visit()
1444 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | tree-ssa-structalias.c | 1439 unsigned int lowest_node; in scc_visit() local
1452 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1453 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1461 if (unite (lowest_node, i)) in scc_visit()
1462 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1466 unite (lowest_node, i); in scc_visit()
1467 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | tree-ssa-structalias.c | 1433 unsigned int lowest_node; in scc_visit() local
1446 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1447 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1455 if (unite (lowest_node, i)) in scc_visit()
1456 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1460 unite (lowest_node, i); in scc_visit()
1461 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | tree-ssa-structalias.c | 1439 unsigned int lowest_node; in scc_visit() local
1452 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1453 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1461 if (unite (lowest_node, i)) in scc_visit()
1462 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1466 unite (lowest_node, i); in scc_visit()
1467 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1452 unsigned int lowest_node; in scc_visit() local
1465 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1466 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1474 if (unite (lowest_node, i)) in scc_visit()
1475 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1479 unite (lowest_node, i); in scc_visit()
1480 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1460 unsigned int lowest_node; in scc_visit() local
1473 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1474 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1482 if (unite (lowest_node, i)) in scc_visit()
1483 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1487 unite (lowest_node, i); in scc_visit()
1488 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1452 unsigned int lowest_node; in scc_visit() local
1465 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1466 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1474 if (unite (lowest_node, i)) in scc_visit()
1475 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1479 unite (lowest_node, i); in scc_visit()
1480 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | tree-ssa-structalias.c | 1470 unsigned int lowest_node; in scc_visit() local
1483 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1484 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1492 if (unite (lowest_node, i)) in scc_visit()
1493 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1497 unite (lowest_node, i); in scc_visit()
1498 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1452 unsigned int lowest_node; in scc_visit() local
1465 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1466 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1474 if (unite (lowest_node, i)) in scc_visit()
1475 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1479 unite (lowest_node, i); in scc_visit()
1480 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1460 unsigned int lowest_node; in scc_visit() local
1473 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1474 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1482 if (unite (lowest_node, i)) in scc_visit()
1483 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1487 unite (lowest_node, i); in scc_visit()
1488 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | tree-ssa-structalias.c | 1459 unsigned int lowest_node; in scc_visit() local
1472 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1473 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1481 if (unite (lowest_node, i)) in scc_visit()
1482 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1486 unite (lowest_node, i); in scc_visit()
1487 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1452 unsigned int lowest_node; in scc_visit() local
1465 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1466 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1474 if (unite (lowest_node, i)) in scc_visit()
1475 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1479 unite (lowest_node, i); in scc_visit()
1480 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1452 unsigned int lowest_node; in scc_visit() local
1465 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1466 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1474 if (unite (lowest_node, i)) in scc_visit()
1475 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1479 unite (lowest_node, i); in scc_visit()
1480 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1470 unsigned int lowest_node; in scc_visit() local
1483 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1484 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1492 if (unite (lowest_node, i)) in scc_visit()
1493 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1497 unite (lowest_node, i); in scc_visit()
1498 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1452 unsigned int lowest_node; in scc_visit() local
1465 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1466 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1474 if (unite (lowest_node, i)) in scc_visit()
1475 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1479 unite (lowest_node, i); in scc_visit()
1480 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1470 unsigned int lowest_node; in scc_visit() local
1483 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1484 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1492 if (unite (lowest_node, i)) in scc_visit()
1493 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1497 unite (lowest_node, i); in scc_visit()
1498 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | tree-ssa-structalias.c | 1460 unsigned int lowest_node;
1473 lowest_node = bitmap_first_set_bit (scc);
1474 gcc_assert (lowest_node < FIRST_REF_NODE);
1482 if (unite (lowest_node, i))
1483 unify_nodes (graph, lowest_node, i, false);
1487 unite (lowest_node, i);
1488 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node;
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1459 unsigned int lowest_node; in scc_visit() local
1472 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1473 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1481 if (unite (lowest_node, i)) in scc_visit()
1482 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1486 unite (lowest_node, i); in scc_visit()
1487 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
| H A D | tree-ssa-structalias.c | 1459 unsigned int lowest_node; in scc_visit() local
1472 lowest_node = bitmap_first_set_bit (scc); in scc_visit()
1473 gcc_assert (lowest_node < FIRST_REF_NODE); in scc_visit()
1481 if (unite (lowest_node, i)) in scc_visit()
1482 unify_nodes (graph, lowest_node, i, false); in scc_visit()
1486 unite (lowest_node, i); in scc_visit()
1487 graph->indirect_cycles[i - FIRST_REF_NODE] = lowest_node; in scc_visit()
|
| /dports/science/afni/afni-AFNI_21.3.16/src/SUMA/ |
| H A D | SUMA_GeomComp.h | 50 int lowest_node; member
|