Searched defs:index2 (Results 1 - 23 of 23) sorted by relevance

/external/chromium/third_party/icu/source/common/
H A Dutrie2_impl.h144 int32_t index2[UNEWTRIE2_MAX_INDEX_2_LENGTH]; member in struct:UNewTrie2
/external/icu4c/common/
H A Dutrie2_impl.h144 int32_t index2[UNEWTRIE2_MAX_INDEX_2_LENGTH]; member in struct:UNewTrie2
H A Dutext.cpp533 int64_t index2 = (limit2 >= 0 ? UTEXT_GETNATIVEINDEX(s2) : 0); local
535 while((limit1 < 0 || index1 < limit1) && (limit2 < 0 || index2 < limit2)) {
549 index2 = UTEXT_GETNATIVEINDEX(s2);
554 if(index2 >= limit2) {
711 int64_t index1, index2; local
729 index2 = (limit2 >= 0 ? UTEXT_GETNATIVEINDEX(s2) : 0);
735 (foldOffset2 < foldLength2 || limit2 < 0 || index2 < limit2)) {
780 index2 = UTEXT_GETNATIVEINDEX(s2);
791 index2 -= foldLength2 - foldOffset2;
794 if(index2 >
[all...]
/external/webkit/WebCore/platform/graphics/
H A DGlyphBuffer.h93 void swap(int index1, int index2) argument
96 m_fontData[index1] = m_fontData[index2];
97 m_fontData[index2] = f;
100 m_glyphs[index1] = m_glyphs[index2];
101 m_glyphs[index2] = g;
104 m_advances[index1] = m_advances[index2];
105 m_advances[index2] = s;
109 m_offsets[index1] = m_offsets[index2];
110 m_offsets[index2] = offset;
/external/nist-sip/java/gov/nist/javax/sip/header/
H A DSIPHeaderList.java633 public java.util.List<HDR> subList(int index1, int index2) { argument
634 return this.hlist.subList(index1, index2);
/external/chromium/base/
H A Dfile_path.cc917 int index2 = 0; local
925 &index2);
930 DCHECK_EQ(index2, length2);
/external/freetype/include/freetype/internal/
H A Dt1types.h172 FT_Int index2; member in struct:AFM_KernPairRec_
/external/freetype/src/pshinter/
H A Dpshrec.c376 FT_Int index2 )
379 PS_Mask mask2 = table->masks + index2;
408 FT_Int index2,
415 /* swap index1 and index2 so that index1 < index2 */
416 if ( index1 > index2 )
419 index1 = index2;
420 index2 = temp;
423 if ( index1 < index2 && index1 >= 0 && index2 < (FT_In
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/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);
H A Dextension_set.cc531 void ExtensionSet::SwapElements(int number, int index1, int index2) { argument
540 extension->repeated_int32_value->SwapElements(index1, index2);
543 extension->repeated_int64_value->SwapElements(index1, index2);
546 extension->repeated_uint32_value->SwapElements(index1, index2);
549 extension->repeated_uint64_value->SwapElements(index1, index2);
552 extension->repeated_float_value->SwapElements(index1, index2);
555 extension->repeated_double_value->SwapElements(index1, index2);
558 extension->repeated_bool_value->SwapElements(index1, index2);
561 extension->repeated_enum_value->SwapElements(index1, index2);
564 extension->repeated_string_value->SwapElements(index1, index2);
[all...]
/external/v8/src/x64/
H A Dic-x64.cc772 SmiIndex index2 = masm->SmiToIndex(kScratchRegister, rbx, kPointerSizeLog2); local
773 __ movq(Operand(rcx, index2.reg, index2.scale,
/external/webkit/WebCore/accessibility/
H A DAccessibilityObject.cpp683 int index2 = index(positionRange.end); local
684 if (index1 < 0 || index2 < 0 || index1 > index2)
687 return PlainTextRange(index1, index2 - index1);
H A DAccessibilityRenderObject.cpp2385 int index2 = indexForVisiblePosition(endPosition); local
2389 index2 += 1;
2392 if (index1 == index2)
2395 return PlainTextRange(index1, index2 - index1);
/external/freetype/src/psaux/
H A Dafmparse.c670 FT_ULong index1 = KERN_INDEX( kp1->index1, kp1->index2 );
671 FT_ULong index2 = KERN_INDEX( kp2->index1, kp2->index2 ); local
674 if ( index1 > index2 )
676 else if ( index1 < index2 )
737 kp->index2 = shared_vals[1].u.i;
/external/libxml2/include/libxml/
H A Dxpath.h121 int index2; member in struct:_xmlXPathObject
/external/libxml2/
H A Dxinclude.c908 int index1, index2; local
926 index2 = range->index2;
966 len = index2;
972 len = index2;
1003 if (index2 > 1) {
1004 end = xmlXIncludeGetNthChild(cur, index2 - 1);
1005 index2 = 0;
H A Dxpointer.c210 * @index2: the second index
218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) { argument
225 if (index1 < index2)
227 if (index1 > index2)
281 range->user2, range->index2);
287 range->index = range->index2;
288 range->index2 = tmp;
317 if (range1->index2 != range2->index2)
357 ret->index2
1436 int index1, index2; local
[all...]
/external/quake/quake/src/QW/client/
H A Dd_polyse.c186 finalvert_t *pfv, *index0, *index1, *index2; local
198 index2 = pfv + ptri[i].vertindex[2];
201 (index0->v[0]-index2->v[0]) -
203 (index0->v[1]-index2->v[1])) >= 0)
212 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
220 s2 = index2->v[2];
226 if (index2->flags & ALIAS_ONSEAM)
227 index2->v[2] += r_affinetridesc.seamfixupX16;
229 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
233 index2
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
198 index2 = pfv + ptri[i].vertindex[2];
201 (index0->v[0]-index2->v[0]) -
203 (index0->v[1]-index2->v[1])) >= 0)
212 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
220 s2 = index2->v[2];
226 if (index2->flags & ALIAS_ONSEAM)
227 index2->v[2] += r_affinetridesc.seamfixupX16;
229 D_PolysetRecursiveTriangle(index0->v, index1->v, index2->v);
233 index2
247 finalvert_t *pfv, *index0, *index1, *index2; local
[all...]
/external/webkit/JavaScriptCore/jit/
H A DJITInlineMethods.h392 inline void JIT::emitLoad2(unsigned index1, RegisterID tag1, RegisterID payload1, unsigned index2, RegisterID tag2, RegisterID payload2) argument
396 emitLoad(index2, tag2, payload2);
399 emitLoad(index2, tag2, payload2);
/external/qemu/block/
H A Dvvfat.c1096 /* mappings between index1 and index2-1 are supposed to be ordered
1099 static inline int find_mapping_for_cluster_aux(BDRVVVFATState* s,int cluster_num,int index1,int index2) argument
1104 index3=(index1+index2)/2;
1108 assert(index2!=index3 || index2==0);
1109 if(index2==index3)
1111 index2=index3;
1114 return mapping->end<=cluster_num ? index2 : index1;
1117 assert(index1<=index2);
1120 assert(index2 >
[all...]
/external/skia/src/core/
H A DSkDraw.cpp2108 int index0, int index1, int index2) {
2112 fColors[2] = SkPreMultiplyColor(colors[index2]);
2117 m.set(1, pts[index2].fX - pts[index0].fX);
2120 m.set(4, pts[index2].fY - pts[index0].fY);
2107 setup(const SkPoint pts[], const SkColor colors[], int index0, int index1, int index2) argument
/external/webkit/WebCore/dom/
H A DNode.cpp2107 unsigned index2 = chain2.size(); local
2108 for (unsigned i = min(index1, index2); i; --i) {
2110 Node* child2 = chain2[--index2];
2134 return index1 < index2 ?

Completed in 1479 milliseconds