/freebsd-10.0-release/contrib/gcc/ |
H A D | cfghooks.h | 39 /* 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 D | cfglayout.h | 34 edge *, unsigned, edge *, struct loop *,
|
H A D | ipa-inline.c | 110 /* 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 D | cfgloop.h | 121 /* 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 D | tree-ssa-threadupdate.c | 42 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 D | ipa.c | 36 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 D | cfghooks.c | 68 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 D | tracer.c | 55 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 D | tree-flow.h | 37 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 D | cgraph.c | 41 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 D | basic-block.h | 117 /* 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 D | cfg.c | 36 - 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 D | tree-ssa-phiopt.c | 40 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 D | cfgloopanal.c | 53 /* 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 D | ipa-utils.c | 89 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 D | tree-cfgcleanup.c | 51 /* 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 D | tree-ssa-propagate.h | 41 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 D | value-prof.h | 77 /* 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 D | tree-ssa-loop-ivcanon.c | 70 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...] |
/freebsd-10.0-release/contrib/llvm/lib/Transforms/Instrumentation/ |
H A D | PathProfiling.cpp | 28 // v->w, insert edge ENTRY->w and edge v->EXIT. 33 // Chord - An edge not in the spanning tree. 107 // instrumentation that will end up on each edge. 114 // Sets the target node of this edge. Required to split edges. 117 // Get/set whether edge is in the spanning tree. 121 // Get/ set whether this edge will be instrumented with a path number 126 // Get/set whether this edge will be instrumented with a path counter 133 // Get/set the path number increment that this edge will be instrumented 141 // Get/set whether the edge ha 392 operator <<(raw_ostream& os, const BLInstrumentationEdge& edge) argument 650 BallLarusEdge* edge; local 781 unlinkEdge(BallLarusEdge* edge) argument 790 makeEdgeSpanning(BLInstrumentationEdge* edge) argument 796 pushInitializationFromEdge( BLInstrumentationEdge* edge) argument 824 pushCountersFromEdge(BLInstrumentationEdge* edge) argument 901 createIncrementConstant( BLInstrumentationEdge* edge) argument 1078 insertInstrumentationStartingAt(BLInstrumentationEdge* edge, BLInstrumentationDag* dag) argument 1402 splitCritical(BLInstrumentationEdge* edge, BLInstrumentationDag* dag) argument [all...] |
H A D | OptimalEdgeProfiling.cpp | 1 //===- OptimalEdgeProfiling.cpp - Insert counters for opt. edge profiling -===// 10 // This pass instruments the specified program with counters for edge profiling. 15 #define DEBUG_TYPE "insert-optimal-edge-profiling" 55 INITIALIZE_PASS_BEGIN(OptimalEdgeProfiler, "insert-optimal-edge-profiling", 56 "Insert optimal instrumentation for edge profiling", 60 INITIALIZE_PASS_END(OptimalEdgeProfiler, "insert-optimal-edge-profiling", 61 "Insert optimal instrumentation for edge profiling", 78 errs() << "WARNING: cannot insert edge profiling into a module" 85 // For the entry block a virtual edge (0,entry) is reserved, for each block 86 // with no successors an edge (B 150 ProfileInfo::Edge edge = ProfileInfo::getEdge(0, entry); local 173 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB, 0); local 184 ProfileInfo::Edge edge = ProfileInfo::getEdge(BB,Succ); local [all...] |
/freebsd-10.0-release/contrib/llvm/lib/Analysis/ |
H A D | ProfileEstimatorPass.cpp | 116 // flow, once an edge has a flow assigned this flow is never changed again, 134 Edge edge = getEdge(*bbi,BB); local 135 double w = getEdgeWeight(edge); 140 // loop, thus the edge is a backedge, continue and do not check if the 143 printEdgeError(edge, "but is backedge, continuing"); 149 printEdgeError(edge, "returning"); 172 // *) In case there is not a single exiting edge left, create one at the loop 205 Edge edge = getEdge(Latch,0); local 206 EdgeInformation[BB->getParent()][edge] = BBWeight; 207 printEdgeWeight(edge); 267 Edge edge = getEdge(BB,0); local 273 Edge edge = getEdge(BB,*bbi); local 341 Edge edge = getEdge(0,entry); local [all...] |
H A D | PathNumbering.cpp | 113 // Add an edge to the predecessor list. 114 void BallLarusNode::addPredEdge(BallLarusEdge* edge) { argument 115 _predEdges.push_back(edge); 118 // Remove an edge from the predecessor list. 119 void BallLarusNode::removePredEdge(BallLarusEdge* edge) { argument 120 removeEdge(_predEdges, edge); 123 // Add an edge to the successor list. 124 void BallLarusNode::addSuccEdge(BallLarusEdge* edge) { argument 125 _succEdges.push_back(edge); 128 // Remove an edge fro 129 removeSuccEdge(BallLarusEdge* edge) argument [all...] |
/freebsd-10.0-release/contrib/libpcap/ |
H A D | gencode.h | 229 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-10.0-release/contrib/llvm/include/llvm/Analysis/ |
H A D | PathNumbering.h | 87 // Add an edge to the predecessor list. 88 void addPredEdge(BallLarusEdge* edge); 90 // Remove an edge from the predecessor list. 91 void removePredEdge(BallLarusEdge* edge); 93 // Add an edge to the successor list. 94 void addSuccEdge(BallLarusEdge* edge); 96 // Remove an edge from the successor list. 97 void removeSuccEdge(BallLarusEdge* edge); 123 // Removes an edge from an edgeVector. Used by removePredEdge and 128 // Represents an edge i [all...] |