Searched refs:index1 (Results 1 - 25 of 63) sorted by relevance

123

/external/skia/src/core/
H A DSkLineClipper.cpp88 int index0, index1; local
92 index1 = 1;
95 index1 = 0;
105 if (tmp[index1].fY > clip.fBottom) {
106 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom);
111 index1 = 1;
114 index1 = 0;
118 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) &&
119 tmp[index0].fX < tmp[index1].fX) {
127 if (tmp[index1]
153 int index0, index1; local
[all...]
/external/webkit/Source/WebCore/platform/graphics/
H A DGlyphBuffer.h93 void swap(int index1, int index2) argument
95 const SimpleFontData* f = m_fontData[index1];
96 m_fontData[index1] = m_fontData[index2];
99 GlyphBufferGlyph g = m_glyphs[index1];
100 m_glyphs[index1] = m_glyphs[index2];
103 GlyphBufferAdvance s = m_advances[index1];
104 m_advances[index1] = m_advances[index2];
108 FloatSize offset = m_offsets[index1];
109 m_offsets[index1] = m_offsets[index2];
/external/chromium/chrome/browser/autofill/crypto/
H A Drc4_decryptor.h62 uint8 index1 = 0; local
74 index2 = (key_data[index1] + state[counter] + index2) % kKeyDataSize;
76 index1 = (index1 + 1) % key_data_len;
/external/icu4c/common/
H A Dutrie2_impl.h143 int32_t index1[UNEWTRIE2_INDEX_1_LENGTH]; member in struct:UNewTrie2
H A Dutrie2_builder.c215 newTrie->index1[i]=j;
220 newTrie->index1[i]=UNEWTRIE2_INDEX_2_NULL_OFFSET;
252 uprv_memcpy(trie->index1, other->index1, sizeof(trie->index1));
466 i2=trie->index1[c>>UTRIE2_SHIFT_1]+
501 i2=trie->index1[i1];
507 trie->index1[i1]=i2;
926 i2Block=trie->index1[--i1];
1149 trie->index1[
[all...]
/external/proguard/src/proguard/
H A DInputReader.java152 for (int index1 = 0; index1 < inputClassPath.size(); index1++)
154 ClassPathEntry entry1 = inputClassPath.get(index1);
/external/quake/quake/src/QW/client/
H A Dd_polyse.c186 finalvert_t *pfv, *index0, *index1, *index2; local
197 index1 = pfv + ptri[i].vertindex[1];
200 if (((index0->v[1]-index1->v[1]) *
202 (index0->v[0]-index1->v[0]) *
212 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
219 s1 = index1->v[2];
224 if (index1->flags & ALIAS_ONSEAM)
225 index1->v[2] += r_affinetridesc.seamfixupX16;
229 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
232 index1
247 finalvert_t *pfv, *index0, *index1, *index2; local
[all...]
/external/quake/quake/src/WinQuake/
H A Dd_polyse.cpp186 finalvert_t *pfv, *index0, *index1, *index2; local
197 index1 = pfv + ptri[i].vertindex[1];
200 if (((index0->v[1]-index1->v[1]) *
202 (index0->v[0]-index1->v[0]) *
212 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
219 s1 = index1->v[2];
224 if (index1->flags & ALIAS_ONSEAM)
225 index1->v[2] += r_affinetridesc.seamfixupX16;
229 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
232 index1
247 finalvert_t *pfv, *index0, *index1, *index2; local
[all...]
/external/dexmaker/src/dx/java/com/android/dx/dex/file/
H A DAnnotationItem.java71 int index1 = item1.type.getIndex();
74 if (index1 < index2) {
76 } else if (index1 > index2) {
/external/chromium/chrome/browser/resources/shared/js/cr/ui/table/
H A Dtable_data_model.js247 return function(index1, index2) {
248 var item1 = this.getItemByUnsortedIndex_(index1);
254 return dirMultiplier * this.defaultValuesCompareFunction(index1,
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DDOM2Helper.java236 int index1 = ((DOMOrder) node1).getUid();
239 return index1 <= index2;
/external/jmonkeyengine/engine/src/core/com/jme3/math/
H A DEigen3f.java183 * @param index1
187 private void computeVectors(Matrix3f mat, Vector3f vect, int index1, argument
233 p00 = eigenValues[index1] - vect.dot(tempVect);
235 p11 = eigenValues[index1] - vectorS.dot(mat.mult(vectorS));
253 eigenVectors[index1] = vect.mult(p01).add(vectorS.mult(p00));
258 eigenVectors[index1] = vect.mult(p11).add(vectorS.mult(p01));
262 eigenVectors[index1].set(vectorS);
264 eigenVectors[index1].set(vect);
268 eigenVectors[index3].cross(eigenVectors[index1], eigenVectors[index2]);
/external/opencv/cvaux/src/
H A Ddecomppoly.cpp150 int index1, index2, index3;
182 index1 = 0;
185 x1 = contour[ index1 ].x;
186 y1 = contour[ index1 ].y;
240 outEdges[ (*numEdges) * 2 ] = index1;
264 begIndex = index1;
266 index1 = index2;
293 begIndex = index1;
295 index1 = index2;
/external/freetype/src/pshinter/
H A Dpshrec.c375 FT_Int index1,
378 PS_Mask mask1 = table->masks + index1;
407 FT_Int index1,
415 /* swap index1 and index2 so that index1 < index2 */
416 if ( index1 > index2 )
418 temp = index1;
419 index1 = index2;
423 if ( index1 < index2 && index1 >
374 ps_mask_table_test_intersect( PS_Mask_Table table, FT_Int index1, FT_Int index2 ) argument
406 ps_mask_table_merge( PS_Mask_Table table, FT_Int index1, FT_Int index2, FT_Memory memory ) argument
501 FT_Int index1, index2; local
[all...]
/external/v8/test/cctest/
H A Dtest-liveedit.cc53 bool Equals(int index1, int index2) { argument
54 return s1_[index1] == s2_[index2];
/external/dropbear/libtommath/
H A Dbooker.pl45 $index1{@m[1]} = $chapter;
190 $a = $index1{$word};
/external/v8/src/
H A Dliveedit.h152 virtual bool Equals(int index1, int index2) = 0;
/external/skia/src/gpu/
H A DGrTesselatedPathRenderer.cpp172 void addEdge(int index0, int index1) { argument
174 GrPoint q = fVertices[index1];
182 fEdges[index1 * 2] = edge;
553 int index1 = indices[i + 1]; local
556 tri_verts[1] = vertices[index1];
562 const GrDrawState::Edge& edge2 = edges[index1 * 2];
563 const GrDrawState::Edge& edge3 = edges[index1 * 2 + 1];
/external/freetype/src/psaux/
H A Dafmparse.c667 FT_ULong index1 = KERN_INDEX( kp1->index1, kp1->index2 ); local
668 FT_ULong index2 = KERN_INDEX( kp2->index1, kp2->index2 );
671 if ( index1 > index2 )
673 else if ( index1 < index2 )
733 kp->index1 = shared_vals[0].u.i;
/external/jmonkeyengine/engine/src/core/com/jme3/scene/
H A DNode.java398 * @param index1 The index of the first child to swap
401 public void swapChildren(int index1, int index2) { argument
403 Spatial c1 = children.remove(index1);
404 children.add(index1, c2);
/external/freetype/include/freetype/internal/
H A Dt1types.h160 FT_Int index1; member in struct:AFM_KernPairRec_
/external/jmonkeyengine/engine/src/core/com/jme3/collision/bih/
H A DBIHTree.java377 public void swapTriangles(int index1, int index2) { argument
378 int p1 = index1 * 9;
391 int tmp2 = triIndices[index1];
392 triIndices[index1] = triIndices[index2];
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/collision/
H A DPhysicsCollisionEvent.java147 return cp.index1;
/external/protobuf/src/google/protobuf/
H A Drepeated_field.h114 void SwapElements(int index1, int index2);
222 void SwapElements(int index1, int index2);
347 void SwapElements(int index1, int index2);
544 void RepeatedField<Element>::SwapElements(int index1, int index2) { argument
545 std::swap(elements_[index1], elements_[index2]);
709 inline void RepeatedPtrFieldBase::SwapElements(int index1, int index2) { argument
710 std::swap(elements_[index1], elements_[index2]);
864 void RepeatedPtrField<Element>::SwapElements(int index1, int index2) { argument
865 RepeatedPtrFieldBase::SwapElements(index1, index2);
/external/libxml2/
H A Dxinclude.c915 int index1, index2; local
932 index1 = range->index;
974 if ((cur == start) && (index1 > 1)) {
975 content += (index1 - 1);
976 len -= (index1 - 1);
1013 if ((cur == start) && (index1 > 1)) {
1014 cur = xmlXIncludeGetNthChild(cur, index1 - 1);
1015 index1 = 0;
1033 if (index1 > 1) {
1034 content += (index1
[all...]

Completed in 551 milliseconds

123