| /external/webkit/WebCore/platform/graphics/ |
| H A D | GlyphBuffer.h | 93 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/icu4c/common/ |
| H A D | utrie2_impl.h | 144 int32_t index2[UNEWTRIE2_MAX_INDEX_2_LENGTH]; member in struct:UNewTrie2
|
| H A D | utrie2_builder.c | 164 newTrie->index2[i]=j;
192 newTrie->index2[i]=UNEWTRIE2_DATA_NULL_OFFSET;
200 newTrie->index2[UNEWTRIE2_INDEX_GAP_OFFSET+i]=-1;
205 newTrie->index2[UNEWTRIE2_INDEX_2_NULL_OFFSET+i]=UNEWTRIE2_DATA_NULL_OFFSET;
253 uprv_memcpy(trie->index2, other->index2, other->index2Length*4);
469 block=trie->index2[i2];
479 if(newTop>LENGTHOF(trie->index2)) {
488 uprv_memcpy(trie->index2+newBlock, trie->index2
[all...] |
| H A D | utrie2.c | 51 block=trie->index2[i2];
620 block=trie->newTrie->index2[i2Block+i2];
|
| /external/proguard/src/proguard/ |
| H A D | InputReader.java | 157 for (int index2 = 0; index2 < outputClassPath.size(); index2++)
159 ClassPathEntry entry2 = outputClassPath.get(index2);
|
| H A D | Initializer.java | 389 for (int index2 = 0; index2 < memberSpecifications.size(); index2++)
392 (MemberSpecification)memberSpecifications.get(index2);
|
| /external/quake/quake/src/QW/client/ |
| H A D | d_polyse.c | 186 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 D | d_polyse.cpp | 186 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/freetype/src/pshinter/ |
| H A D | pshrec.c | 376 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/opencore/codecs_v2/audio/gsm_amr/amr_nb/dec/src/ |
| H A D | d8_31pf.cpp | 105 index2 -- Word16 -- index for second pos in pos_index[]
167 Word16 index2, /* i : index for second pos in pos_index[] */
179 pos_indx[index2] = ((MSBs-25*(MSBs/25))/5)*2 + (LSBs-4*(LSBs/4))/2;
242 pos_indx[index2] = ib + (ic >> 1);
163 decompress10( Word16 MSBs, Word16 LSBs, Word16 index1, Word16 index2, Word16 index3, Word16 pos_indx[], Flag *pOverflow) argument
|
| /external/dropbear/libtommath/ |
| H A D | booker.pl | 46 $index2{@m[1]} = $section;
191 $b = $index2{$word};
|
| /external/libxml2/ |
| H A D | xpointer.c | 210 * @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...] |
| H A D | xinclude.c | 908 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 D | xpath.c | 1064 ((cur->user2 == cur->user) && (cur->index == cur->index2))) {
1083 if (cur->index2 >= 0)
1084 fprintf(output, "index %d in ", cur->index2);
13864 rloc->locTab[j]->index2);
|
| /external/freetype/src/psaux/ |
| H A D | afmparse.c | 670 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/freetype/include/freetype/internal/ |
| H A D | t1types.h | 172 FT_Int index2; member in struct:AFM_KernPairRec_
|
| /external/libxml2/include/libxml/ |
| H A D | xpath.h | 121 int index2; member in struct:_xmlXPathObject
|
| /external/webkit/WebCore/accessibility/ |
| H A D | AccessibilityObject.cpp | 683 int index2 = index(positionRange.end); local
684 if (index1 < 0 || index2 < 0 || index1 > index2)
687 return PlainTextRange(index1, index2 - index1);
|
| H A D | AccessibilityRenderObject.cpp | 2385 int index2 = indexForVisiblePosition(endPosition); local
2389 index2 += 1;
2392 if (index1 == index2)
2395 return PlainTextRange(index1, index2 - index1);
|
| /external/webkit/JavaScriptCore/jit/ |
| H A D | JITInlineMethods.h | 392 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);
|
| H A D | JIT.h | 403 void emitLoad2(unsigned index1, RegisterID tag1, RegisterID payload1, unsigned index2, RegisterID tag2, RegisterID payload2);
|
| /external/qemu/block/ |
| H A D | vvfat.c | 1096 /* 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/v8/src/x64/ |
| H A D | ic-x64.cc | 772 SmiIndex index2 = masm->SmiToIndex(kScratchRegister, rbx, kPointerSizeLog2); local
773 __ movq(Operand(rcx, index2.reg, index2.scale,
|
| /external/skia/src/core/ |
| H A D | SkDraw.cpp | 2046 int index0, int index1, int index2) {
2050 fColors[2] = SkPreMultiplyColor(colors[index2]);
2055 m.set(1, pts[index2].fX - pts[index0].fX);
2058 m.set(4, pts[index2].fY - pts[index0].fY);
2045 setup(const SkPoint pts[], const SkColor colors[], int index0, int index1, int index2) argument
|
| /external/webkit/WebCore/dom/ |
| H A D | Node.cpp | 2107 unsigned index2 = chain2.size(); local
2108 for (unsigned i = min(index1, index2); i; --i) {
2110 Node* child2 = chain2[--index2];
2134 return index1 < index2 ?
|