/dports/java/openjdk11/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk11-jre/jdk11u-jdk-11.0.13-8-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk13/jdk13u-jdk-13.0.10-1-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk12/openjdk-jdk12u-jdk-12.0.2-10-4/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk16/jdk16u-jdk-16.0.2-7-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk17/jdk17u-jdk-17.0.1-12-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk15/jdk15u-jdk-15.0.6-1-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk14/jdk14u-jdk-14.0.2-12-1/src/hotspot/share/opto/ |
H A D | domgraph.cpp | 74 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 75 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 408 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 469 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 483 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 513 int dfsnum = 1; in DFS() local 520 NTarjan *w = &ntarjan[dfsnum]; in DFS() 525 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 526 w->_semi = dfsnum; // Node to DFS map in DFS() 542 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk8/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/ |
H A D | domgraph.cpp | 73 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 74 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 406 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 467 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 481 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 511 int dfsnum = 1; in DFS() local 518 NTarjan *w = &ntarjan[dfsnum]; in DFS() 523 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 524 w->_semi = dfsnum; // Node to DFS map in DFS() 540 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/java/openjdk8-jre/jdk8u-jdk8u312-b07.1/hotspot/src/share/vm/opto/ |
H A D | domgraph.cpp | 73 uint dfsnum = do_DFS(tarjan, number_of_blocks()); in build_dominator_tree() local 74 if (dfsnum - 1 != number_of_blocks()) { // Check for unreachable loops! in build_dominator_tree() 406 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder); in Dominators() local 467 for( i=2; i < dfsnum; i++ ) { // DFS order in Dominators() 481 for( i=1; i<dfsnum; i++ ) { // For all Tarjan vertices in Dominators() 511 int dfsnum = 1; in DFS() local 518 NTarjan *w = &ntarjan[dfsnum]; in DFS() 523 dfsorder[b->_idx] = dfsnum; // Save DFS order info in DFS() 524 w->_semi = dfsnum; // Node to DFS map in DFS() 540 dfsnum++; // update after parent's dfsnum has been cached. in DFS() [all …]
|
/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
H A D | dominance.c | 106 unsigned int dfsnum; member 170 di->dfsnum = 1; in init_dom_info() 321 di->dfs_to_bb[di->dfsnum] = begin; in calc_dfs_tree() 322 di->dfsnum++; in calc_dfs_tree() 350 di->dfs_order[b->index] = di->dfsnum; in calc_dfs_tree() 351 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 353 di->dfsnum++; in calc_dfs_tree() 364 di->dfs_order[b->index] = di->dfsnum; in calc_dfs_tree() 365 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 367 di->dfsnum++; in calc_dfs_tree() [all …]
|
H A D | cfganal.c | 723 int dfsnum = 0; in flow_depth_first_order_compute() local 758 dfs_order[dfsnum] = dest->index; in flow_depth_first_order_compute() 760 dfsnum++; in flow_depth_first_order_compute() 790 gcc_assert (dfsnum == n_basic_blocks); in flow_depth_first_order_compute() 792 return dfsnum; in flow_depth_first_order_compute()
|
/dports/math/jacop/jacop-4.8.0/src/main/java/org/jacop/constraints/ |
H A D | Alldistinct.java | 1237 dfsnum.put(x, nInteger); in revisitTarjan() 1270 if (dfsnum.get(v) == null) { in revisitTarjan() 1283 int dfsnumv = dfsnum.get(v); in revisitTarjan() 1287 if (dfsnumv < dfsnum.get(x)) in revisitTarjan() 1302 if (lowx == dfsnum.get(x)) { in revisitTarjan() 1370 dfsnum.put(x, vnInteger); in visitTarjan() 1403 if (dfsnum.get(v) == null) { in visitTarjan() 1405 visitTarjan(v, l, dfsnum, low); in visitTarjan() 1418 int dfsnumv = dfsnum.get(v); in visitTarjan() 1422 if (dfsnumv < dfsnum.get(x)) in visitTarjan() [all …]
|
/dports/math/spot/spot-2.10.2/spot/mc/ |
H A D | lpar13.hh | 188 bool push_state(product_state, unsigned dfsnum, acc_cond::mark_t cond) in push_state() argument 190 uf_.makeset(dfsnum); in push_state() 191 roots_.push_back({dfsnum, cond, {}}); in push_state() 205 if (top_dfsnum == roots_.back().dfsnum) in pop_state() 224 while (!uf_.sameset(dst_dfsnum, roots_.back().dfsnum)) in update() 228 uf_.unite(dst_dfsnum, el.dfsnum); in update() 418 unsigned dfsnum; member
|
/dports/math/py-spot/spot-2.10.2/spot/mc/ |
H A D | lpar13.hh | 188 bool push_state(product_state, unsigned dfsnum, acc_cond::mark_t cond) in push_state() argument 190 uf_.makeset(dfsnum); in push_state() 191 roots_.push_back({dfsnum, cond, {}}); in push_state() 205 if (top_dfsnum == roots_.back().dfsnum) in pop_state() 224 while (!uf_.sameset(dst_dfsnum, roots_.back().dfsnum)) in update() 228 uf_.unite(dst_dfsnum, el.dfsnum); in update() 418 unsigned dfsnum; member
|
/dports/devel/zpu-gcc/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
H A D | dominance.c | 105 unsigned int dfsnum; member 162 di->dfsnum = 1; in init_dom_info() 272 child_i = di->dfs_order[bn->index] = di->dfsnum++; in calc_dfs_tree_nonrec() 312 di->dfs_order[last_basic_block] = di->dfsnum; in calc_dfs_tree() 313 di->dfs_to_bb[di->dfsnum] = begin; in calc_dfs_tree() 314 di->dfsnum++; in calc_dfs_tree() 329 di->dfs_order[b->index] = di->dfsnum; in calc_dfs_tree() 330 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 331 di->dfsnum++; in calc_dfs_tree() 336 di->nodes = di->dfsnum - 1; in calc_dfs_tree()
|
H A D | cfganal.c | 814 int dfsnum = 0; in flow_depth_first_order_compute() local 849 dfs_order[dfsnum] = dest->index; in flow_depth_first_order_compute() 851 dfsnum++; in flow_depth_first_order_compute() 882 if (dfsnum > n_basic_blocks) in flow_depth_first_order_compute() 886 if (dfsnum < n_basic_blocks) in flow_depth_first_order_compute() 889 return dfsnum; in flow_depth_first_order_compute()
|
/dports/devel/zpu-binutils/zpu-toolchain-1.0/toolchain/gcc/gcc/ |
H A D | dominance.c | 105 unsigned int dfsnum; member 162 di->dfsnum = 1; in init_dom_info() 272 child_i = di->dfs_order[bn->index] = di->dfsnum++; in calc_dfs_tree_nonrec() 312 di->dfs_order[last_basic_block] = di->dfsnum; in calc_dfs_tree() 313 di->dfs_to_bb[di->dfsnum] = begin; in calc_dfs_tree() 314 di->dfsnum++; in calc_dfs_tree() 329 di->dfs_order[b->index] = di->dfsnum; in calc_dfs_tree() 330 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 331 di->dfsnum++; in calc_dfs_tree() 336 di->nodes = di->dfsnum - 1; in calc_dfs_tree()
|
H A D | cfganal.c | 814 int dfsnum = 0; in flow_depth_first_order_compute() local 849 dfs_order[dfsnum] = dest->index; in flow_depth_first_order_compute() 851 dfsnum++; in flow_depth_first_order_compute() 882 if (dfsnum > n_basic_blocks) in flow_depth_first_order_compute() 886 if (dfsnum < n_basic_blocks) in flow_depth_first_order_compute() 889 return dfsnum; in flow_depth_first_order_compute()
|
/dports/security/signing-party/signing-party-8f6c9d59d8edbb08dade7bac06417fce07626f7f/keyanalyze/ |
H A D | keyanalyze.c | 387 int dfsnum[MAXKEYS]; variable 397 dfsnum[id] = lownum[id] = ++lastdfsnum; in DFSVisit() 406 if (!dfsnum[neighbor]) { in DFSVisit() 411 } else if (dfsnum[neighbor] < lownum[id]) in DFSVisit() 412 lownum[id] = dfsnum[neighbor]; in DFSVisit() 415 if (lownum[id] == dfsnum[id]) { in DFSVisit() 442 if (!dfsnum[i]) in TestConnectivity()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
H A D | dominance.c | 105 unsigned int dfsnum; member 166 di->dfsnum = 1; in init_dom_info() 340 di->dfs_to_bb[di->dfsnum] = begin; in calc_dfs_tree() 341 di->dfsnum++; in calc_dfs_tree() 370 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 371 di->dfs_parent[di->dfsnum] = in calc_dfs_tree() 373 di->dfsnum++; in calc_dfs_tree() 388 di->dfs_to_bb[di->dfsnum] = b2; in calc_dfs_tree() 389 di->dfs_parent[di->dfsnum] = in calc_dfs_tree() 391 di->dfsnum++; in calc_dfs_tree() [all …]
|
/dports/lang/gcc48/gcc-4.8.5/gcc/ |
H A D | dominance.c | 105 unsigned int dfsnum; member 165 di->dfsnum = 1; in init_dom_info() 338 di->dfs_to_bb[di->dfsnum] = begin; in calc_dfs_tree() 339 di->dfsnum++; in calc_dfs_tree() 367 di->dfs_order[b->index] = di->dfsnum; in calc_dfs_tree() 368 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 370 di->dfsnum++; in calc_dfs_tree() 384 di->dfs_order[b2->index] = di->dfsnum; in calc_dfs_tree() 385 di->dfs_to_bb[di->dfsnum] = b2; in calc_dfs_tree() 387 di->dfsnum++; in calc_dfs_tree() [all …]
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
H A D | dominance.c | 105 unsigned int dfsnum; member 165 di->dfsnum = 1; in init_dom_info() 338 di->dfs_to_bb[di->dfsnum] = begin; in calc_dfs_tree() 339 di->dfsnum++; in calc_dfs_tree() 367 di->dfs_order[b->index] = di->dfsnum; in calc_dfs_tree() 368 di->dfs_to_bb[di->dfsnum] = b; in calc_dfs_tree() 370 di->dfsnum++; in calc_dfs_tree() 384 di->dfs_order[b2->index] = di->dfsnum; in calc_dfs_tree() 385 di->dfs_to_bb[di->dfsnum] = b2; in calc_dfs_tree() 387 di->dfsnum++; in calc_dfs_tree() [all …]
|
/dports/math/maxima/maxima-5.43.2/share/graphs/ |
H A D | matching.lisp | 202 (dfsnum) 217 (setq dfsnum (make-hash-table)) 240 (when (null (gethash v-main dfsnum)) 241 (setf (gethash v-main dfsnum) dfsnum-curr) 267 (if (> (gethash w-main dfsnum) 268 (gethash v-main dfsnum))
|
/dports/lang/gcc48/gcc-4.8.5/gcc/lto/ |
H A D | lto.c | 356 unsigned int dfsnum; member 544 if (cstate->dfsnum < state->dfsnum in gtc_visit() 546 state->low = MIN (cstate->dfsnum, state->low); in gtc_visit() 571 state->dfsnum = gtc_next_dfs_num++; in gimple_types_compatible_p_1() 572 state->low = state->dfsnum; in gimple_types_compatible_p_1() 849 if (state->low == state->dfsnum) in gimple_types_compatible_p_1() 1022 if (cstate->dfsnum < state->dfsnum in visit() 1024 state->low = MIN (cstate->dfsnum, state->low); in visit() 1096 state->dfsnum = next_dfs_num++; in iterative_hash_gimple_type() 1097 state->low = state->dfsnum; in iterative_hash_gimple_type() [all …]
|