Searched refs:index2 (Results 1 - 25 of 68) sorted by relevance

123

/external/chromium/chrome/browser/
H A Dmemory_details_win.cc100 for (unsigned int index2 = 0; index2 < process_data_.size(); index2++) {
101 if (_wcsicmp(process_data_[index2].process_name.c_str(),
104 if (index2 == IE_BROWSER && is_64bit_process)
121 if (index2 == CHROME_BROWSER || index2 == CHROME_NACL_PROCESS) {
146 if (index2 == CHROME_NACL_PROCESS) {
150 process_data_[index2].processes.push_back(info);
/external/webkit/Source/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/javassist/src/main/javassist/bytecode/
H A DCodeAnalyzer.java108 int target, index2;
156 index2 = (index & ~3) + 4;
157 target = index + ci.s32bitAt(index2);
160 int npairs = ci.s32bitAt(index2 + 4);
161 index2 += 12;
163 target = index + ci.s32bitAt(index2);
166 index2 += 8;
170 int low = ci.s32bitAt(index2 + 4);
171 int high = ci.s32bitAt(index2 + 8);
173 index2
[all...]
/external/chromium/chrome/browser/autofill/crypto/
H A Drc4_decryptor.h63 uint8 index2 = 0; local
74 index2 = (key_data[index1] + state[counter] + index2) % kKeyDataSize;
75 SwapByte(&state[counter], &state[index2]);
/external/icu4c/common/
H A Dutrie2_impl.h144 int32_t index2[UNEWTRIE2_MAX_INDEX_2_LENGTH]; member in struct:UNewTrie2
H A Dutrie2_builder.c164 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...]
/external/proguard/src/proguard/
H A DInputReader.java157 for (int index2 = 0; index2 < outputClassPath.size(); index2++)
159 ClassPathEntry entry2 = outputClassPath.get(index2);
H A DInitializer.java389 for (int index2 = 0; index2 < memberSpecifications.size(); index2++)
392 (MemberSpecification)memberSpecifications.get(index2);
/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/opencv/cvaux/src/
H A Ddecomppoly.cpp150 int index1, index2, index3;
183 index2 = 1;
187 x2 = contour[ index2 ].x;
188 y2 = contour[ index2 ].y;
243 pointExist[ index2 ] = 0;
244 index2 = index3;
266 index1 = index2;
269 index2 = index3;
295 index1 = index2;
298 index2
[all...]
/external/dexmaker/src/dx/java/com/android/dx/dex/file/
H A DAnnotationItem.java72 int index2 = item2.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) {
249 var item2 = this.getItemByUnsortedIndex_(index2);
255 index2);
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DDOM2Helper.java237 int index2 = ((DOMOrder) node2).getUid();
239 return index1 <= index2;
/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/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.pl46 $index2{@m[1]} = $section;
191 $b = $index2{$word};
/external/jmonkeyengine/engine/src/core/com/jme3/scene/
H A DNode.java399 * @param index2 The index of the second child to swap
401 public void swapChildren(int index1, int index2) { argument
402 Spatial c2 = children.get(index2);
405 children.remove(index2);
406 children.add(index2, c1);
/external/v8/src/
H A Dliveedit.h152 virtual bool Equals(int index1, int index2) = 0;
/external/libxml2/
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
1446 int index1, index2; local
[all...]
/external/freetype/src/psaux/
H A Dafmparse.c667 FT_ULong index1 = KERN_INDEX( kp1->index1, kp1->index2 );
668 FT_ULong index2 = KERN_INDEX( kp2->index1, kp2->index2 ); local
671 if ( index1 > index2 )
673 else if ( index1 < index2 )
734 kp->index2 = shared_vals[1].u.i;
/external/freetype/include/freetype/internal/
H A Dt1types.h161 FT_Int index2; 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
379 int p2 = index2 * 9;
392 triIndices[index1] = triIndices[index2];
393 triIndices[index2] = tmp2;
/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/clang/test/Analysis/
H A Dmisc-ps-region-store.cpp589 // analyzer (originally) didn't know how to handle x[index - index2],
592 void rdar10924675(unsigned short x[], int index, int index2) { argument
593 unsigned short &y = x[index - index2];

Completed in 651 milliseconds

123