| /NextBSD/contrib/gcc/ |
| HD | cfgloopanal.c | 55 struct edge struct
58 struct edge *pred_next, *succ_next; argument
60 void *data; /* Data attached to the edge. */ argument
228 void (callback) (struct graph *, struct edge *)) in for_each_edge()
|
| HD | ipa-inline.c | 196 cgraph_mark_inline (struct cgraph_edge *edge) in cgraph_mark_inline()
363 cgraph_maybe_hot_edge_p (struct cgraph_edge *edge) in cgraph_maybe_hot_edge_p()
384 cgraph_edge_badness (struct cgraph_edge *edge) in cgraph_edge_badness()
422 struct cgraph_edge *edge; in update_caller_keys() local
720 struct cgraph_edge *edge; in cgraph_decide_inlining_of_small_functions() local
|
| HD | ipa.c | 36 struct cgraph_edge *edge, last; in cgraph_postorder() local
|
| HD | ipa-utils.c | 88 struct cgraph_edge *edge; in searchc() local
|
| HD | cgraph.c | 380 struct cgraph_edge *edge = GGC_NEW (struct cgraph_edge); in cgraph_create_edge() local
701 struct cgraph_edge *edge; in dump_cgraph_node() local
|
| HD | basic-block.h | 146 typedef struct edge_def *edge; typedef
662 static inline VEC(edge,gc) * in VEC() argument
674 ei_start_1 (VEC(edge,gc) **ev) in ei_start_1()
687 ei_last_1 (VEC(edge,gc) **ev) in ei_last_1()
|
| HD | tree-cfgcleanup.c | 54 remove_fallthru_edge (VEC(edge,gc) *ev) in remove_fallthru_edge()
|
| HD | tree-ssa-threadupdate.c | 153 static VEC(edge,heap) *threaded_edges; in VEC() argument
|
| HD | cfghooks.c | 565 make_forwarder_block (basic_block bb, bool (*redirect_edge_p) (edge), in make_forwarder_block()
|
| HD | cgraphunit.c | 1118 struct cgraph_edge *edge; in cgraph_finalize_compilation_unit() local
|
| HD | sched-rgn.c | 249 #define EDGE_TO_BIT(edge) ((int)(size_t)(edge)->aux) argument
250 #define SET_EDGE_TO_BIT(edge,nr) ((edge)->aux = (void *)(size_t)(nr)) argument
|
| HD | haifa-sched.c | 4350 move_succs (VEC(edge,gc) **succsp, basic_block to) in move_succs()
4592 has_edge_p (VEC(edge,gc) *el, int type) in has_edge_p()
|
| HD | tree-flow.h | 37 typedef struct edge_def *edge; typedef
|
| HD | tree-inline.c | 724 struct cgraph_edge *edge; in copy_bb() local
|
| /NextBSD/contrib/libpcap/ |
| HD | gencode.h | 238 struct edge { struct
244 struct edge *next; /* link list of incoming edges for a node */ argument
|
| /NextBSD/contrib/llvm/lib/Target/AArch64/ |
| HD | AArch64PBQPRegAlloc.cpp | 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint() local
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint() local
|
| /NextBSD/tools/tools/ath/athprom/ |
| HD | athprom.c | 385 printEdge(FILE *fd, int edge) in printEdge()
397 printEdgePower(FILE *fd, int edge) in printEdgePower()
411 printEdgeFlag(FILE *fd, int edge) in printEdgeFlag()
|
| /NextBSD/contrib/ldns/ldns/ |
| HD | radix.h | 64 ldns_radix_node_t* edge; member
|
| /NextBSD/contrib/byacc/ |
| HD | lalr.c | 282 Value_t *edge; in initialize_F() local
368 Value_t *edge; in build_relations() local
|
| /NextBSD/sys/x86/iommu/ |
| HD | intel_intrmap.c | 153 iommu_map_ioapic_intr(u_int ioapic_id, u_int cpu, u_int vector, bool edge, in iommu_map_ioapic_intr()
|
| /NextBSD/sys/sys/ |
| HD | timepps.h | 121 int edge; member
254 const int edge, const int tsformat) in time_pps_kcbind()
|
| /NextBSD/contrib/ntp/include/ |
| HD | timepps-SCO.h | 485 const int edge, const int tsformat in time_pps_kcbind()
|
| HD | timepps-SunOS.h | 486 const int edge, const int tsformat in time_pps_kcbind()
|
| HD | timepps-Solaris.h | 550 const int edge, in time_pps_kcbind()
|
| /NextBSD/sys/powerpc/powermac/ |
| HD | cpcht.c | 120 int edge; member
|