Searched refs:idxs (Results 1 - 13 of 13) sorted by relevance

/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/
H A Dnode.py166 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)
191 #assert idxs[-1] < len(node), str( (node,nodes,idxs,itemss) )
193 _node = node[ idxs[
[all...]
/external/chromium_org/third_party/skia/src/gpu/
H A DGrAAConvexPathRenderer.cpp352 uint16_t* idxs) {
374 idxs += *i;
394 idxs[*i + 0] = *v + 0;
395 idxs[*i + 1] = *v + 2;
396 idxs[*i + 2] = *v + 1;
397 idxs[*i + 3] = *v + 0;
398 idxs[*i + 4] = *v + 3;
399 idxs[*i + 5] = *v + 2;
428 idxs[*i + 0] = *v + 0;
429 idxs[*
348 create_vertices(const SegmentArray& segments, const SkPoint& fanPt, DrawArray* draws, QuadVertex* verts, uint16_t* idxs) argument
661 uint16_t* idxs; local
[all...]
/external/skia/src/gpu/
H A DGrAAConvexPathRenderer.cpp351 uint16_t* idxs) {
373 idxs += *i;
393 idxs[*i + 0] = *v + 0;
394 idxs[*i + 1] = *v + 2;
395 idxs[*i + 2] = *v + 1;
396 idxs[*i + 3] = *v + 0;
397 idxs[*i + 4] = *v + 3;
398 idxs[*i + 5] = *v + 2;
427 idxs[*i + 0] = *v + 0;
428 idxs[*
347 create_vertices(const SegmentArray& segments, const SkPoint& fanPt, DrawArray* draws, QuadVertex* verts, uint16_t* idxs) argument
654 uint16_t* idxs; local
[all...]
/external/chromium_org/third_party/skia/experimental/StrokePathRenderer/
H A DGrStrokePathRenderer.cpp119 uint16_t* idxs = reinterpret_cast<uint16_t*>(arg.indices()); local
227 *idxs++ = idx0;
228 *idxs++ = vCount;
229 *idxs++ = idx1;
250 *idxs++ = vCount+0;
251 *idxs++ = vCount+2;
252 *idxs++ = vCount+1;
254 *idxs++ = vCount+1;
255 *idxs++ = vCount+2;
256 *idxs
[all...]
/external/skia/experimental/StrokePathRenderer/
H A DGrStrokePathRenderer.cpp119 uint16_t* idxs = reinterpret_cast<uint16_t*>(arg.indices()); local
227 *idxs++ = idx0;
228 *idxs++ = vCount;
229 *idxs++ = idx1;
250 *idxs++ = vCount+0;
251 *idxs++ = vCount+2;
252 *idxs++ = vCount+1;
254 *idxs++ = vCount+1;
255 *idxs++ = vCount+2;
256 *idxs
[all...]
/external/opencv/cv/src/
H A Dcvshapedescr.cpp179 int idxs[4] = { 0, 1, 2, 3 }; local
198 idxs[0] = i;
199 idxs[1] = j;
210 if( i == idxs[j] )
213 idxs[k++] = i;
216 center = cvPoint2D32f( (pts[idxs[0]].x + pts[idxs[1]].x)*0.5f,
217 (pts[idxs[0]].y + pts[idxs[1]].y)*0.5f );
218 radius = (float)(icvDistanceL2_32f( pts[idxs[
[all...]
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
H A DHeapSnapshotCommon.js172 this.idxs;
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/heap_snapshot_worker/
H A DHeapSnapshot.js1213 var indexes = aggregate.idxs;
1377 idxs: [nodeIndex]
1387 clss.idxs.push(nodeIndex);
1394 aggregates[classIndex].idxs = aggregates[classIndex].idxs.slice();
1455 aggregates[clss].idxs.sort(
1787 var indexes = aggregate ? aggregate.idxs : [];
1953 return new WebInspector.HeapSnapshotNodesProvider(this, this.classNodesFilter(), this.aggregatesWithFilter(nodeFilter)[className].idxs);
/external/lldb/include/lldb/Core/
H A DValueObject.h757 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/llvm/bindings/ocaml/llvm/
H A Dllvm_ocaml.c828 unsigned* idxs = (unsigned*)malloc(size * sizeof(unsigned)); local
830 idxs[i] = Int_val(Field(Indices, i));
833 result = LLVMConstExtractValue(Aggregate, idxs, size);
834 free(idxs);
846 unsigned* idxs = (unsigned*)malloc(size * sizeof(unsigned)); local
848 idxs[i] = Int_val(Field(Indices, i));
851 result = LLVMConstInsertValue(Aggregate, Val, idxs, size);
852 free(idxs);
H A Dllvm.mli1183 (** [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
/external/lldb/source/Core/
H A DValueObject.cpp519 ValueObject::GetChildAtIndexPath (const std::initializer_list<size_t>& idxs, argument
522 if (idxs.size() == 0)
525 for (size_t idx : idxs)
539 ValueObject::GetChildAtIndexPath (const std::initializer_list< std::pair<size_t, bool> >& idxs, argument
542 if (idxs.size() == 0)
545 for (std::pair<size_t, bool> idx : idxs)
559 ValueObject::GetChildAtIndexPath (const std::vector<size_t> &idxs, argument
562 if (idxs.size() == 0)
565 for (size_t idx : idxs)
579 ValueObject::GetChildAtIndexPath (const std::vector< std::pair<size_t, bool> > &idxs, argument
[all...]
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/
H A Dcom.ibm.icu_4.2.1.v20100412.jarMETA-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ...

Completed in 326 milliseconds