/frameworks/base/tests/CoreTests/android/core/ |
H A D | MonitorTest.java | 419 int i2; field in class:MonitorTest.CompareAndExchange.Worker 421 Worker(int i1, int i2) { argument 422 super("Worker(" + i1 + ", " + i2 + ")"); 424 this.i2 = i2; 443 this.sleep(5 + i2); 444 CompareAndExchange.toggle = test = i2; 451 // i2 + ") " + "test " + test +
|
/frameworks/base/libs/rs/ |
H A D | rsUtils.h | 107 static inline uint16_t rsBoxFilter565(uint16_t i1, uint16_t i2, uint16_t i3, uint16_t i4) argument 109 uint32_t r = ((i1 & 0x1f) + (i2 & 0x1f) + (i3 & 0x1f) + (i4 & 0x1f)); 110 uint32_t g = ((i1 >> 5) & 0x3f) + ((i2 >> 5) & 0x3f) + ((i3 >> 5) & 0x3f) + ((i4 >> 5) & 0x3f); 111 uint32_t b = ((i1 >> 11) + (i2 >> 11) + (i3 >> 11) + (i4 >> 11)); 115 static inline uint32_t rsBoxFilter8888(uint32_t i1, uint32_t i2, uint32_t i3, uint32_t i4) argument 117 uint32_t r = (i1 & 0xff) + (i2 & 0xff) + (i3 & 0xff) + (i4 & 0xff); 118 uint32_t g = ((i1 >> 8) & 0xff) + ((i2 >> 8) & 0xff) + ((i3 >> 8) & 0xff) + ((i4 >> 8) & 0xff); 119 uint32_t b = ((i1 >> 16) & 0xff) + ((i2 >> 16) & 0xff) + ((i3 >> 16) & 0xff) + ((i4 >> 16) & 0xff); 120 uint32_t a = ((i1 >> 24) & 0xff) + ((i2 >> 24) & 0xff) + ((i3 >> 24) & 0xff) + ((i4 >> 24) & 0xff);
|
H A D | rsAllocation.cpp | 371 const uint16_t *i2 = static_cast<uint16_t *>(in.getElement(0, y*2+1)); local 374 *oPtr = rsBoxFilter565(i1[0], i1[1], i2[0], i2[1]); 377 i2 += 2; 390 const uint32_t *i2 = static_cast<uint32_t *>(in.getElement(0, y*2+1)); local 393 *oPtr = rsBoxFilter8888(i1[0], i1[1], i2[0], i2[1]); 396 i2 += 2; 409 const uint8_t *i2 = static_cast<uint8_t *>(in.getElement(0, y*2+1)); local 412 *oPtr = (uint8_t)(((uint32_t)i1[0] + i1[1] + i2[ [all...] |
/frameworks/base/media/libdrm/mobile2/src/util/ustl-1.0/ |
H A D | ulist.h | 35 inline list (const_iterator i1, const_iterator i2) : vector<T> (i1, i2) {} argument
|
H A D | umultiset.h | 43 inline multiset (const_iterator i1, const_iterator i2) : vector<T> () { insert (i1, i2); } argument 50 inline void assign (const_iterator i1, const_iterator i2); 54 void insert (const_iterator i1, const_iterator i2); 61 /// Copies contents of range [i1,i2) 63 inline void multiset<T>::assign (const_iterator i1, const_iterator i2) argument 66 insert (i1, i2); 85 /// Inserts all elements from range [i1,i2). 87 void multiset<T>::insert (const_iterator i1, const_iterator i2) argument 89 assert (i1 <= i2); [all...] |
H A D | uset.h | 43 inline set (const_iterator i1, const_iterator i2) : vector<T> () { insert (i1, i2); } argument 50 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); } argument 55 inline void insert (const_iterator i1, const_iterator i2); 74 /// Inserts the contents of range [i1,i2) 76 void set<T>::insert (const_iterator i1, const_iterator i2) argument 78 assert (i1 <= i2); 79 reserve (size() + distance (i1, i2)); 80 for (; i1 < i2; [all...] |
H A D | umap.h | 48 inline map (const_iterator i1, const_iterator i2) : vector<pair<K,V> >() { insert (i1, i2); } argument 57 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); } argument 64 void insert (const_iterator i1, const_iterator i2); 143 /// Inserts elements from range [i1,i2) into the container. 145 void map<K,V>::insert (const_iterator i1, const_iterator i2) argument 147 assert (i1 <= i2); 148 reserve (size() + distance (i1, i2)); 149 for (; i1 != i2; [all...] |
H A D | umultimap.h | 48 inline multimap (const_iterator i1, const_iterator i2) : vector<pair<K,V> > () { insert (i1, i2); } argument 55 inline void assign (const_iterator i1, const_iterator i2) { clear(); insert (i1, i2); } argument 63 void insert (const_iterator i1, const_iterator i2); 108 /// Inserts elements from range [i1,i2) into the container. 110 void multimap<K,V>::insert (const_iterator i1, const_iterator i2) argument 112 assert (i1 <= i2); 113 reserve (size() + distance (i1, i2)); 114 for (; i1 != i2; [all...] |
H A D | ualgo.h | 121 /// op(*i1, *i2) for each iterator i1 in the range [first1, last1) and assigns 122 /// the result to *o, where i2 is the corresponding iterator in the second 450 ConstPointer i2 = reinterpret_cast<ConstPointer>(p2); local 452 return (comp (*i1, *i2) ? -1 : (comp (*i2, *i1) ? 1 : 0));
|
H A D | ustring.cpp | 250 void string::replace (iterator first, iterator last, const_pointer i1, const_pointer i2, size_type n) argument 255 assert ((i1 < begin() || i1 >= end() || abs_distance(i1,i2) * n + size() < capacity()) && "Replacement by self can not autoresize"); 256 const size_type bte = distance(first, last), bti = distance(i1, i2) * n; 261 fill (memblock::iterator(first), i1, distance(i1, i2), n);
|
H A D | ustring.h | 87 inline void append (const_iterator i1, const_iterator i2) { append (i1, distance (i1, i2)); } argument 96 inline void assign (const_iterator i1, const_iterator i2) { assign (i1, distance (i1, i2)); } argument 145 void replace (iterator first, iterator last, const_pointer i1, const_pointer i2, size_type n = 1);
|
H A D | uutility.h | 141 inline ptrdiff_t distance (T1 i1, T2 i2) argument 143 return (i2 - i1); 172 /// Returns the absolute value of the distance i1 and i2 174 inline size_t abs_distance (T1 i1, T2 i2) argument 176 return (absv (distance(i1, i2)));
|
/frameworks/base/media/libstagefright/codecs/amrnb/enc/src/ |
H A D | c3_14pf.cpp | 155 The code length is 40, containing 3 nonzero pulses: i0...i2. 157 Pulse i0 can have 8 possible positions, pulses i1 and i2 can have 163 i2 : 2, 7, 12, 17, 22, 27, 32, 37. 383 Word16 i2; local 460 * "rr[i0][i2]" is a pointer initialized to "&rr[i0][ipos[2]]" * 503 * i2 loop: 8 positions. * 518 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP) 521 /* ps1 = add(ps0, dn[i2], pOverflo [all...] |
H A D | c4_17pf.cpp | 167 Pulse i0 to i2 can have 8 possible positions, pulse i3 can have 172 i2 : 2, 7, 12, 17, 22, 27, 32, 37. 396 Word16 i2; local 513 * i2 loop: 8 positions. * 528 for (i2 = ipos[2]; i2 < L_CODE; i2 += STEP) 531 /* ps1 = add(ps0, dn[i2], pOverflow); */ 532 ps1 = ps0 + dn[i2]; 534 /* alp1 = alp0 + rr[i0][i2] [all...] |
H A D | s10_8pf.cpp | 190 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i8, i9; 233 // i2 and i3 loop 251 for (i2 = ipos[2]; i2 < L_CODE; i2 += step) 254 ps1 = add (ps0, dn[i2]); 257 alp1 = L_mac (alp0, rr[i2][i2], _1_16); 260 alp1 = L_mac (alp1, rr[i0][i2], _1_8); 263 alp1 = L_mac (alp1, rr[i1][i2], _1_ 568 Word16 i0, i1, i2, i3, i4, i5, i6, i7, i9; local [all...] |