/dports/security/py-angr/angr-9.0.5405/angr/analyses/ |
H A D | loopfinder.py | 104 for subloop in tops: 105 if subloop.entry in loop_body_nodes: 110 for entry_edge in subloop.entry_edges: 115 subg.add_edge(removed_entries[entry_edge], subloop) 123 subg.add_edge(entry_edge[0], subloop) 124 removed_entries[entry_edge] = subloop 125 for exit_edge in subloop.break_edges: 130 subg.add_edge(subloop, removed_entries[exit_edge]) 138 subg.add_edge(subloop, exit_edge[1]) 139 removed_exits[exit_edge] = subloop
|
/dports/games/doomsday/doomsday-2.3.1/doomsday/sdk/libshell/src/ |
H A D | dialogwidget.cpp | 28 QEventLoop subloop; in DENG2_PIMPL_NOREF() local 63 int result = d->subloop.exec(); in exec() 100 if (d->subloop.isRunning()) in accept() 102 d->subloop.exit(result); in accept() 109 if (d->subloop.isRunning()) in reject() 111 d->subloop.exit(result); in reject()
|
/dports/cad/gmsh/gmsh-4.9.2-source/contrib/hxt/tetBR/src/ |
H A D | hxt_boundary_recovery.cxx | 468 face subloop; in reconstructmesh() local 469 subloop.shver = 0; in reconstructmesh() 471 subloop.sh = shellfacetraverse(subfaces); in reconstructmesh() 472 while (subloop.sh != NULL) { in reconstructmesh() 480 face subloop; in reconstructmesh() local 486 subloop.shver = 0; in reconstructmesh() 488 subloop.sh = shellfacetraverse(subfaces); in reconstructmesh() 490 while (subloop.sh != NULL) { in reconstructmesh() 491 p[0] = sorg(subloop); in reconstructmesh() 492 p[1] = sdest(subloop); in reconstructmesh() [all …]
|
/dports/devel/lua-cqueues/cqueues-rel-20200726/regress/ |
H A D | 85-cancel-issues.lua | 17 local subloop = check(cqueues.new()) 19 subloop:wrap(function () 33 check(subloop:loop())
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc8/gcc-8.5.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
H A D | gimple-loop-jam.c | 110 class loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
H A D | gimple-loop-versioning.cc | 1620 for (class loop *subloop = loop->inner; subloop; subloop = subloop->next) in decide_whether_loop_is_versionable() local 1621 merge_loop_info (loop, subloop); in decide_whether_loop_is_versionable() 1651 for (class loop *subloop = loop->inner; subloop; in make_versioning_decisions() local 1652 subloop = subloop->next) in make_versioning_decisions() 1653 if (get_loop_info (subloop).worth_versioning_p ()) in make_versioning_decisions() 1654 add_loop_to_queue (subloop); in make_versioning_decisions()
|
/dports/lang/gcc9/gcc-9.4.0/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
H A D | gimple-loop-versioning.cc | 1632 for (struct loop *subloop = loop->inner; subloop; subloop = subloop->next) in decide_whether_loop_is_versionable() local 1633 merge_loop_info (loop, subloop); in decide_whether_loop_is_versionable() 1664 for (struct loop *subloop = loop->inner; subloop; in make_versioning_decisions() local 1665 subloop = subloop->next) in make_versioning_decisions() 1666 if (get_loop_info (subloop).worth_versioning_p ()) in make_versioning_decisions() 1667 add_loop_to_queue (subloop); in make_versioning_decisions()
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
H A D | gimple-loop-jam.c | 109 class loop *subloop; in merge_loop_tree() local 132 subloop = bbs[i]->loop_father; in merge_loop_tree() 133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 135 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 136 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
H A D | gimple-loop-versioning.cc | 1639 for (class loop *subloop = loop->inner; subloop; subloop = subloop->next) in decide_whether_loop_is_versionable() local 1640 merge_loop_info (loop, subloop); in decide_whether_loop_is_versionable() 1671 for (class loop *subloop = loop->inner; subloop; in make_versioning_decisions() local 1672 subloop = subloop->next) in make_versioning_decisions() 1673 if (get_loop_info (subloop).worth_versioning_p ()) in make_versioning_decisions() 1674 add_loop_to_queue (subloop); in make_versioning_decisions()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
H A D | gimple-loop-jam.c | 109 class loop *subloop; in merge_loop_tree() local 132 subloop = bbs[i]->loop_father; in merge_loop_tree() 133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 135 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 136 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
H A D | gimple-loop-jam.c | 109 class loop *subloop; in merge_loop_tree() local 132 subloop = bbs[i]->loop_father; in merge_loop_tree() 133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 135 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 136 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
H A D | gimple-loop-jam.c | 109 class loop *subloop; in merge_loop_tree() local 132 subloop = bbs[i]->loop_father; in merge_loop_tree() 133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 135 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 136 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc10/gcc-10.3.0/gcc/ |
H A D | gimple-loop-jam.c | 109 class loop *subloop; in merge_loop_tree() local 132 subloop = bbs[i]->loop_father; in merge_loop_tree() 133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 135 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 136 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
H A D | gimple-loop-jam.c | 110 struct loop *subloop; in merge_loop_tree() local 133 subloop = bbs[i]->loop_father; in merge_loop_tree() 134 if (loop_outer (subloop) == old && subloop->header == bbs[i]) in merge_loop_tree() 136 flow_loop_tree_node_remove (subloop); in merge_loop_tree() 137 flow_loop_tree_node_add (loop, subloop); in merge_loop_tree()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/ |
H A D | gimple-loop-jam.c | 109 class loop *subloop; 132 subloop = bbs[i]->loop_father; 133 if (loop_outer (subloop) == old && subloop->header == bbs[i]) 135 flow_loop_tree_node_remove (subloop); 136 flow_loop_tree_node_add (loop, subloop);
|
/dports/math/gap/gap-4.11.0/pkg/loops-3.4.1/gap/ |
H A D | core_methods.gi | 462 return SubquasigroupNC( Q, [1] ); # trivial subloop 494 ## the trivial subloop of <L>. 519 ## Returns true if <S> is a subloop of a loop <L>. 625 Error( "LOOPS: <2> must be a subloop of <1>" ); 642 ## Returns a right transversal for the subloop S of loop L. 777 ## Returns the associator subloop of the loop <L>, i.e., the subloop of <L> 816 ## Returns true if <S> is a normal subloop of loop <L>. 824 Error( "LOOPS: <2> must be a subloop of <1>." ); 844 Error( "LOOPS: <2> must be a subloop of <1>." ); 1060 ## Returns the derived subloop of <L>. [all …]
|
H A D | moufang_modifications.gi | 99 # S is a normal subloop of L, or a set generating a normal subloop of L, 109 # making sure that S is a subloop of L 159 # S is a normal subloop of L, or a set generating a normal subloop of L, 171 # making sure that S is a subloop of L
|