| /external/libxml2/result/ |
| D | svg3.rdr | 4 1 1 g 0 0
10 1 15 g 0 0
13 1 1 g 0 0
19 1 15 g 0 0
22 1 1 g 0 0
28 1 15 g 0 0
31 1 1 g 0 0
37 1 15 g 0 0
40 1 1 g 0 0
46 1 15 g 0 0
[all …]
|
| D | svg3.rde | 4 1 1 g 0 0
10 1 15 g 0 0
13 1 1 g 0 0
19 1 15 g 0 0
22 1 1 g 0 0
28 1 15 g 0 0
31 1 1 g 0 0
37 1 15 g 0 0
40 1 1 g 0 0
46 1 15 g 0 0
[all …]
|
| D | svg2.rdr | 5 1 1 g 0 0
14 1 15 g 0 0
17 1 1 g 0 0
23 1 15 g 0 0
26 1 1 g 0 0
29 1 15 g 0 0
32 1 1 g 0 0
38 1 15 g 0 0
41 1 1 g 0 0
47 1 15 g 0 0
[all …]
|
| D | svg2.rde | 5 1 1 g 0 0
14 1 15 g 0 0
17 1 1 g 0 0
23 1 15 g 0 0
26 1 1 g 0 0
29 1 15 g 0 0
32 1 1 g 0 0
38 1 15 g 0 0
41 1 1 g 0 0
47 1 15 g 0 0
[all …]
|
| /external/vulkan-validation-layers/demos/ |
| D | lunarg.ppm | 9 \g
10 \g
11 \g
35 …g&^g&^e%]d%]d$[c#Zc#Yc#Yb#Xa"Xa"W`"W`"V_"V_"U]!U] S[ R[ R[ R[ RZ QY QY PX OW OW MU MU MT LT LS KR …
47 …uuuuuuuuuuuuuuuuuuuuuuuuuuuuuuuucsv `m[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g…
57 …g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[gZfZfZfZfZfZfZf…
68 …g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[gZfZfZfZfZfZfZf…
79 …g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[g[gZfZfZfZfZfZfZf…
|
| /external/skia/third_party/lua/src/ |
| D | lgc.c | 59 #define makewhite(g,x) \ argument
60 (gch(x)->marked = cast_byte((gch(x)->marked & maskcolors) | luaC_white(g)))
75 #define markvalue(g,o) { checkconsistency(o); \ argument
76 if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); }
78 #define markobject(g,t) { if ((t) && iswhite(obj2gco(t))) \ argument
79 reallymarkobject(g, obj2gco(t)); }
81 static void reallymarkobject (global_State *g, GCObject *o);
121 static int iscleared (global_State *g, const TValue *o) { in iscleared() argument
124 markobject(g, rawtsvalue(o)); /* strings are `values', so are never weak */ in iscleared()
136 global_State *g = G(L); in luaC_barrier_() local
[all …]
|
| /external/syslinux/com32/lua/src/ |
| D | lgc.c | 59 #define makewhite(g,x) \ argument
60 (gch(x)->marked = cast_byte((gch(x)->marked & maskcolors) | luaC_white(g)))
75 #define markvalue(g,o) { checkconsistency(o); \ argument
76 if (valiswhite(o)) reallymarkobject(g,gcvalue(o)); }
78 #define markobject(g,t) { if ((t) && iswhite(obj2gco(t))) \ argument
79 reallymarkobject(g, obj2gco(t)); }
81 static void reallymarkobject (global_State *g, GCObject *o);
121 static int iscleared (global_State *g, const TValue *o) { in iscleared() argument
124 markobject(g, rawtsvalue(o)); /* strings are `values', so are never weak */ in iscleared()
136 global_State *g = G(L); in luaC_barrier_() local
[all …]
|
| /external/antlr/antlr-3.4/tool/src/test/java/org/antlr/test/ |
| D | TestNFAConstruction.java | 42 Grammar g = new Grammar( in testA() local
51 checkRule(g, "a", expecting); in testA()
55 Grammar g = new Grammar( in testAB() local
65 checkRule(g, "a", expecting); in testAB()
69 Grammar g = new Grammar( in testAorB() local
88 checkRule(g, "a", expecting); in testAorB()
92 Grammar g = new Grammar( in testRangeOrRange() local
110 checkRule(g, "A", expecting); in testRangeOrRange()
114 Grammar g = new Grammar( in testRange() local
124 checkRule(g, "A", expecting); in testRange()
[all …]
|
| D | TestCharDFAConversion.java | 47 Grammar g = new Grammar( in testSimpleRangeVersusChar() local
50 g.createLookaheadDFAs(); in testSimpleRangeVersusChar()
56 checkDecision(g, 1, expecting, null); in testSimpleRangeVersusChar()
60 Grammar g = new Grammar( in testRangeWithDisjointSet() local
65 g.createLookaheadDFAs(); in testRangeWithDisjointSet()
73 checkDecision(g, 1, expecting, null); in testRangeWithDisjointSet()
77 Grammar g = new Grammar( in testDisjointSetCollidingWithTwoRanges() local
82 g.createLookaheadDFAs(false); in testDisjointSetCollidingWithTwoRanges()
90 checkDecision(g, 1, expecting, null); in testDisjointSetCollidingWithTwoRanges()
94 Grammar g = new Grammar( in testDisjointSetCollidingWithTwoRangesCharsFirst() local
[all …]
|
| D | TestTopologicalSort.java | 39 Graph g = new Graph(); in testFairlyLargeGraph() local
40 g.addEdge("C", "F"); in testFairlyLargeGraph()
41 g.addEdge("C", "G"); in testFairlyLargeGraph()
42 g.addEdge("C", "A"); in testFairlyLargeGraph()
43 g.addEdge("C", "B"); in testFairlyLargeGraph()
44 g.addEdge("A", "D"); in testFairlyLargeGraph()
45 g.addEdge("A", "E"); in testFairlyLargeGraph()
46 g.addEdge("B", "E"); in testFairlyLargeGraph()
47 g.addEdge("D", "E"); in testFairlyLargeGraph()
48 g.addEdge("D", "F"); in testFairlyLargeGraph()
[all …]
|
| D | TestSemanticPredicates.java | 49 Grammar g = new Grammar( in testPredsButSyntaxResolves() local
55 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testPredsButSyntaxResolves()
59 Grammar g = new Grammar( in testLL_1_Pred() local
66 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testLL_1_Pred()
71 Grammar g = new Grammar( in testLL_1_Pred_forced_k_1() local
78 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testLL_1_Pred_forced_k_1()
82 Grammar g = new Grammar( in testLL_2_Pred() local
90 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testLL_2_Pred()
94 Grammar g = new Grammar( in testPredicatedLoop() local
102 checkDecision(g, 1, expecting, null, null, null, null, null, 0, false); in testPredicatedLoop()
[all …]
|
| D | TestASTConstruction.java | 40 Grammar g = new Grammar( in testA() local
45 String found = g.getRule("a").tree.toStringTree(); in testA()
50 Grammar g = new Grammar( in testEmptyAlt() local
55 String found = g.getRule("a").tree.toStringTree(); in testEmptyAlt()
60 Grammar g = new Grammar( in testNakeRulePlusInLexer() local
66 String found = g.getRule("A").tree.toStringTree(); in testNakeRulePlusInLexer()
71 Grammar g = new Grammar( in testRulePlus() local
77 String found = g.getRule("a").tree.toStringTree(); in testRulePlus()
82 Grammar g = new Grammar( in testNakedRulePlus() local
88 String found = g.getRule("a").tree.toStringTree(); in testNakedRulePlus()
[all …]
|
| /external/compiler-rt/lib/asan/ |
| D | asan_globals.cc | 34 const Global *g; member
44 Global g; member
59 ALWAYS_INLINE void PoisonShadowForGlobal(const Global *g, u8 value) { in PoisonShadowForGlobal() argument
60 FastPoisonShadow(g->beg, g->size_with_redzone, value); in PoisonShadowForGlobal()
63 ALWAYS_INLINE void PoisonRedZones(const Global &g) { in PoisonRedZones() argument
64 uptr aligned_size = RoundUpTo(g.size, SHADOW_GRANULARITY); in PoisonRedZones()
65 FastPoisonShadow(g.beg + aligned_size, g.size_with_redzone - aligned_size, in PoisonRedZones()
67 if (g.size != aligned_size) { in PoisonRedZones()
69 g.beg + RoundDownTo(g.size, SHADOW_GRANULARITY), in PoisonRedZones()
70 g.size % SHADOW_GRANULARITY, in PoisonRedZones()
[all …]
|
| /external/libxml2/test/ |
| D | svg3 | 2 <g style="fill: #ffffff; stroke:#000000; stroke-width:0.172">
4 </g>
5 <g style="fill: #ffffff; stroke:#000000; stroke-width:0.172">
7 </g>
8 <g style="fill: #ffffff; stroke:#000000; stroke-width:0.172">
10 </g>
11 <g style="fill: #ffffff; stroke:#000000; stroke-width:0.172">
13 </g>
14 <g style="fill: #ffffff; stroke:#000000; stroke-width:0.172">
16 </g>
[all …]
|
| /external/skia/src/gpu/ccpr/ |
| D | GrCCPRCubicProcessor.cpp | 78 void GrCCPRCubicProcessor::emitWind(GrGLSLGeometryBuilder* g, const char* rtAdjust, in emitWind() argument
81 g->codeAppend ("highp float area_times_2 = determinant(mat3(1, bezierpts[0], " in emitWind()
85 g->codeAppendf("if (2 * abs(area_times_2) < length((bezierpts[3] - bezierpts[0]) * %s.zx)) {", in emitWind()
88 g->codeAppend ( "return;"); in emitWind()
91 g->codeAppend ( "area_times_2 = 0;"); in emitWind()
93 g->codeAppend ("}"); in emitWind()
94 g->codeAppendf("%s = sign(area_times_2);", outputWind); in emitWind()
97 void GrCCPRCubicProcessor::onEmitGeometryShader(GrGLSLGeometryBuilder* g, const char* emitVertexFn, in onEmitGeometryShader() argument
100 g->codePrependf("highp mat4x2 bezierpts = mat4x2(sk_in[0].gl_Position.xy, " in onEmitGeometryShader()
106 g->codeAppendf("highp vec2 midpoint = bezierpts * vec4(.125, .375, .375, .125);"); in onEmitGeometryShader()
[all …]
|
| D | GrCCPRCoverageProcessor.cpp | 130 GrGLSLGeometryBuilder* g, const char* rtAdjust) const { in emitGeometryShader() argument
131 g->declareGlobal(fGeomWind); in emitGeometryShader()
132 this->emitWind(g, rtAdjust, fGeomWind.c_str()); in emitGeometryShader()
142 g->emitFunction(kVoid_GrSLType, "emitVertex", emitArgs.count(), emitArgs.begin(), [&]() { in emitGeometryShader()
157 g->codeAppendf("highp vec2 bloat = %f * abs(%s.xz);", kAABloatRadius, rtAdjust); in emitGeometryShader()
161 g->codeAppendf("bloat *= %f;", GrCCPRCoverageProcessor::kDebugBloat); in emitGeometryShader()
165 return this->onEmitGeometryShader(g, emitVertexFn.c_str(), fGeomWind.c_str(), rtAdjust); in emitGeometryShader()
168 int PrimitiveProcessor::emitHullGeometry(GrGLSLGeometryBuilder* g, const char* emitVertexFn, in emitHullGeometry() argument
174 g->codeAppendf("highp vec2 centroidpt = %s * vec%i(%f);", in emitHullGeometry()
178 g->codeAppendf("int previdx = (%s + %i) %% %i, " in emitHullGeometry()
[all …]
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_bvgraph_test.cc | 33 void PrintGraph(const G &g) { in PrintGraph() argument
34 for (uptr i = 0; i < g.size(); i++) { in PrintGraph()
35 for (uptr j = 0; j < g.size(); j++) { in PrintGraph()
36 fprintf(stderr, "%d", g.hasEdge(i, j)); in PrintGraph()
53 void checkSameAs(G *g) { in checkSameAs() argument
57 EXPECT_TRUE(g->removeEdge(from, to)); in checkSameAs()
59 EXPECT_TRUE(g->empty()); in checkSameAs()
71 BVGraph<BV> g; in BasicTest() local
72 g.clear(); in BasicTest()
82 uptr idx = (uptr)my_rand() % g.size(); in BasicTest()
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | formatfloat_testcases.txt | 221 -- 'g' code formatting.
224 %.0g 0 -> 0
225 %.1g 0 -> 0
226 %.2g 0 -> 0
227 %.3g 0 -> 0
228 %.4g 0 -> 0
229 %.10g 0 -> 0
230 %.50g 0 -> 0
231 %.100g 0 -> 0
233 -- precision 0 doesn't make a lot of sense for the 'g' code (what does
[all …]
|
| /external/mesa3d/src/util/ |
| D | register_allocate.c | 391 ra_add_node_adjacency(struct ra_graph *g, unsigned int n1, unsigned int n2) in ra_add_node_adjacency() argument
393 BITSET_SET(g->nodes[n1].adjacency, n2); in ra_add_node_adjacency()
396 int n1_class = g->nodes[n1].class; in ra_add_node_adjacency()
397 int n2_class = g->nodes[n2].class; in ra_add_node_adjacency()
398 g->nodes[n1].q_total += g->regs->classes[n1_class]->q[n2_class]; in ra_add_node_adjacency()
401 if (g->nodes[n1].adjacency_count >= in ra_add_node_adjacency()
402 g->nodes[n1].adjacency_list_size) { in ra_add_node_adjacency()
403 g->nodes[n1].adjacency_list_size *= 2; in ra_add_node_adjacency()
404 g->nodes[n1].adjacency_list = reralloc(g, g->nodes[n1].adjacency_list, in ra_add_node_adjacency()
406 g->nodes[n1].adjacency_list_size); in ra_add_node_adjacency()
[all …]
|
| /external/v8/src/compiler/x87/ |
| D | instruction-selector-x87.cc | 206 X87OperandGenerator g(this); in VisitLoad() local
208 outputs[0] = g.DefineAsRegister(node); in VisitLoad()
212 g.GetEffectiveAddressMemoryOperand(node, inputs, &input_count); in VisitLoad()
223 X87OperandGenerator g(this); in VisitStore() local
237 inputs[input_count++] = g.UseUniqueRegister(base); in VisitStore()
238 if (g.CanBeImmediate(index)) { in VisitStore()
239 inputs[input_count++] = g.UseImmediate(index); in VisitStore()
242 inputs[input_count++] = g.UseUniqueRegister(index); in VisitStore()
245 inputs[input_count++] = g.UseUniqueRegister(value); in VisitStore()
261 InstructionOperand temps[] = {g.TempRegister(), g.TempRegister()}; in VisitStore()
[all …]
|
| /external/clang/utils/VtableTest/ |
| D | gen.cc | 20 void g(const char *c) { in g() function
24 void g(int i) { in g() function
82 g("struct s"); in gs()
84 g("class s"); in gs()
85 g(s); in gs()
97 g(": "); in gs()
99 g(", "); in gs()
103 g("virtual "); in gs()
115 g("public "); break; in gs()
122 g("private "); break; in gs()
[all …]
|
| /external/testng/src/test/java/test/ |
| D | GraphTest.java | 21 Graph<String> g = new Graph<>(); in sort() local
22 g.addNode("3"); in sort()
23 g.addNode("1"); in sort()
24 g.addNode("2.2"); in sort()
25 g.addNode("independent"); in sort()
26 g.addNode("2.1"); in sort()
27 g.addNode("2"); in sort()
29 g.addPredecessor("3", "2"); in sort()
30 g.addPredecessor("3", "2.1"); in sort()
31 g.addPredecessor("3", "2.2"); in sort()
[all …]
|
| /external/v8/src/compiler/mips/ |
| D | instruction-selector-mips.cc | 125 MipsOperandGenerator g(selector); in VisitRRR() local
126 selector->Emit(opcode, g.DefineAsRegister(node), in VisitRRR()
127 g.UseRegister(node->InputAt(0)), in VisitRRR()
128 g.UseRegister(node->InputAt(1))); in VisitRRR()
134 MipsOperandGenerator g(selector); in VisitRR() local
135 selector->Emit(opcode, g.DefineAsRegister(node), in VisitRR()
136 g.UseRegister(node->InputAt(0))); in VisitRR()
142 MipsOperandGenerator g(selector); in VisitRRO() local
143 selector->Emit(opcode, g.DefineAsRegister(node), in VisitRRO()
144 g.UseRegister(node->InputAt(0)), in VisitRRO()
[all …]
|
| /external/fio/engines/ |
| D | glusterfs.c | 38 struct gf_data *g = NULL; in fio_gf_setup() local
47 g = malloc(sizeof(struct gf_data)); in fio_gf_setup()
48 if (!g) { in fio_gf_setup()
52 g->fs = NULL; in fio_gf_setup()
53 g->fd = NULL; in fio_gf_setup()
54 g->aio_events = NULL; in fio_gf_setup()
56 g->fs = glfs_new(opt->gf_vol); in fio_gf_setup()
57 if (!g->fs) { in fio_gf_setup()
61 glfs_set_logging(g->fs, "/tmp/fio_gfapi.log", 7); in fio_gf_setup()
63 r = glfs_set_volfile_server(g->fs, "tcp", opt->gf_brick, 0); in fio_gf_setup()
[all …]
|
| /external/v8/src/compiler/mips64/ |
| D | instruction-selector-mips64.cc | 139 Mips64OperandGenerator g(selector); in VisitRR() local
140 selector->Emit(opcode, g.DefineAsRegister(node), in VisitRR()
141 g.UseRegister(node->InputAt(0))); in VisitRR()
147 Mips64OperandGenerator g(selector); in VisitRRR() local
148 selector->Emit(opcode, g.DefineAsRegister(node), in VisitRRR()
149 g.UseRegister(node->InputAt(0)), in VisitRRR()
150 g.UseRegister(node->InputAt(1))); in VisitRRR()
156 Mips64OperandGenerator g(selector); in VisitRRO() local
157 selector->Emit(opcode, g.DefineAsRegister(node), in VisitRRO()
158 g.UseRegister(node->InputAt(0)), in VisitRRO()
[all …]
|