/external/v8/tools/clang/blink_gc_plugin/ |
H A D | CheckGCRootsVisitor.cpp | 19 it->second.edge()->Accept(this); 25 void CheckGCRootsVisitor::VisitValue(Value* edge) { argument 27 if (edge->value()->record()->isUnion()) 31 if (visiting_set_.find(edge->value()) != visiting_set_.end()) 34 visiting_set_.insert(edge->value()); 42 ContainsGCRoots(edge->value()); 43 visiting_set_.erase(edge->value()); 46 void CheckGCRootsVisitor::VisitPersistent(Persistent* edge) { argument 50 void CheckGCRootsVisitor::AtCollection(Collection* edge) { argument 51 if (edge [all...] |
H A D | CheckFieldsVisitor.cpp | 32 current_->edge()->Accept(this); 37 void CheckFieldsVisitor::AtMember(Member* edge) { argument 50 void CheckFieldsVisitor::AtIterator(Iterator* edge) { argument 54 if (edge->IsUnsafe()) 58 void CheckFieldsVisitor::AtValue(Value* edge) { argument 60 if (edge->value()->record()->isUnion()) 63 if (!stack_allocated_host_ && edge->value()->IsStackAllocated()) { 69 edge->value()->IsGCDerived() && 70 !edge->value()->IsGCMixin()) { 86 edge 112 AtCollection(Collection* edge) argument [all...] |
H A D | CheckFinalizerVisitor.cpp | 20 void VisitMember(Member* edge) override; 21 void VisitCollection(Collection* edge) override; 43 void MightBeCollectedVisitor::VisitMember(Member* edge) { argument 45 if (edge->ptr()->IsValue()) { 46 Value* member = static_cast<Value*>(edge->ptr()); 57 void MightBeCollectedVisitor::VisitCollection(Collection* edge) { argument 58 if (edge->on_heap() && !is_eagerly_finalized_) { 59 might_be_collected_ = !edge->is_root(); 61 edge->AcceptMembers(this); 130 point->edge() [all...] |
/external/pdfium/xfa/fwl/theme/ |
H A D | cfwl_edittp.cpp | 30 CXFA_Edge* edge = borderUI->GetEdgeIfExists(0); local 31 if (edge) { 32 cr = edge->GetColor(); 33 fWidth = edge->GetThickness();
|
/external/mesa3d/src/gallium/auxiliary/util/ |
H A D | u_split_prim.h | 14 void (*edge)(void *priv, boolean enabled); member in struct:util_split_prim 53 s->edge(s->priv, TRUE); 75 s->edge(s->priv, FALSE);
|
/external/v8/src/compiler/ |
H A D | verifier.h | 43 // (effect, control or frame state) to be used as an input for {edge}. 44 static void VerifyEdgeInputReplacement(const Edge& edge, 48 static void VerifyEdgeInputReplacement(const Edge& edge, argument
|
H A D | control-equivalence.cc | 103 Edge edge = *entry.input; local 104 Node* input = edge.to(); 106 if (NodeProperties::IsControlEdge(edge)) { 133 Edge edge = *entry.use; local 134 Node* use = edge.from(); 136 if (NodeProperties::IsControlEdge(edge)) {
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/tool/ |
H A D | DOTGenerator.java | 131 // make a DOT edge for each transition 133 Transition edge = (Transition) s.transition(i); 136 " edge from s"+s.stateNumber+" ["+i+"] of "+s.getNumberOfTransitions()); 139 if ( edge.target instanceof DFAState && 140 ((DFAState)edge.target).getAcceptStateReachable()!=DFA.REACHABLE_YES ) 145 st = stlib.getInstanceOf("edge"); 146 st.add("label", getEdgeLabel(edge)); 148 st.add("target", getStateLabel(edge.target)); 151 walkCreatingDFADOT(dot, (DFAState)edge.target); // keep walkin' 205 // make a DOT edge fo 284 getEdgeLabel(Transition edge) argument [all...] |
/external/opencv/cvaux/src/ |
H A D | cvsubdiv2.cpp | 59 CvQuadEdge2D* edge = (CvQuadEdge2D*)cvGetSetElem(subdiv->edges,i); local 61 if( edge && CV_IS_SET_ELEM( edge )) 65 CvSubdiv2DEdge e = (CvSubdiv2DEdge)edge + j; 107 draw_subdiv_facet( CvSubdiv2D * subdiv, IplImage * dst, IplImage * src, CvSubdiv2DEdge edge ) 109 CvSubdiv2DEdge t = edge; 120 while( t != edge && count < subdiv->quad_edges * 4 ); 128 t = edge; 142 CvSubdiv2DPoint *pt = cvSubdiv2DEdgeDst( cvSubdiv2DRotateEdge( edge, 1 )); 173 CvQuadEdge2D *edge local [all...] |
/external/pdfium/xfa/fxfa/ |
H A D | cxfa_ffline.cpp | 101 CXFA_Edge* edge = line->GetEdgeIfExists(); local 102 if (edge && !edge->IsVisible()) 105 if (edge) { 106 lineColor = edge->GetColor(); 107 iStrokeType = edge->GetStrokeType(); 108 fLineWidth = edge->GetThickness(); 109 iCap = edge->GetCapType();
|
/external/skia/src/core/ |
H A D | SkScanPriv.h | 45 static inline void remove_edge(EdgeType* edge) { argument 46 edge->fPrev->fNext = edge->fNext; 47 edge->fNext->fPrev = edge->fPrev; 51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { argument 52 edge->fPrev = afterMe; 53 edge->fNext = afterMe->fNext; 54 afterMe->fNext->fPrev = edge; 55 afterMe->fNext = edge; 59 backward_insert_edge_based_on_x(EdgeType* edge) argument [all...] |
H A D | SkEdgeBuilder.h | 44 // returns the number of built edges. The array of those edge pointers 63 Combine CombineVertical(const SkEdge* edge, SkEdge* last); 64 Combine CombineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last); 65 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr); 66 Combine checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr); 67 bool vertical_line(const SkEdge* edge); 68 bool vertical_line(const SkAnalyticEdge* edge); 94 inline void addPolyLine(SkPoint pts[], char* &edge, size_t edgeSize, char** &edgePtr, argument 97 if (((SkLine*)edge)->set(pts)) { 98 *edgePtr++ = edge; [all...] |
/external/skqp/src/core/ |
H A D | SkScanPriv.h | 45 static inline void remove_edge(EdgeType* edge) { argument 46 edge->fPrev->fNext = edge->fNext; 47 edge->fNext->fPrev = edge->fPrev; 51 static inline void insert_edge_after(EdgeType* edge, EdgeType* afterMe) { argument 52 edge->fPrev = afterMe; 53 edge->fNext = afterMe->fNext; 54 afterMe->fNext->fPrev = edge; 55 afterMe->fNext = edge; 59 backward_insert_edge_based_on_x(EdgeType* edge) argument [all...] |
H A D | SkEdgeBuilder.h | 44 // returns the number of built edges. The array of those edge pointers 63 Combine CombineVertical(const SkEdge* edge, SkEdge* last); 64 Combine CombineVertical(const SkAnalyticEdge* edge, SkAnalyticEdge* last); 65 Combine checkVertical(const SkEdge* edge, SkEdge** edgePtr); 66 Combine checkVertical(const SkAnalyticEdge* edge, SkAnalyticEdge** edgePtr); 67 bool vertical_line(const SkEdge* edge); 68 bool vertical_line(const SkAnalyticEdge* edge); 94 inline void addPolyLine(SkPoint pts[], char* &edge, size_t edgeSize, char** &edgePtr, argument 97 if (((SkLine*)edge)->set(pts)) { 98 *edgePtr++ = edge; [all...] |
/external/swiftshader/third_party/LLVM/lib/Transforms/Instrumentation/ |
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...] |
/external/tensorflow/tensorflow/contrib/tensorrt/segment/ |
H A D | segment.cc | 36 bool CanContractEdge(const tensorflow::Edge* edge, argument 38 const tensorflow::Node* src = edge->src(); 39 const tensorflow::Node* dst = edge->dst(); 41 // Can't contract edge if doing so would cause a cycle in the 43 // than 'edge' (or any other direct edge from 'src' to 'dst'), then 71 void ContractEdge(tensorflow::Edge* edge, tensorflow::Graph* graph, argument 75 tensorflow::Node* src = edge->src(); 76 tensorflow::Node* dst = edge->dst(); 202 // Contracting the edge leave [all...] |
/external/guice/extensions/grapher/src/com/google/inject/grapher/ |
H A D | AbstractInjectorGrapher.java | 127 /** Adds a new dependency edge to the graph. */ 128 protected abstract void newDependencyEdge(DependencyEdge edge) throws IOException; argument 130 /** Adds a new binding edge to the graph. */ 131 protected abstract void newBindingEdge(BindingEdge edge) throws IOException; argument 156 for (Edge edge : edges) { 157 edge = edge.copy(resolveAlias(aliases, edge.getFromId()), 158 resolveAlias(aliases, edge.getToId())); 159 if (!edge [all...] |
/external/guice/extensions/grapher/test/com/google/inject/grapher/ |
H A D | AbstractInjectorGrapherTest.java | 71 @Override protected void newDependencyEdge(DependencyEdge edge) { argument 72 assertFalse(edges.contains(edge)); 73 edges.add(edge); 76 @Override protected void newBindingEdge(BindingEdge edge) { argument 77 assertFalse(edges.contains(edge)); 78 edges.add(edge);
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64PBQPRegAlloc.cpp | 182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local 184 // The edge does not exist. Create one with the appropriate interference 186 if (edge == G.invalidEdgeId()) { 207 if (G.getEdgeNode1Id(edge) == node2) { 213 PBQPRAGraph::RawMatrix costs(G.getEdgeCosts(edge)); 238 G.updateEdgeCosts(edge, std::move(costs)); 278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); local 279 assert(edge != G.invalidEdgeId() && 280 "PBQP error ! The edge should exist !"); 284 if (G.getEdgeNode1Id(edge) [all...] |
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | ProfileInfoLoaderPass.cpp | 61 // recurseBasicBlock() - Calculates the edge weights for as much basic 97 void LoaderPass::readEdgeOrRemember(Edge edge, Edge &tocalc, argument 100 if ((w = getEdgeWeight(edge)) == MissingValue) { 101 tocalc = edge; 109 // calculate the missing edge values. 215 assert(0 && "No edge calculated!");
|
/external/tensorflow/tensorflow/compiler/jit/ |
H A D | graph_to_functiondef.cc | 154 Edge const* edge; local 155 TF_CHECK_OK(node->input_edge(0, &edge)); 157 strings::StrCat(edge->src()->name(), ":", edge->src_output()); 174 for (Edge const* edge : node->in_edges()) { 175 if (edge->src()->IsSource()) continue; 177 if (edge->IsControlEdge()) { 178 control_edges.push_back(edge); 180 if (in_edges.size() <= edge->dst_input()) { 181 in_edges.resize(edge 189 const Edge* edge = in_edges[i]; local [all...] |
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
H A D | GraphvizGrapher.java | 84 for (GraphvizEdge edge : edges) { 85 renderEdge(edge); 166 protected void renderEdge(GraphvizEdge edge) { argument 167 Map<String, String> attrs = getEdgeAttributes(edge); 169 String tailId = getEdgeEndPoint(nodes.get(edge.getTailNodeId()).getIdentifier(), 170 edge.getTailPortId(), edge.getTailCompassPoint()); 172 String headId = getEdgeEndPoint(nodes.get(edge.getHeadNodeId()).getIdentifier(), 173 edge.getHeadPortId(), edge 178 getEdgeAttributes(GraphvizEdge edge) argument 288 newDependencyEdge(DependencyEdge edge) argument 302 newBindingEdge(BindingEdge edge) argument [all...] |
/external/kernel-headers/original/uapi/linux/ |
H A D | pps.h | 139 int edge; /* selected event type */ member in struct:pps_bind_args
|
/external/llvm/unittests/ADT/ |
H A D | APIntTest.cpp | 339 int64_t edge = INT64_MIN; local 340 int64_t edgeP1 = edge + 1; 342 auto a = APInt{64, static_cast<uint64_t>(edge), true}; 344 EXPECT_TRUE(!a.slt(edge)); 345 EXPECT_TRUE( a.sle(edge)); 346 EXPECT_TRUE(!a.sgt(edge)); 347 EXPECT_TRUE( a.sge(edge)); 359 uint64_t edge = 0x4000000000000000; local 360 uint64_t edgeP1 = edge + 1; 361 uint64_t edgeM1 = edge [all...] |
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
H A D | nv50_ir_graph.cpp | 97 Edge *edge = new Edge(this, node, kind); local 101 edge->next[0] = this->out; 102 edge->prev[0] = this->out->prev[0]; 103 edge->prev[0]->next[0] = edge; 104 this->out->prev[0] = edge; 106 this->out = edge; 109 edge->next[1] = node->in; 110 edge->prev[1] = node->in->prev[1]; 111 edge 366 Graph::Edge *edge; local [all...] |