| /external/bison/doc/figs/ |
| example-reduce.dot | 8 "1R3" [style=filled shape=diamond fillcolor=yellowgreen label="R3"]
10 "1R4" [style=filled shape=diamond fillcolor=yellowgreen label="R4"]
|
| example.dot | 17 "1R3" [label="R3", fillcolor=3, shape=diamond, style=filled]
19 "1R4" [label="R4", fillcolor=3, shape=diamond, style=filled]
28 "5R0" [label="Acc", fillcolor=1, shape=diamond, style=filled]
31 "6R1" [label="R1", fillcolor=3, shape=diamond, style=filled]
34 "7R2" [label="R2", fillcolor=3, shape=diamond, style=filled]
|
| /external/v8/test/unittests/compiler/ |
| diamond-unittest.cc | 6 #include "src/compiler/diamond.h"
27 Diamond d(graph(), common(), p);
38 Diamond d0(graph(), common(), p0);
39 Diamond d1(graph(), common(), p1);
48 Diamond d1(graph(), common(), p1);
58 Diamond d[5] = {Diamond(graph(), common(), params[0]),
59 Diamond(graph(), common(), params[1]),
60 Diamond(graph(), common(), params[2]),
61 Diamond(graph(), common(), params[3])
[all...] |
| register-allocator-unittest.cc | 222 // First diamond.
236 // Second diamond.
401 // Outer diamond.
405 // Diamond 1
421 // Diamond 2
437 // Outer diamond merge.
448 // Outer diamond.
452 // Diamond 1
468 // Diamond 2
484 // Outer diamond merge
[all...] |
| /external/llvm/test/Analysis/LoopAccessAnalysis/ |
| nullptr.ll | 4 ; The analyzer uses to be confused by the "diamond" because GetUnderlyingObjects
17 br i1 %cond, label %.preheader, label %diamond
19 diamond: ; preds = %.noexc.i.i
22 .preheader: ; preds = %diamond, %0
23 %ptr1_or_null = phi i32* [ null, %0 ], [ %ptr1, %diamond ]
24 %ptr2_or_null = phi i32* [ null, %0 ], [ %ptr2, %diamond ]
|
| /external/v8/src/compiler/ |
| diamond.h | 16 // A helper to make it easier to build diamond-shaped control patterns.
17 struct Diamond {
25 Diamond(Graph* g, CommonOperatorBuilder* b, Node* cond,
36 void Chain(Diamond& that) { branch->ReplaceInput(1, that.merge); }
42 void Nest(Diamond& that, bool if_true) {
|
| select-lowering.cc | 8 #include "src/compiler/diamond.h"
35 // Check if we already have a diamond for this condition.
39 // Create a new diamond for this condition and remember its merge node.
40 Diamond d(graph(), common(), cond, p.hint());
46 // If the diamond is reachable from the Select, merging them would result in
47 // an unschedulable graph, so we cannot reuse the diamond in that case.
|
| /external/skia/gyp/ |
| dm.gyp | 5 # GYP for "dm" (Diamond Master, a.k.a Dungeon master, a.k.a GM 2).
|
| dm.gypi | 5 # GYP for "dm" (Diamond Master, a.k.a Dungeon master, a.k.a GM 2).
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/ |
| ArrowType.java | 31 DIAMOND("diamond"),
|
| /external/libavc/encoder/ |
| ime.h | 45 * @brief Number of iterations before exiting during diamond search
72 * @brief Diamond Search
75 * This function computes the sad at vertices of several layers of diamond grid
76 * at a time. The number of layers of diamond grid that would be evaluated is
77 * configurable.The function computes the sad at vertices of a diamond grid. If
78 * the sad at the center of the diamond grid is lesser than the sad at any other
79 * point of the diamond grid, the function marks the candidate Mb partition as
|
| /external/bison/tests/ |
| output.at | 271 "0R2" [label="R2", fillcolor=3, shape=diamond, style=filled]
278 "3R0" [label="Acc", fillcolor=1, shape=diamond, style=filled]
284 "5R3" [label="R3", fillcolor=3, shape=diamond, style=filled]
287 "6R1" [label="R1", fillcolor=3, shape=diamond, style=filled]
318 "0R7d" [label="R7", fillcolor=5, shape=diamond, style=filled]
320 "0R8d" [label="R8", fillcolor=5, shape=diamond, style=filled]
322 "0R9d" [label="R9", fillcolor=5, shape=diamond, style=filled]
325 "1R1" [label="R1", fillcolor=3, shape=diamond, style=filled]
328 "2R3" [label="R3", fillcolor=3, shape=diamond, style=filled]
331 "3R5" [label="R5", fillcolor=3, shape=diamond, style=filled
[all...] |
| /external/skia/site/dev/testing/ |
| index.md | 5 are served by our Diamond Master \(DM\) test tool, for correctness testing.
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
| p5-var.cpp | 12 struct Diamond : Derived, Derived2 { };
53 Diamond diamond,
62 Base &br5 = diamond; // expected-error{{ambiguous conversion from derived class 'Diamond' to base class 'Base':}}
|
| /external/chromium-trace/catapult/third_party/flot/ |
| jquery.flot.symbol.js | 10 symbol: "square" // or "diamond", "triangle", "cross"
27 diamond: function (ctx, x, y, radius, shadow) {
26 }, method
|
| jquery.flot.symbol.min.js | 7 (function($){function processRawData(plot,series,datapoints){var handlers={square:function(ctx,x,y,radius,shadow){var size=radius*Math.sqrt(Math.PI)/2;ctx.rect(x-size,y-size,size+size,size+size)},diamond:function(ctx,x,y,radius,shadow){var size=radius*Math.sqrt(Math.PI/2);ctx.moveTo(x-size,y);ctx.line (…) method
|
| /external/clang/test/Modules/ |
| diamond-pch.c | 6 // RUN: %clang_cc1 -fmodules -fimplicit-module-maps -x objective-c -emit-pch -fmodules-cache-path=%t -I %S/Inputs -o %t.pch %S/Inputs/diamond.h
19 // Names in multiple places in the diamond.
|
| /external/clang/test/SemaCXX/ |
| warn-reorder-ctor-initialization.cpp | 37 struct Diamond : public A, public B {
38 Diamond() : A(), B() {}
|
| /external/skia/tests/ |
| TopoSortTest.cpp | 16 /* Simple diamond
62 /* Double diamond
|
| /external/clang/test/CodeGenCXX/ |
| microsoft-abi-virtual-inheritance.cpp | 259 namespace diamond { namespace
286 // CHECK-LABEL: define x86_thiscallcc void @"\01??1D@diamond@@UAE@XZ"(%"struct.diamond::D"*)
287 // CHECK: %[[ARG_i8:.*]] = bitcast %"struct.diamond::D"* %{{.*}} to i8*
289 // CHECK: %[[THIS:.*]] = bitcast i8* %[[THIS_i8]] to %"struct.diamond::D"*
290 // CHECK: store %"struct.diamond::D"* %[[THIS]], %"struct.diamond::D"** %[[THIS_VAL:.*]], align 4
291 // CHECK: %[[THIS:.*]] = load %"struct.diamond::D"*, %"struct.diamond::D"** %[[THIS_VAL]]
292 // CHECK: %[[D_i8:.*]] = bitcast %"struct.diamond::D"* %[[THIS]] to i8
[all...] |
| rtti-layout.cpp | 138 // VMI5 has non-diamond shaped inheritance.
147 // VMI6 has diamond shaped inheritance.
156 // VMI7 has both non-diamond and diamond shaped inheritance.
|
| /art/compiler/optimizing/ |
| select_generator.h | 18 * This optimization recognizes the common diamond selection pattern and
|
| /external/llvm/lib/Transforms/Scalar/ |
| MergedLoadStoreMotion.cpp | 12 // diamond (hammock). It hoists the loads and sinks the stores.
15 // diamond (hammock) and merges them into a single load in the header. Similar
17 // iterates over the instructions of one side of the diamond and attempts to
26 // Diamond shaped code before merge:
45 // Diamond shaped code after merge:
156 // the diamond. The constant chosen here is arbitrary. Compiler Time
197 /// \brief Return tail block of a diamond.
200 assert(isDiamondHead(BB) && "Basic block is not head of a diamond");
208 /// \brief True when BB is the head of a diamond (hammock)
286 /// BB is the head of a diamond
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| 2013-10-11-select-stalls.ll | 2 ; RUN: llc < %s -mtriple=thumbv7-apple-ios -disable-ifcvt-diamond -stats 2>&1 | FileCheck %s
|
| /external/autotest/client/deps/glbench/src/ |
| glinterfacetest.cc | 26 // Vertex arrays used to draw a diamond.
|
