Searched refs:edge (Results 1 - 25 of 124) sorted by relevance

12345

/freebsd-9.3-release/contrib/gcc/
H A Dcfghooks.h39 /* Redirect edge E to the given basic block B and update underlying program
40 representation. Returns edge representing redirected branch (that may not
42 if edge is not easily redirectable for whatever reason. */
43 edge (*redirect_edge_and_branch) (edge e, basic_block b);
46 newly created forwarder basic block is returned. The edge must
48 basic_block (*redirect_edge_and_branch_force) (edge, basic_block);
66 /* Predict edge E using PREDICTOR to given PROBABILITY. */
67 void (*predict_edge) (edge e, enum br_predictor predictor, int probability);
81 basic_block (*split_edge) (edge);
[all...]
H A Dcfglayout.h34 edge *, unsigned, edge *, struct loop *,
H A Dipa-inline.c110 /* E is expected to be an edge being inlined. Clone destination node of
111 the edge and redirect it to the new clone.
151 /* Mark edge E as inlined and update callgraph accordingly.
192 Return following unredirected edge in the list of callers
196 cgraph_mark_inline (struct cgraph_edge *edge) argument
198 struct cgraph_node *to = edge->caller;
199 struct cgraph_node *what = edge->callee;
211 if (e == edge)
212 edge = next;
217 return edge;
363 cgraph_maybe_hot_edge_p(struct cgraph_edge *edge) argument
384 cgraph_edge_badness(struct cgraph_edge *edge) argument
422 struct cgraph_edge *edge; local
720 struct cgraph_edge *edge; local
[all...]
H A Dcfgloop.h121 /* If not NULL, loop has just single exit edge stored here (edges to the
123 edge single_exit;
205 extern bool loop_exit_edge_p (const struct loop *, edge);
212 extern edge *get_loop_exit_edges (const struct loop *, unsigned *);
215 extern edge loop_preheader_edge (const struct loop *);
216 extern edge loop_latch_edge (const struct loop *);
223 extern basic_block loop_split_edge_with (edge, rtx);
253 extern bool duplicate_loop_to_header_edge (struct loop *, edge, struct loops *,
254 unsigned, sbitmap, edge, edge *,
[all...]
H A Dtree-ssa-threadupdate.c42 out-edge from B while preserving any side effects in B.
54 argument associated with edge B->C. Associate the new PHI arguments
55 with the edge B'->C.
59 value as the PHI in B associated with the edge A->B. Associate
60 the new argument in the PHI in B' with the edge A->B.
62 5. Change the edge A->B to A->B'.
65 edge A->B in B.
68 with the edge A->B'.
87 all the incoming edges which thread to the same destination edge at
89 for the destination edge
[all...]
H A Dipa.c36 struct cgraph_edge *edge, last; local
59 edge = node2->aux;
60 if (edge->next_caller)
61 node2->aux = edge->next_caller;
64 if (!edge->caller->aux)
66 if (!edge->caller->callers)
67 edge->caller->aux = &last;
69 edge->caller->aux = edge->caller->callers;
71 node2 = edge
[all...]
H A Dcfghooks.c68 Currently it does following: checks edge and basic block list correctness
108 edge e;
127 error ("verify_flow_info: Duplicate edge %i->%i",
133 error ("verify_flow_info: Wrong probability of edge %i->%i %i",
139 error ("verify_flow_info: Wrong count of edge %i->%i %i",
151 error ("verify_flow_info: Basic block %d succ edge is corrupted",
173 error ("basic block %d pred edge is corrupted", bb->index);
184 error ("basic block %d pred edge is corrupted", bb->index);
199 /* Complete edge checksumming for ENTRY and EXIT. */
201 edge
565 make_forwarder_block(basic_block bb, bool (*redirect_edge_p) (edge), void (*new_bb_cbk) (basic_block)) argument
[all...]
H A Dtracer.c55 static bool better_p (edge, edge);
56 static edge find_best_successor (basic_block);
57 static edge find_best_predecessor (basic_block);
62 /* Minimal outgoing edge probability considered for superblock formation. */
100 better_p (edge e1, edge e2)
117 static edge
120 edge e;
121 edge bes
[all...]
H A Dtree-flow.h37 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
364 edge ep_edge;
562 /* Location to track pending stmt for edge insertion. */
589 extern edge find_taken_edge (basic_block, tree);
592 extern void bsi_insert_on_edge (edge, tree);
593 extern basic_block bsi_insert_on_edge_immediate (edge, tree);
594 extern void bsi_commit_one_edge_insert (edge, basic_block *);
600 extern void extract_true_false_edges_from_block (basic_block, edge *, edge *);
601 extern bool tree_duplicate_sese_region (edge, edg
[all...]
H A Dcgraph.c41 When built, there is one edge for each direct call. It is possible that
70 Each edge has "inline_failed" field. When the field is set to NULL,
312 /* Return callgraph edge representing CALL_EXPR statement. */
351 /* Change call_smtt of edge E to NEW_STMT. */
374 /* Create edge from CALLER to CALLEE in the cgraph. */
380 struct cgraph_edge *edge = GGC_NEW (struct cgraph_edge); local
391 edge->inline_failed = N_("function body not available");
393 edge->inline_failed = N_("redefined extern inline functions are not "
396 edge->inline_failed = N_("function not considered for inlining");
398 edge
701 struct cgraph_edge *edge; local
[all...]
H A Dbasic-block.h117 /* Control flow edge information. */
120 /* The two blocks at the ends of the edge. */
124 /* Instructions queued on the edge. */
133 /* Location of any goto implicit in the edge, during tree-ssa. */
141 /* The index number corresponding to this edge in the edge vector
146 typedef struct edge_def *edge; typedef in typeref:struct:edge_def
147 DEF_VEC_P(edge); variable
148 DEF_VEC_ALLOC_P(edge,gc);
156 #define EDGE_FAKE 16 /* Not a real edge (profil
[all...]
H A Dcfg.c36 - Low level edge redirection (without updating instruction chain)
76 static void free_edge (edge);
98 /* Helper function for remove_edge and clear_edges. Frees edge structure
102 free_edge (edge e ATTRIBUTE_UNUSED)
108 /* Free the memory associated with the edge structures. */
114 edge e;
121 VEC_truncate (edge, bb->succs, 0);
122 VEC_truncate (edge, bb->preds, 0);
127 VEC_truncate (edge, EXIT_BLOCK_PTR->preds, 0);
128 VEC_truncate (edge, ENTRY_BLOCK_PT
[all...]
H A Dtree-ssa-phiopt.c40 edge, edge, tree, tree, tree);
42 edge, edge, tree, tree, tree);
44 edge, edge, tree, tree, tree);
46 edge, edge, tree, tree, tree);
47 static void replace_phi_edge_with_variable (basic_block, edge, tree, tree);
159 edge e
[all...]
H A Dcfgloopanal.c53 /* Structure representing edge of a graph. */
55 struct edge struct
58 struct edge *pred_next, *succ_next;
59 /* Next edge in predecessor and successor lists. */
60 void *data; /* Data attached to the edge. */
67 struct edge *pred, *succ;
91 struct edge *e;
124 /* Adds an edge from F to T to graph G, with DATA attached. */
129 struct edge *e = xmalloc (sizeof (struct edge));
[all...]
H A Dipa-utils.c89 struct cgraph_edge *edge;
102 for (edge = v->callees; edge; edge = edge->next_callee)
105 struct cgraph_node *w = edge->callee;
88 struct cgraph_edge *edge; local
H A Dtree-cfgcleanup.c51 /* Remove any fallthru edge from EV. Return true if an edge was removed. */
54 remove_fallthru_edge (VEC(edge,gc) *ev)
57 edge e;
74 edge taken_edge;
80 edge e;
200 edge e;
208 edge which goes to the right block, fix up its flags. */
263 edge e, succ;
266 /* BB must have a single outgoing edge
[all...]
H A Dtree-ssa-propagate.h41 conditional jump, SSA_PROP_VISIT_STMT should indicate which edge
110 typedef enum ssa_prop_result (*ssa_prop_visit_stmt_fn) (tree, edge *, tree *);
H A Dvalue-prof.h77 /* External declarations for edge-based profiling. */
80 /* Insert code to initialize edge profiler. */
83 /* Insert code to increment an edge count. */
84 void (*gen_edge_profiler) (int, edge);
H A Dtree-ssa-loop-ivcanon.c70 is the exit edge whose condition is replaced. */
73 create_canonical_iv (struct loop *loop, edge exit, tree niter)
75 edge in;
164 edge exit, tree niter,
227 edge *edges_to_remove = XNEWVEC (edge, n_unroll);
280 edge exit = NULL;
292 condition, not of the loop latch edge). */
401 edge exit;
496 edge exi
[all...]
H A Dcfgloopmanip.c37 static void loop_redirect_edge (edge, basic_block);
38 static bool loop_delete_branch_edge (edge, int);
41 static int find_path (edge, basic_block **);
75 /* Find path -- i.e. the basic blocks dominated by edge E and put them
82 find_path (edge e, basic_block **bbs)
102 edge e;
147 edge e;
241 /* Removes path beginning at edge E, i.e. remove basic blocks dominated by E
246 remove_path (struct loops *loops, edge e)
248 edge a
[all...]
H A Dtree-vectorizer.c153 (struct loop *, struct loops *, edge);
157 (edge, struct loop *, bool, basic_block *, bitmap *);
159 (edge, struct loop *, bool, basic_block *);
160 static edge slpeel_add_loop_guard (basic_block, tree, basic_block, basic_block);
227 edge e;
280 edge orig_loop_latch = loop_latch_edge (orig_loop);
281 edge orig_entry_e = loop_preheader_edge (orig_loop);
282 edge new_loop_exit_e = new_loop->single_exit;
283 edge new_loop_entry_e = loop_preheader_edge (new_loop);
284 edge entry_arg_
[all...]
H A Dbb-reorder.c29 If the edge to a successor of the actual basic block is lower than
44 source block of the most probable edge going out from the loop
46 If the loop has few iterations and there is no edge from the last block of
50 When connecting traces it first checks whether there is an edge from the
112 /* If edge frequency is lower than DUPLICATION_THRESHOLD per mille of entry
113 block the edge destination is not duplicated while connecting traces. */
170 static basic_block rotate_loop (edge, struct trace *, int);
174 static basic_block copy_bb (basic_block, edge, basic_block, int);
176 static bool better_edge_p (basic_block, edge, int, int, int, int, edge);
[all...]
/freebsd-9.3-release/contrib/libpcap/
H A Dgencode.h229 struct edge { struct
235 struct edge *next; /* link list of incoming edges for a node */
248 struct edge et;
249 struct edge ef;
254 struct edge *in_edges;
/freebsd-9.3-release/sys/sys/
H A Dtimepps.h94 int edge; member in struct:pps_kcbind_args
188 const int edge, const int tsformat)
193 arg.edge = edge;
187 time_pps_kcbind(pps_handle_t handle, const int kernel_consumer, const int edge, const int tsformat) argument
/freebsd-9.3-release/usr.bin/yacc/
H A Dlalr.c333 short *edge; local
346 edge = NEW2(ngotos + 1, short);
371 edge[nedges++] = map_goto(stateno, symbol);
379 rp[j] = edge[j];
399 free(edge);
421 short *edge; local
426 edge = NEW2(ngotos + 1, short);
467 edge[nedges++] = map_goto(stateno, *rp);
477 shortp[j] = edge[j];
492 free(edge);
[all...]

Completed in 471 milliseconds

12345