Searched defs:index1 (Results 1 - 25 of 35) sorted by relevance

12

/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
/external/skia/src/core/
H A DSkLineClipper.cpp81 int index0, index1; local
85 index1 = 1;
88 index1 = 0;
98 if (tmp[index1].fY > clip.fBottom) {
99 tmp[index1].set(sect_with_horizontal(src, clip.fBottom), clip.fBottom);
104 index1 = 1;
107 index1 = 0;
111 if ((tmp[index1].fX <= clip.fLeft || tmp[index0].fX >= clip.fRight) &&
112 tmp[index0].fX < tmp[index1].fX) {
120 if (tmp[index1]
146 int index0, index1; 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/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/libyuv/files/source/
H A Dformat_conversion.cc78 int index1 = (selector >> 8) & 0xff; local
82 dst_bayer[1] = src_argb[index1];
/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.cc1072 int index1 = 0; local
1078 &index1);
1085 DCHECK_EQ(index1, length1);
/external/chromium/chrome/browser/bookmarks/
H A Dbookmark_model_unittest.cc62 int index1,
66 this->index1 = index1;
72 int index1,
76 ASSERT_EQ(index1, this->index1);
82 int index1; member in struct:BookmarkModelTest::ObserverDetails
60 Set(const BookmarkNode* node1, const BookmarkNode* node2, int index1, int index2) argument
70 AssertEquals(const BookmarkNode* node1, const BookmarkNode* node2, int index1, int index2) argument
/external/freetype/include/freetype/internal/
H A Dt1types.h171 FT_Int index1; member in struct:AFM_KernPairRec_
/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/icu4c/test/intltest/
H A Dtransapi.cpp442 UTransPosition index1[]={ local
449 for(uint32_t i=0; i<sizeof(index1)/sizeof(index1[0]); i++){
451 t->transliterate(rs, index1[i], insertion, status);
/external/opencv/cv/src/
H A Dcvconvhull.cpp610 int index1, index2, index3; local
615 CV_CALL( index1 = cvSeqElemIdx( ptseq, pos ));
625 index1 = *CV_SEQ_ELEM( hull, int, 0 );
630 sign += (index2 > index1) ? 1 : 0;
632 sign += (index1 > index3) ? 1 : 0;
/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, index
[all...]
H A Dgenerated_message_reflection.cc597 int index1,
603 MutableExtensionSet(message)->SwapElements(field->number(), index1, index2);
609 ->SwapElements(index1, index2); \
625 ->SwapElements(index1, index2);
594 SwapElements( Message* message, const FieldDescriptor* field, int index1, int index2) const argument
/external/quake/quake/src/QW/client/
H A Dr_alias.c60 int index1; member in struct:__anon8981
179 pv1 = &viewpts[aedges[i].index1];
181 pa1 = &viewaux[aedges[i].index1];
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 Dr_alias.cpp60 int index1; member in struct:__anon9381
179 pv1 = &viewpts[aedges[i].index1];
181 pa1 = &viewaux[aedges[i].index1];
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/freetype/src/psaux/
H A Dafmparse.c670 FT_ULong index1 = KERN_INDEX( kp1->index1, kp1->index2 ); local
671 FT_ULong index2 = KERN_INDEX( kp2->index1, kp2->index2 );
674 if ( index1 > index2 )
676 else if ( index1 < index2 )
736 kp->index1 = shared_vals[0].u.i;
/external/libxml2/
H A Dxinclude.c908 int index1, index2; local
925 index1 = range->index;
967 if ((cur == start) && (index1 > 1)) {
968 content += (index1 - 1);
969 len -= (index1 - 1);
970 index1 = 0;
1007 if ((cur == start) && (index1 > 1)) {
1008 cur = xmlXIncludeGetNthChild(cur, index1 - 1);
1009 index1 = 0;
1027 if (index1 >
[all...]
H A Dxpointer.c208 * @index1: the first index
218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) { argument
225 if (index1 < index2)
227 if (index1 > index2)
1436 int index1, index2; local
1451 index1 = range->index;
1463 if ((cur == start) && (index1 > 1)) {
1464 content += (index1 - 1);
1465 len -= (index1 - 1);
1466 index1
[all...]
/external/webkit/Source/JavaScriptCore/jit/
H A DJITInlineMethods.h434 inline void JIT::emitLoad2(unsigned index1, RegisterID tag1, RegisterID payload1, unsigned index2, RegisterID tag2, RegisterID payload2) argument
436 if (isMapped(index1)) {
437 emitLoad(index1, tag1, payload1);
442 emitLoad(index1, tag1, payload1);
/external/webkit/Source/WebCore/accessibility/
H A DAccessibilityObject.cpp681 int index1 = index(positionRange.start); local
683 if (index1 < 0 || index2 < 0 || index1 > index2)
686 return PlainTextRange(index1, index2 - index1);

Completed in 9674 milliseconds

12