/external/skqp/src/sksl/ |
H A D | sksl_enums.inc | 14 * We have coverage effects that clip rendering to the edge of some geometric primitive.
|
/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/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/v8/src/compiler/ |
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)) {
|
H A D | loop-variable-optimizer.cc | 60 for (Edge edge : node->use_edges()) { 61 if (NodeProperties::IsControlEdge(edge) && 62 edge.from()->op()->ControlOutputCount() > 0) { 63 Node* use = edge.from(); 65 edge.index() != kAssumedLoopEntryIndex) { 331 for (Edge edge : loop->use_edges()) { 332 if (NodeProperties::IsControlEdge(edge) && 333 edge.from()->opcode() == IrOpcode::kPhi) { 334 Node* phi = edge.from();
|
H A D | control-flow-optimizer.cc | 55 for (Edge edge : node->use_edges()) { 56 if (NodeProperties::IsControlEdge(edge)) { 57 Enqueue(edge.from());
|
/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/tensorflow/tensorflow/compiler/jit/ |
H A D | mark_for_compilation_pass.cc | 247 // Returns a string describing how an edge from src to dst would 420 for (Edge const* edge : graph->edges()) { 421 if (edge->dst()->IsEnter()) { 424 control_flow_info[edge->dst()->id()].frame_name; 426 if (!cycles.InsertEdge(edge->src()->id(), dst)) { 428 "Cycle detected when adding enter->frame edge: ", 429 DescribeCycle(cycles, *graph, edge->src()->id(), dst)); 433 if (edge->src()->IsExit()) { 436 control_flow_info[edge->src()->id()].frame_name; 438 if (!cycles.InsertEdge(src, edge [all...] |
/external/tensorflow/tensorflow/core/distributed_runtime/ |
H A D | scheduler.cc | 38 for (const Edge* edge : node->in_edges()) { 39 if (edge->IsControlEdge()) { 51 // Return true if the update makes the destination of the edge ready to run. 52 bool UpdatePending(const Edge* edge, std::vector<int>* pending_count) { argument 53 const Node* out = edge->dst(); 55 if (edge->IsControlEdge()) { 57 // Return true if we already got at least one input edge 58 // and a control edge is the enabling one. 63 // If the first input edge is the enabling one, the count goes from 129 for (const Edge* edge [all...] |
/external/tensorflow/tensorflow/c/ |
H A D | c_api_function.cc | 186 for (const Edge* edge : node->in_edges()) { 187 if (edge->src()->IsSource()) continue; 188 if (edge->IsControlEdge()) { 189 control_edges.push_back(edge); 191 in_edges[edge->dst_input()] = edge; 197 const Edge* edge = in_edges[i]; local 199 if (edge == nullptr) { 205 "Node ", node->name(), " is missing input edge ", i); 211 strings::StrCat(edge [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/codegen/ |
H A D | CodeGenerator.java | 661 * edge. Generate a simple if-then-else. Cannot be an accept state as 678 Transition edge = (Transition) s.transition(i); 680 if ( edge.label.getAtom()==Label.EOT ) { 689 genLabelExpr(templates,edge,1); 694 Utils.integer(edge.target.stateNumber)); 695 // stick in any gated predicates for any edge if not already a pred 696 if ( !edge.label.isSemanticPredicate() ) { 697 DFAState t = (DFAState)edge.target; 707 if ( edge.label.getAtom()!=Label.EOT ) { 712 // state has >= 1 edge wit 723 genLabelExpr(STGroup templates, Transition edge, int k) argument 742 genSemanticPredicateExpr(STGroup templates, Transition edge) argument [all...] |
/external/libpcap/ |
H A D | gencode.h | 238 struct edge { struct 244 struct edge *next; /* link list of incoming edges for a node */ 257 struct edge et; 258 struct edge ef; 263 struct edge *in_edges;
|
/external/opencv/cvaux/src/ |
H A D | cvclique.cpp | 83 #define CV_GET_ADJ_VTX( vertex, edge ) \ 85 assert(edge->vtx[0]==vertex||edge->vtx[1] == vertex ), \ 86 (edge->vtx[0] == vertex)?edge->vtx[1]:edge->vtx[0] \ 173 CvGraphEdge* edge = cvFindGraphEdgeByPtr( graph, ver1, ver2 ); 174 if( edge ) 176 assert( ((CvGraphWeightedEdge*)edge)->weight >= 0 ); 178 finder->edge_weights[ j * graph->total + i ] = ((CvGraphWeightedEdge*)edge) [all...] |
/external/libavc/decoder/ |
H A D | ih264d_compute_bs.c | 80 /* BS=2 for a 4x4 edge if any of adjacent blocks forming edge */ 82 /* edges can be derived using a lookup table for each edge */ 226 /* Computing Bs for the top edge */ 238 /* If Bs is not set, use left edge and current edge mvs and */ 268 /* Computing Bs for the left edge */ 348 UWORD32 edge; local 356 for(edge = 0; edge < 719 UWORD32 edge; local 1793 UWORD8 edge, u1_top_intra = 0, u1_left_intra = 0; local [all...] |
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | LL1DFA.java | 39 * predicates to resolve edge set collisions. 43 * an LL(1) DFA. One edge per set. 87 IntervalSet edge = (IntervalSet)it.next(); 88 List<Integer> alts = edgeMap.get(edge); 90 //System.out.println(edge+" -> "+alts); 93 Label e = getLabelForSet(edge);
|
/external/opencv/cv/include/ |
H A D | cvtypes.h | 200 /* get the next edge with the same origin point (counterwise) */ 201 #define CV_SUBDIV2D_NEXT_EDGE( edge ) (((CvQuadEdge2D*)((edge) & ~3))->next[(edge)&3])
|
/external/antlr/antlr-3.4/tool/src/main/resources/org/antlr/tool/templates/dot/ |
H A D | dot.stg | 55 edge(src,target,label,arrowhead) ::= <<
|
/external/tensorflow/tensorflow/compiler/tf2xla/ |
H A D | functionalize_control_flow.cc | 121 // we rewrite the src_output of the corresponding edge to be 0. 341 for (const Edge* edge : frame->loop_cond->out_edges()) { 342 if (!edge->IsControlEdge() && IsSwitch(edge->dst()) && 343 edge->dst_input() == 1) { 344 switches.insert(edge->dst()); 358 // Follow the edge from the Enter to Merge. 407 for (const Edge* edge : arg.merge->out_edges()) { 408 if (edge->dst_input() == 0 && IsSwitch(edge 443 const Edge* edge = possible_exit.front(); local [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/ |
H A D | TestDotTreeGenerator.cs | 65 + @" edge [arrowsize=.5, color=""black"", style=""bold""]" + newline
|
/external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/interpolation/ |
H A D | LoessInterpolator.java | 262 final int edge; 264 edge = ileft; 266 edge = iright; 281 double denom = FastMath.abs(1.0 / (xval[edge] - x)); 392 // The right edge should be adjusted if the next point to the right
|
/external/kernel-headers/original/uapi/linux/ |
H A D | pps.h | 139 int edge; /* selected event type */ member in struct:pps_bind_args
|
/external/swiftshader/src/Shader/ |
H A D | SetupRoutine.hpp | 37 void edge(Pointer<Byte> &primitive, Pointer<Byte> &data, const Int &Xa, const Int &Ya, const Int &Xb, const Int &Yb, Int &q);
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | Splitter.cpp | 74 void splitOutgoing(MachineLoop::Edge &edge) { outSplits.insert(edge); } argument 161 MachineLoop::Edge edge = *osItr; local 162 MachineBasicBlock *outBlock = edge.second; 163 if (ls.isCriticalEdge(edge)) { 164 assert(ls.canSplitEdge(edge) && "Unsplitable critical edge."); 165 outBlock = &ls.splitEdge(edge, loop); 540 bool LoopSplitter::isCriticalEdge(MachineLoop::Edge &edge) { argument 541 assert(edge 547 canSplitEdge(MachineLoop::Edge &edge) argument 559 splitEdge(MachineLoop::Edge &edge, MachineLoop &loop) argument [all...] |
/external/tensorflow/tensorflow/core/graph/ |
H A D | graph_test.cc | 234 // Weird self edge 273 // Connect up the second edge 281 // Check that the second edge can still be retrieved 371 // Convert edge iteration results into a sorted string. 454 // Add a control edge. 455 const Edge* edge = graph_.AddControlEdge(c, a); local 456 ASSERT_TRUE(edge != nullptr); 457 // Check newly-created edge. 458 EXPECT_EQ(edge->src(), c); 459 EXPECT_EQ(edge [all...] |
/external/vulkan-validation-layers/libs/glm/detail/ |
H A D | intrinsic_common.hpp | 75 __m128 sse_stp_ps(__m128 edge, __m128 x);
|