/freebsd-11-stable/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...] |
H A D | cfgloopmanip.c | 37 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 D | tree-vectorizer.c | 153 (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...] |
/freebsd-11-stable/contrib/unbound/edns-subnet/ |
H A D | addrtree.c | 46 * Create a new edge 47 * @param node: Child node this edge will connect to. 48 * @param addr: full key to this edge. 59 struct addredge *edge = (struct addredge *)malloc( sizeof (*edge) ); local 60 if (!edge) 62 edge->node = node; 63 edge->len = addrlen; 64 edge->parent_index = parent_index; 65 edge 364 struct addredge *edge; local 478 struct addredge *edge = NULL; local [all...] |
/freebsd-11-stable/contrib/ldns/ |
H A D | radix.c | 212 prefix->array[0].edge = add; 268 prefix->array[byte].edge = add; 269 } else if (prefix->array[byte-prefix->offset].edge == NULL) { 291 prefix->array[byte].edge = add; 368 node = node->array[byte].edge; 417 if (!node->array[byte].edge) { 436 node->array[byte].edge); 439 *result = ldns_radix_last_in_subtree_incl_self(node->array[byte].edge); 441 *result = ldns_radix_prev(node->array[byte].edge); 450 node->array[byte].edge); [all...] |
/freebsd-11-stable/sys/x86/iommu/ |
H A D | iommu_intrmap.h | 39 int iommu_map_ioapic_intr(u_int ioapic_id, u_int cpu, u_int vector, bool edge,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AArch64/ |
H A D | AArch64PBQPRegAlloc.cpp | 181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local 183 // The edge does not exist. Create one with the appropriate interference 185 if (edge == G.invalidEdgeId()) { 206 if (G.getEdgeNode1Id(edge) == node2) { 212 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); 237 G.updateEdgeCosts(edge, std::move(costs)); 277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local 278 assert(edge != G.invalidEdgeId() && 279 "PBQP error ! The edge should exist !"); 283 if (G.getEdgeNode1Id(edge) [all...] |