| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | tree-ssa-loop.h | 67 extern bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
|
| H A D | tree-ssa-phiprop.c | 373 if (! for_each_index (gimple_assign_lhs_ptr (use_stmt), in propagate_with_phi()
|
| H A D | tree-ssa-loop.c | 586 for_each_index (tree *addr_p, bool (*cbck) (tree, tree *, void *), void *data) in for_each_index() function
|
| H A D | tree-ssa-dse.c | 787 && !for_each_index (ref->ref ? &ref->ref : &ref->base, in dse_classify_store()
|
| H A D | tree-ssa-loop-im.c | 2093 for_each_index (&ref->mem.ref, force_move_till, &fmt_data); in execute_sm()
2354 || !for_each_index (&ref->mem.ref, may_move_till, loop)) in can_sm_ref_p()
|
| H A D | tree-ssa-loop-prefetch.c | 529 return for_each_index (base, idx_analyze_ref, &ar_data); in analyze_ref()
|
| H A D | tree-if-conv.c | 828 return for_each_index (&ref, idx_within_array_bound, loop); in ref_within_array_bound()
|
| H A D | tree-ssa-loop-ivopts.c | 2366 if (!for_each_index (&base, idx_find_step, &ifs_ivopts_data) in find_interesting_uses_address()
2410 for_each_index (op_p, idx_record_use, data); in find_interesting_uses_address()
|
| H A D | tree-ssa-loop-niter.c | 3693 for_each_index (&ref, idx_infer_loop_bounds, &data); in infer_loop_bounds_from_ref()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | tree-ssa-loop.h | 67 extern bool for_each_index (tree *, bool (*) (tree, tree *, void *), void *);
|
| H A D | tree-ssa-loop.cc | 533 for_each_index (tree *addr_p, bool (*cbck) (tree, tree *, void *), void *data) in for_each_index() function
|
| H A D | tree-ssa-phiprop.cc | 373 if (! for_each_index (gimple_assign_lhs_ptr (use_stmt), in propagate_with_phi()
|
| H A D | tree-ssa-dse.cc | 978 && !for_each_index (ref->ref ? &ref->ref : &ref->base, in dse_classify_store()
|
| H A D | tree-ssa-loop-prefetch.cc | 529 return for_each_index (base, idx_analyze_ref, &ar_data); in analyze_ref()
|
| H A D | tree-ssa-loop-im.cc | 2245 for_each_index (&ref->mem.ref, force_move_till, &fmt_data); in execute_sm()
3162 || !for_each_index (&ref->mem.ref, may_move_till, loop)) in can_sm_ref_p()
|
| H A D | tree-if-conv.cc | 835 return for_each_index (&ref, idx_within_array_bound, loop); in ref_within_array_bound()
|
| H A D | tree-ssa-loop-ivopts.cc | 2367 if (!for_each_index (&base, idx_find_step, &ifs_ivopts_data) in find_interesting_uses_address()
2411 for_each_index (op_p, idx_record_use, data); in find_interesting_uses_address()
|
| H A D | tree-ssa-loop-niter.cc | 3815 for_each_index (&ref, idx_infer_loop_bounds, &data); in infer_loop_bounds_from_ref()
|
| H A D | ChangeLog.graphite | 58 (close_phi_written_to_memory): Call for_each_index with
|
| H A D | ChangeLog-2005 | 8132 * tree-ssa-loop-im.c (for_each_index): Handle INTEGER_CST
14658 * tree-ssa-loop-im.c (for_each_index): Handle COMPLEX_CST.
15766 * tree-ssa-loop-im.c (for_each_index): Ditto.
16861 * tree-ssa-loop-im.c (for_each_index): Handle VECTOR_CST.
|
| H A D | ChangeLog-2004 | 11211 * tree-ssa-loop-im.c (for_each_index): Call callback for component_refs
11545 * tree-ssa-loop-im.c (for_each_index, is_call_clobbered_ref): Likewise.
14049 * tree-ssa-loop-im.c (for_each_index, set_level,
15104 * tree-ssa-loop-im.c (for_each_index): Handle REALPART_EXPR and
24175 (loop_commit_inserts, for_each_index, tree_ssa_lim): Declare.
|
| H A D | ChangeLog-2010 | 15160 * tree-ssa-loop-im.c (for_each_index): Likewise.
15524 * tree-ssa-loop-im.c (for_each_index): Handle TMR_INDEX2.
22822 * tree-ssa-loop-im.c (for_each_index): Do not handle
23674 * tree-ssa-loop-im.c (for_each_index): Handle MEM_REF.
|
| H A D | ChangeLog-2008 | 24927 * tree-ssa-loop-im.c (for_each_index): Handle invariant
28196 * tree-ssa-loop-im.c (for_each_index): Handle CONSTRUCTOR
|
| H A D | ChangeLog-2013 | 15827 * tree-ssa-loop-im.c (for_each_index): Move to tree-ssa-loop.c.
15875 (for_each_index, lsm_tmp_name_add, gen_lsm_tmp_name): Relocate from
|
| H A D | ChangeLog-2006 | 11076 * tree-ssa-loop-im.c (for_each_index): Handle ARRAY_RANGE_REF as
|