| /src/sys/external/gpl2/dts/dist/arch/arm64/boot/dts/bitmain/ |
| Makefile | 3 dtb-$(CONFIG_ARCH_BITMAIN) += bm1880-sophon-edge.dtb
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| cfghooks.h | 90 /* Redirect edge E to the given basic block B and update underlying program
91 representation. Returns edge representing redirected branch (that may not
93 if edge is not easily redirectable for whatever reason. */
94 edge (*redirect_edge_and_branch) (edge e, basic_block b);
97 newly created forwarder basic block is returned. The edge must
99 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
101 /* Returns true if it is possible to remove the edge by redirecting it
102 to the destination of the other edge going from its source. */
121 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| loop-unroll.h | 24 extern basic_block split_edge_and_insert (edge, rtx_insn *);
|
| tree-ssa-dom.h | 24 extern void record_temporary_equivalences (edge,
|
| ipa-inline.h | 48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
70 /* Return estimated size of the inline sequence of EDGE. */
73 estimate_edge_size (struct cgraph_edge *edge)
77 || (entry = edge_growth_cache->get (edge)) == NULL
79 return do_estimate_edge_size (edge);
83 /* Return lower bound on estimated callee growth after inlining EDGE. */
86 estimate_min_edge_growth (struct cgraph_edge *edge)
88 ipa_call_summary *s = ipa_call_summaries->get (edge);
[all...] |
| predict.h | 58 extern bool maybe_hot_edge_p (edge);
60 extern bool probably_never_executed_edge_p (struct function *, edge);
67 extern enum optimize_size_level optimize_edge_for_size_p (edge);
68 extern bool optimize_edge_for_speed_p (edge);
75 extern bool predictable_edge_p (edge);
77 extern void rtl_profile_for_edge (edge);
84 extern void rtl_predict_edge (edge, enum br_predictor, int);
85 extern void gimple_predict_edge (edge, enum br_predictor, int);
86 extern void remove_predictions_associated_with_edge (edge);
87 extern void predict_edge_def (edge, enum br_predictor, enum prediction)
[all...] |
| cfgloopmanip.h | 35 extern edge mfb_kj_edge;
37 extern bool remove_path (edge, bool * = NULL, bitmap = NULL);
42 extern edge create_empty_if_region_on_edge (edge, tree);
43 extern class loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
52 duplicate_loop_body_to_header_edge (class loop *, edge, unsigned, sbitmap, edge,
53 vec<edge> *, int);
54 extern bool mfb_keep_just (edge);
|
| gimple-range-edge.h | 1 /* Gimple range edge header file.
27 // For a COND_EXPR, the TRUE edge will return [1,1] and the false edge a [0,0].
34 // The API is simple, just ask for the range on the edge.
36 // edge gets the range from, along with the range.
43 gimple *edge_range_p (irange &r, edge e);
46 bool get_edge_range (irange &r, gimple *s, edge e);
49 hash_map<edge, irange *> *m_edge_table;
55 // Return the range on edge E if it is from a GCOND. Either TRUE or FALSE.
56 void gcond_edge_range (irange &r, edge e)
[all...] |
| tree-ssa.h | 34 extern void redirect_edge_var_map_add (edge, tree, tree, location_t);
35 extern void redirect_edge_var_map_clear (edge);
36 extern void redirect_edge_var_map_dup (edge, edge);
37 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge);
39 extern edge ssa_redirect_edge (edge, basic_block);
40 extern void flush_pending_stmts (edge);
|
| tree-ssa-threadupdate.h | 33 // vector as edge pairs (original_edge, target_edge).
38 jump_thread_edge (edge e, jump_thread_edge_type t) : e (e), type (t) {}
40 edge e;
49 jump_thread_edge *allocate_thread_edge (edge, jump_thread_edge_type);
69 void push_edge (vec<jump_thread_edge *> *path, edge, jump_thread_edge_type);
93 void remove_jump_threads_including (edge);
101 class redirection_data *lookup_redirection_data (edge e, enum insert_option);
118 bool duplicate_thread_path (edge entry, edge exit, basic_block *region,
125 // the deleted edges. We only care about the address of the edge, no
[all...] |
| shrink-wrap.h | 27 extern void try_shrink_wrapping (edge *entry_edge, rtx_insn *prologue_seq);
|
| /src/external/gpl3/gcc/dist/gcc/ |
| cfghooks.h | 90 /* Redirect edge E to the given basic block B and update underlying program
91 representation. Returns edge representing redirected branch (that may not
93 if edge is not easily redirectable for whatever reason. */
94 edge (*redirect_edge_and_branch) (edge e, basic_block b);
97 newly created forwarder basic block is returned. The edge must
99 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
101 /* Returns true if it is possible to remove the edge by redirecting it
102 to the destination of the other edge going from its source. */
121 /* Predict edge E using PREDICTOR to given PROBABILITY. *
[all...] |
| loop-unroll.h | 24 extern basic_block split_edge_and_insert (edge, rtx_insn *);
|
| tree-cfgcleanup.h | 30 extern bool phi_alternatives_equal (basic_block, edge, edge);
|
| ipa-inline.h | 48 int do_estimate_edge_size (struct cgraph_edge *edge);
49 sreal do_estimate_edge_time (struct cgraph_edge *edge, sreal *nonspec_time = NULL);
50 ipa_hints do_estimate_edge_hints (struct cgraph_edge *edge);
70 /* Return estimated size of the inline sequence of EDGE. */
73 estimate_edge_size (struct cgraph_edge *edge)
77 || (entry = edge_growth_cache->get (edge)) == NULL
79 return do_estimate_edge_size (edge);
83 /* Return lower bound on estimated callee growth after inlining EDGE. */
86 estimate_min_edge_growth (struct cgraph_edge *edge)
88 ipa_call_summary *s = ipa_call_summaries->get (edge);
[all...] |
| cfgloopmanip.h | 37 extern edge mfb_kj_edge;
39 extern bool remove_path (edge, bool * = NULL, bitmap = NULL);
44 extern edge create_empty_if_region_on_edge (edge, tree);
45 extern class loop *create_empty_loop_on_edge (edge, tree, tree, tree, tree,
50 vec<edge> &edges_to_remove,
59 duplicate_loop_body_to_header_edge (class loop *, edge, unsigned, sbitmap, edge,
60 vec<edge> *, int);
61 extern bool mfb_keep_just (edge);
[all...] |
| gimple-range-edge.h | 1 /* Gimple range edge header file.
27 // For a COND_EXPR, the TRUE edge will return [1,1] and the false edge a [0,0].
34 // The API is simple, just ask for the range on the edge.
36 // edge gets the range from, along with the range.
43 gimple *edge_range_p (irange &r, edge e);
46 bool switch_edge_range (irange &r, gswitch *sw, edge e);
49 hash_map<edge, vrange_storage *> *m_edge_table;
55 // Return the range on edge E if it is from a GCOND. Either TRUE or FALSE.
56 void gcond_edge_range (irange &r, edge e)
[all...] |
| predict.h | 58 extern bool maybe_hot_edge_p (edge);
60 extern bool probably_never_executed_edge_p (struct function *, edge);
67 extern enum optimize_size_level optimize_edge_for_size_p (edge);
68 extern bool optimize_edge_for_speed_p (edge);
76 extern bool predictable_edge_p (edge);
78 extern void rtl_profile_for_edge (edge);
85 extern void rtl_predict_edge (edge, enum br_predictor, int);
86 extern void gimple_predict_edge (edge, enum br_predictor, int);
87 extern void remove_predictions_associated_with_edge (edge);
88 extern void predict_edge_def (edge, enum br_predictor, enum prediction)
[all...] |
| tree-ssa.h | 34 extern void redirect_edge_var_map_add (edge, tree, tree, location_t);
35 extern void redirect_edge_var_map_clear (edge);
36 extern void redirect_edge_var_map_dup (edge, edge);
37 extern vec<edge_var_map> *redirect_edge_var_map_vector (edge);
39 extern edge ssa_redirect_edge (edge, basic_block);
40 extern void flush_pending_stmts (edge);
|
| tree-cfg.h | 24 /* Location to track pending stmt for edge insertion. */
36 extern tree get_cases_for_edge (edge, gswitch *);
45 extern edge find_taken_edge (basic_block, tree);
60 extern bool assert_unreachable_fallthru_edge_p (edge);
70 extern void add_phi_args_after_copy (basic_block *, unsigned, edge);
71 extern basic_block split_edge_bb_loc (edge);
72 extern bool gimple_duplicate_seme_region (edge, edge, basic_block *, unsigned,
74 extern bool gimple_duplicate_sese_tail (edge, edge, basic_block *, unsigned
[all...] |
| tree-ssa-threadupdate.h | 33 // vector as edge pairs (original_edge, target_edge).
38 jump_thread_edge (edge e, jump_thread_edge_type t) : e (e), type (t) {}
40 edge e;
49 jump_thread_edge *allocate_thread_edge (edge, jump_thread_edge_type);
69 void push_edge (vec<jump_thread_edge *> *path, edge, jump_thread_edge_type);
93 void remove_jump_threads_including (edge);
101 class redirection_data *lookup_redirection_data (edge e, enum insert_option);
118 bool duplicate_thread_path (edge entry, edge exit, basic_block *region,
125 // the deleted edges. We only care about the address of the edge, no
[all...] |
| /src/usr.bin/make/unit-tests/ |
| suff.exp | 9 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional
10 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.from
11 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.from edge-case.additional
12 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.from edge-case.additional a*.mk
38 Global: .ALLTARGETS = step1 edge-case.to everything ${.PREFIX}${.ARCHIVE}.additional edge-case.from edge-case.additional a*.mk .EN
[all...] |
| varmod-edge.exp | 1 make: varmod-edge.mk:60: Unclosed expression, expecting "}" for modifier "U*)"
5 make: varmod-edge.mk:88: Unfinished character list in pattern "[[" of modifier ":M"
8 make: varmod-edge.mk:178: Unfinished modifier after "a\=b}", expecting "="
11 make: varmod-edge.mk:193: Unknown modifier "::"
14 make: varmod-edge.mk:199: Unknown modifier ":Z"
16 make: varmod-edge.mk:212: Unfinished modifier after "}", expecting ","
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| analysis-plan.cc | 102 /* Return true if the call EDGE should be analyzed using a call summary.
106 analysis_plan::use_summary_p (const cgraph_edge *edge) const
112 /* Don't use call summaries if there is no callgraph edge */
113 if (!edge || !edge->callee)
118 const cgraph_node *callee = edge->callee;
119 for (cgraph_edge *edge = callee->callers; edge; edge = edge->next_caller
[all...] |
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| analysis-plan.cc | 101 /* Return true if the call EDGE should be analyzed using a call summary.
105 analysis_plan::use_summary_p (const cgraph_edge *edge) const
111 /* Don't use call summaries if there is no callgraph edge */
112 if (!edge || !edge->callee)
117 const cgraph_node *callee = edge->callee;
118 for (cgraph_edge *edge = callee->callers; edge; edge = edge->next_caller
[all...] |
