| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1331 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | mcf.c | 114 int new_entry_index; member
162 else if (n == fixup_graph->new_entry_index) in print_basic_block()
463 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
587 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
605 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
790 int new_entry_index; in cancel_negative_cycle() local
797 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
816 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
839 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1325 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1331 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | mcf.c | 114 int new_entry_index; member
162 else if (n == fixup_graph->new_entry_index) in print_basic_block()
463 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
587 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
605 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
790 int new_entry_index; in cancel_negative_cycle() local
797 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
816 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
839 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1325 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | mcf.c | 113 int new_entry_index; member
161 else if (n == fixup_graph->new_entry_index) in print_basic_block()
462 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
590 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
608 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
793 int new_entry_index; in cancel_negative_cycle() local
800 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
819 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
842 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1314 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | mcf.c | 114 int new_entry_index; member
162 else if (n == fixup_graph->new_entry_index) in print_basic_block()
463 int new_entry_index = 0, new_exit_index = 0; in create_fixup_graph() local
591 new_entry_index = fixup_graph->new_entry_index = fixup_graph->num_vertices; in create_fixup_graph()
609 for (i = 4; i < new_entry_index; i += 2) in create_fixup_graph()
794 int new_entry_index; in cancel_negative_cycle() local
801 new_entry_index = fixup_graph->new_entry_index; in cancel_negative_cycle()
820 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
843 if (pfedge->src == new_entry_index) in cancel_negative_cycle()
1332 int new_entry_index; in find_minimum_cost_flow() local
[all …]
|
| /dports/www/qt5-webengine/qtwebengine-everywhere-src-5.15.2/src/3rdparty/chromium/third_party/blink/renderer/platform/wtf/ |
| H A D | vector_backed_linked_list.h | 515 wtf_size_t new_entry_index;
517 new_entry_index = nodes_.size();
521 new_entry_index = free_head_index_;
527 nodes_[prev_index].next_index_ = new_entry_index;
528 nodes_[position_index].prev_index_ = new_entry_index;
530 return iterator(new_entry_index, this);
|
| /dports/devel/libdwarf/dwarf-20161124/tsearch/ |
| H A D | dwarf_tsearchhash.c | 322 unsigned new_entry_index = 0; in resize_table() local
330 new_entry_index = head->tablesize_entry_index_ +1; in resize_table()
331 prime_to_use = primes[new_entry_index]; in resize_table()
344 newhead.tablesize_entry_index_ = new_entry_index; in resize_table()
|
| /dports/devel/dwarfdump/dwarf-20161124/tsearch/ |
| H A D | dwarf_tsearchhash.c | 322 unsigned new_entry_index = 0; in resize_table() local
330 new_entry_index = head->tablesize_entry_index_ +1; in resize_table()
331 prime_to_use = primes[new_entry_index]; in resize_table()
344 newhead.tablesize_entry_index_ = new_entry_index; in resize_table()
|
| /dports/devel/dwarfdump/dwarf-20161124/libdwarf/ |
| H A D | dwarf_tsearchhash.c | 322 unsigned new_entry_index = 0; in resize_table() local
330 new_entry_index = head->tablesize_entry_index_ +1; in resize_table()
331 prime_to_use = primes[new_entry_index]; in resize_table()
344 newhead.tablesize_entry_index_ = new_entry_index; in resize_table()
|