| /external/skia/src/gpu/ |
| D | GrAAConvexPathRenderer.cpp | 351 uint16_t* idxs) { in create_vertices() argument
373 idxs += *i; in create_vertices()
393 idxs[*i + 0] = *v + 0; in create_vertices()
394 idxs[*i + 1] = *v + 2; in create_vertices()
395 idxs[*i + 2] = *v + 1; in create_vertices()
396 idxs[*i + 3] = *v + 0; in create_vertices()
397 idxs[*i + 4] = *v + 3; in create_vertices()
398 idxs[*i + 5] = *v + 2; in create_vertices()
427 idxs[*i + 0] = *v + 0; in create_vertices()
428 idxs[*i + 1] = *v + 2; in create_vertices()
[all …]
|
| /external/chromium_org/third_party/skia/src/gpu/ |
| D | GrAAConvexPathRenderer.cpp | 351 uint16_t* idxs) { in create_vertices() argument
373 idxs += *i; in create_vertices()
393 idxs[*i + 0] = *v + 0; in create_vertices()
394 idxs[*i + 1] = *v + 2; in create_vertices()
395 idxs[*i + 2] = *v + 1; in create_vertices()
396 idxs[*i + 3] = *v + 0; in create_vertices()
397 idxs[*i + 4] = *v + 3; in create_vertices()
398 idxs[*i + 5] = *v + 2; in create_vertices()
427 idxs[*i + 0] = *v + 0; in create_vertices()
428 idxs[*i + 1] = *v + 2; in create_vertices()
[all …]
|
| /external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
| D | node.py | 166 idxs = [0]
169 assert len(nodes)==len(idxs)==len(itemss)
172 assert idxs[-1] == len(items)
173 while idxs[-1]==len(node):
178 idxs.pop(-1)
189 idxs[-1] += 1
190 assert idxs[-1] == len(items)
193 _node = node[ idxs[-1] ]
198 idxs.append( 0 )
203 idxs[-1] += 1
[all …]
|
| /external/chromium_org/third_party/skia/experimental/StrokePathRenderer/ |
| D | GrStrokePathRenderer.cpp | 119 uint16_t* idxs = reinterpret_cast<uint16_t*>(arg.indices()); in onDrawPath() local
227 *idxs++ = idx0; in onDrawPath()
228 *idxs++ = vCount; in onDrawPath()
229 *idxs++ = idx1; in onDrawPath()
250 *idxs++ = vCount+0; in onDrawPath()
251 *idxs++ = vCount+2; in onDrawPath()
252 *idxs++ = vCount+1; in onDrawPath()
254 *idxs++ = vCount+1; in onDrawPath()
255 *idxs++ = vCount+2; in onDrawPath()
256 *idxs++ = vCount+3; in onDrawPath()
|
| /external/skia/experimental/StrokePathRenderer/ |
| D | GrStrokePathRenderer.cpp | 119 uint16_t* idxs = reinterpret_cast<uint16_t*>(arg.indices()); in onDrawPath() local
227 *idxs++ = idx0; in onDrawPath()
228 *idxs++ = vCount; in onDrawPath()
229 *idxs++ = idx1; in onDrawPath()
250 *idxs++ = vCount+0; in onDrawPath()
251 *idxs++ = vCount+2; in onDrawPath()
252 *idxs++ = vCount+1; in onDrawPath()
254 *idxs++ = vCount+1; in onDrawPath()
255 *idxs++ = vCount+2; in onDrawPath()
256 *idxs++ = vCount+3; in onDrawPath()
|
| /external/opencv/cv/src/ |
| D | cvshapedescr.cpp | 179 int idxs[4] = { 0, 1, 2, 3 }; in icvFindEnslosingCicle4pts_32f() local
198 idxs[0] = i; in icvFindEnslosingCicle4pts_32f()
199 idxs[1] = j; in icvFindEnslosingCicle4pts_32f()
210 if( i == idxs[j] ) in icvFindEnslosingCicle4pts_32f()
213 idxs[k++] = i; in icvFindEnslosingCicle4pts_32f()
216 center = cvPoint2D32f( (pts[idxs[0]].x + pts[idxs[1]].x)*0.5f, in icvFindEnslosingCicle4pts_32f()
217 (pts[idxs[0]].y + pts[idxs[1]].y)*0.5f ); in icvFindEnslosingCicle4pts_32f()
218 radius = (float)(icvDistanceL2_32f( pts[idxs[0]], center )*1.03); in icvFindEnslosingCicle4pts_32f()
222 if( icvIsPtInCircle( pts[idxs[2]], center, radius ) >= 0 && in icvFindEnslosingCicle4pts_32f()
223 icvIsPtInCircle( pts[idxs[3]], center, radius ) >= 0 ) in icvFindEnslosingCicle4pts_32f()
[all …]
|
| /external/lldb/include/lldb/Core/ |
| D | ValueObject.h | 757 GetChildAtIndexPath (const std::initializer_list<size_t> &idxs,
761 GetChildAtIndexPath (const std::vector<size_t> &idxs,
765 GetChildAtIndexPath (const std::initializer_list< std::pair<size_t, bool> > &idxs,
769 GetChildAtIndexPath (const std::vector< std::pair<size_t, bool> > &idxs,
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/heap_snapshot_worker/ |
| D | HeapSnapshot.js | 1229 var indexes = aggregate.idxs;
1383 idxs: [nodeIndex] property
1393 clss.idxs.push(nodeIndex);
1400 aggregates[classIndex].idxs = aggregates[classIndex].idxs.slice();
1461 aggregates[clss].idxs.sort(
1793 var indexes = aggregate ? aggregate.idxs : [];
1976 …odesProvider(this, this.classNodesFilter(), this.aggregatesWithFilter(nodeFilter)[className].idxs);
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
| D | HeapSnapshotCommon.js | 172 this.idxs;
|
| /external/lldb/source/Core/ |
| D | ValueObject.cpp | 519 ValueObject::GetChildAtIndexPath (const std::initializer_list<size_t>& idxs, in GetChildAtIndexPath() argument
522 if (idxs.size() == 0) in GetChildAtIndexPath()
525 for (size_t idx : idxs) in GetChildAtIndexPath()
539 ValueObject::GetChildAtIndexPath (const std::initializer_list< std::pair<size_t, bool> >& idxs, in GetChildAtIndexPath() argument
542 if (idxs.size() == 0) in GetChildAtIndexPath()
545 for (std::pair<size_t, bool> idx : idxs) in GetChildAtIndexPath()
559 ValueObject::GetChildAtIndexPath (const std::vector<size_t> &idxs, in GetChildAtIndexPath() argument
562 if (idxs.size() == 0) in GetChildAtIndexPath()
565 for (size_t idx : idxs) in GetChildAtIndexPath()
579 ValueObject::GetChildAtIndexPath (const std::vector< std::pair<size_t, bool> > &idxs, in GetChildAtIndexPath() argument
[all …]
|
| /external/llvm/bindings/ocaml/llvm/ |
| D | llvm_ocaml.c | 828 unsigned* idxs = (unsigned*)malloc(size * sizeof(unsigned)); in llvm_const_extractvalue() local
830 idxs[i] = Int_val(Field(Indices, i)); in llvm_const_extractvalue()
833 result = LLVMConstExtractValue(Aggregate, idxs, size); in llvm_const_extractvalue()
834 free(idxs); in llvm_const_extractvalue()
846 unsigned* idxs = (unsigned*)malloc(size * sizeof(unsigned)); in llvm_const_insertvalue() local
848 idxs[i] = Int_val(Field(Indices, i)); in llvm_const_insertvalue()
851 result = LLVMConstInsertValue(Aggregate, Val, idxs, size); in llvm_const_insertvalue()
852 free(idxs); in llvm_const_insertvalue()
|
| D | llvm.mli | 1183 (** [const_extractvalue agg idxs] returns the constant [idxs]th value of
1184 constant aggregate [agg]. Each [idxs] must be less than the size of the
1188 (** [const_insertvalue agg val idxs] inserts the value [val] in the specified
1189 indexs [idxs] in the aggegate [agg]. Each [idxs] must be less than the size
|