/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/petgraph-0.5.1/ |
H A D | README.rst | 166 - Add new algorithm ``simple_fast`` for computing dominators in a control-flow
|
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/petgraph-0.5.1/src/algo/ |
H A D | dominators.rs | 28 dominators: HashMap<N, N>, field 48 self.dominators.get(&node).cloned() in immediate_dominator() 57 if self.dominators.contains_key(&node) { in strict_dominators() 59 dominators: self, in strict_dominators() 73 if self.dominators.contains_key(&node) { in dominators() 75 dominators: self, in dominators() 89 dominators: &'a Dominators<N>, field 149 dominators[length - 1] = length - 1; in simple_fast() 180 if new_idom_idx != dominators[idx] { in simple_fast() 181 dominators[idx] = new_idom_idx; in simple_fast() [all …]
|
H A D | mod.rs | 7 pub mod dominators;
|
/dports/audio/ncspot/ncspot-0.9.3/cargo-crates/petgraph-0.5.1/tests/ |
H A D | graph.rs | 12 dominators, has_path_connecting, is_bipartite_undirected, is_cyclic_undirected, 2291 let doms = dominators::simple_fast(&graph, r); in test_dominators_simple_fast() 2363 let doms = dominators::simple_fast(&graph, r); in test_dominators_simple_fast()
|
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/WebCore/ |
H A D | ChangeLog | 24444 … inspector/profiler/detailed-heapshots-dominators-expansion-preserved-when-sorting.html 24445 inspector/profiler/detailed-heapshots-dominators-show-all.html 24446 inspector/profiler/detailed-heapshots-dominators-show-next.html 24447 … inspector/profiler/detailed-heapshots-dominators-shown-node-count-preserved-when-sorting.html 24448 inspector/profiler/detailed-heapshots-dominators-sorting.html
|
H A D | ChangeLog-2011-02-16 | 345 - dominators tree;
|
/dports/databases/py-pony/pony-0.7.14/pony/thirdparty/compiler/ |
H A D | pyassem.py | 123 dominators = {} 129 dominators.setdefault(b, set()) 133 dominators.setdefault(c, set()).add(b) 145 for c in dominators[b]:
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/ |
H A D | NEWS | 17800 * Lengauer and Tarjan algorithm used for computing dominators in the
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | ChangeLog-1998 | 13691 Generally clean up and comment better. Use dominators to 15318 (compute_dominators): New function to compute dominators and 15319 post dominators.
|
H A D | ChangeLog-1999 | 10097 * flow.c (compute_flow_dominators): Compute dominators using
|
H A D | ChangeLog-2000 | 3835 Don't compute dominators but only immediate dominators. 3841 dominators. 8859 (flow_loop_dump): Dump pre-header root and trace and exit dominators. 8860 (flow_loop_free): Free pre-header root and trace and exit dominators.
|
H A D | ChangeLog-2002 | 15061 (dump_flow_info): Do not dump dominators. 15063 dominators. 15078 (alloc_hoist_mem): Do not alloc dominators 18798 (flow_loops_cfg_dump): Do not show dominators, as this information
|
H A D | ChangeLog-2003 | 237 (flow_loops_free): Don't release dominators. 247 * gcse.c (dominators): Variable removed. 270 * toplev.c (rest_of_handle_branch_prob): Free the dominators.
|
H A D | ChangeLog-2004 | 12920 * tree-cfg.c (thread_jumps): Update dominators correctly in 27625 * doc/cfg.texi (Basic Blocks): Define dominators. 33465 * dominance.c: Cache immediate dominators. 41795 * cfghooks.c (split_edge): Speed up updating of dominators. 44577 * cfgloopmanip.c (remove_bbs): Do not update dominators here. 44591 find_if_case_2): Don't update dominators. 44595 * cfgloopmanip.c (split_loop_bb): Don't update dominators.
|
H A D | ChangeLog-2005 | 9679 (execute_cse_reciprocals): Compute post-dominators, if necessary. 12599 the dominators. 29654 to recompute dominators.
|
H A D | ChangeLog-2006 | 5359 (fwprop_init): Always calculate dominators. 6138 of tree_purge_dead_eh_edges as it may free dominators. 11210 Limit iteration over the dominators. 23075 Do not commit any edge insertion. Always compute dominators and
|
H A D | ChangeLog-2007 | 18924 (verify_dominators): Recompute all dominators and compare the results. 21642 * lambda-code.c (perfect_nestify): Fix updating of dominators. 22176 delete_unreachable_blocks if dominators are not available. 22186 do not invalidate dominators. 23327 dominators, post dominators and cleanup cfg before returning. 29772 * tree-cfgcleanup.c (cleanup_tree_cfg_loop): Calculate dominators
|
H A D | ChangeLog-2008 | 727 consistency of the SSA, loops and dominators information. 24641 (execute_early_warn_uninitialized): Compute post-dominators.
|
H A D | ChangeLog-2009 | 11612 dominators. 11966 (remove_edge_and_dominated_blocks): Remove dominators last. 29357 (tree_ssa_dse): Compute dominators.
|
H A D | ChangeLog-2010 | 1859 (tidy_control_flow): Also verify dominators.
|
H A D | ChangeLog-2011 | 25104 * tree-ssa-ifcombine.c (tree_ssa_ifcombine): Calculate dominators.
|
H A D | ChangeLog-2012 | 6341 blocks before computing dominators. 29662 * cfgloop.c (verify_loop_structure): Calculate or verify dominators. 31776 * cfgloop.c (verify_loop_structure): Verify dominators before 31779 dominators from here. 34690 (consider_split): Check for forbidden dominators. 34692 dominators info; call check_forbidden_calls.
|
H A D | ChangeLog-2013 | 21533 (if_convertible_loop_p_1): Do not compute post-dominators. 21534 (combine_blocks): Do not free post-dominators.
|
H A D | ChangeLog-2014 | 45922 (tree_ssa_phiprop): Calculate and free post-dominators.
|
H A D | ChangeLog-2015 | 1415 * cfgrtl.c (cfg_layout_finalize): Free dominators. 14908 (canonicalize_loop_closed_ssa): Recompute all dominators at the end. 24411 * passes.c (execute_function_todo): Assert that post-dominators 24414 Free post-dominators. 27139 * dominance.c (calculate_dominance_info): Verify dominators if
|