HomeSort by: relevance | last modified time | path
    Searched defs:ranger (Results 1 - 10 of 10) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
gimple-range-trace.cc 131 // Query all statements in the IL to precalculate computable ranges in RANGER.
134 debug_seed_ranger (gimple_ranger &ranger)
156 ranger.range_of_stmt (r, stmt);
180 // Dump all that ranger knows for the current function.
186 gimple_ranger ranger; local
192 debug_seed_ranger (ranger);
193 ranger.dump (out);
202 // Dump all that ranger knows on a path of BBs.
216 gimple_ranger ranger; local
217 debug_seed_ranger (ranger);
    [all...]
tree-ssa-loop-ch.cc 49 Use RANGER instance. */
54 gimple_ranger &ranger)
61 return new path_range_query (ranger, path);
66 Formulate corrent ranger query to RANGER. */
69 static_loop_exit (class loop *l, basic_block bb, gimple_ranger &ranger,
99 query = get_range_query (l, gimple_bb (last), ranger);
109 Use RANGER and formulate query cached in QUERY. */
113 gimple_ranger &ranger,
122 query = get_range_query (loop, gimple_bb (stmt), ranger);
807 gimple_ranger *ranger = new gimple_ranger; local
    [all...]
tree-ssa-loop-unswitch.cc 93 both versions of the loop. We utilize both Ranger for condition
202 /* Ranger instance used in the pass. */
203 static gimple_ranger *ranger = NULL; variable
332 ranger = enable_ranger (fun);
729 /* Else try ranger if it supports LHS. */
766 if (!ranger->gori ().outgoing_edge_range_p (r, e, idx,
tree-vrp.cc 64 // This class is utilized by VRP and ranger to remove __builtin_unreachable
192 // Ranger will still reflect the proper ranges at other places in these missed
951 // This is a ranger based folder which continues to use the dominator
1050 /* Main entry point for a VRP pass using just ranger. This can be called
1063 gimple_ranger *ranger = enable_ranger (fun, false); local
1064 rvrp_folder folder (ranger, final_p);
1065 phi_analysis_initialize (ranger->const_query ());
1070 ranger->dump (dump_file);
1074 // Set all edges as executable, except those ranger says aren't.
1075 int non_exec_flag = ranger->non_executable_edge_flag
    [all...]
tree-ssa-dom.cc 762 dom_jt_simplifier (avail_exprs_stack *avails, gimple_ranger *ranger,
764 : hybrid_jt_simplifier (ranger, query), m_avails (avails) { }
780 /* Otherwise call the ranger if possible. */
793 gimple_ranger *ranger,
798 m_ranger = ranger;
928 gimple_ranger *ranger = enable_ranger (fun); local
929 path_range_query path_query (*ranger);
930 dom_jt_simplifier simplifier (avail_exprs_stack, ranger, &path_query);
936 ranger,
941 ranger->export_global_ranges ()
    [all...]
tree-vect-patterns.cc 4735 gimple_ranger ranger; local
4741 if (ranger.range_of_expr (r, oprnd0, stmt) && !r.undefined_p ())
  /src/external/gpl3/gcc.old/dist/gcc/
gimple-range-trace.cc 131 // Query all statements in the IL to precalculate computable ranges in RANGER.
134 debug_seed_ranger (gimple_ranger &ranger)
154 ranger.range_of_stmt (r, stmt);
177 // Dump all that ranger knows for the current function.
183 gimple_ranger ranger; local
189 debug_seed_ranger (ranger);
190 ranger.dump (out);
199 // Dump all that ranger knows on a path of BBs.
213 gimple_ranger ranger; local
214 debug_seed_ranger (ranger);
    [all...]
gimple-ssa-warn-alloca.cc 259 gimple_ranger *ranger = enable_ranger (fun); local
382 ranger->export_global_ranges ();
tree-vrp.cc 4245 // This is a ranger based folder which continues to use the dominator
4326 /* Main entry point for a VRP pass using just ranger. This can be called
4338 gimple_ranger *ranger = enable_ranger (fun); local
4339 rvrp_folder folder (ranger);
4341 ranger->export_global_ranges ();
4343 ranger->dump (dump_file);
4347 // Set all edges as executable, except those ranger says aren't.
4348 int non_exec_flag = ranger->non_executable_edge_flag;
4361 array_bounds_checker array_checker (fun, ranger);
  /src/sys/dev/acpi/
acpi_display.c 2004 ranger(uint8_t *a, size_t l, void (*pr)(const char *, ...) __printflike(1, 2)) function
2031 ranger(bc->bc_level, bc->bc_level_count, aprint_verbose);

Completed in 36 milliseconds