| /dalvik/dexgen/src/com/android/dexgen/dex/code/ |
| RopTranslator.java | 6 * You may obtain a copy of the License at
81 * at the end of the frame (as the optimizer emits them)
132 * an extra goto at the end of each basic block.
139 * extra instruction per block (for the locals state at the
165 * method happen to slot the params in an order at the top of the
317 int at = 0; local
385 order[at] = label;
386 at++;
429 if (at != sz) {
585 * Parameters are not in order at the top of the reg space
[all...] |
| /dalvik/dx/src/com/android/dx/cf/code/ |
| BytecodeArray.java | 6 * You may obtain a copy of the License at
108 int at = 0; local
110 while (at < sz) {
115 at += parseInstruction(at, visitor);
129 int at = 0; local
131 while (at < sz) {
132 Bits.set(result, at, true);
133 int length = parseInstruction(at, null);
134 at += length
824 int at = (offset + 4) & ~3; \/\/ "at" skips the padding. local
867 int at = (offset + 4) & ~3; \/\/ "at" skips the padding. local
[all...] |
| /dalvik/dx/src/com/android/dx/dex/code/ |
| LocalList.java | 6 * You may obtain a copy of the License at
51 * Gets the element at the given index. It is an error to call
56 * @return {@code non-null;} element at that index
63 * Sets the entry at the given index.
66 * @param entry {@code non-null;} the entry to set at {@code n}
338 * that to change at some point, when we start feeding that
401 throw new RuntimeException("redundant start at " +
409 throw new RuntimeException("redundant end at " +
426 "improperly marked end at " +
432 "redundant end at "
749 int at = result.size() - 1; local
924 int at = 0; local
[all...] |
| RopTranslator.java | 6 * You may obtain a copy of the License at
85 * at the end of the frame (as the optimizer emits them)
138 * an extra goto at the end of each basic block.
145 * extra instruction per block (for the locals state at the
171 * method happen to slot the params in an order at the top of the
324 int at = 0; local
392 order[at] = label;
393 at++;
436 if (at != sz) {
593 * Parameters are not in order at the top of the reg space
[all...] |
| /external/deqp/framework/delibs/decpp/ |
| dePoolArray.hpp | 11 * You may obtain a copy of the License at
77 const T& at (deIntptr ndx) const { return *getPtr(ndx); } function in class:de::PoolArray
78 T& at (deIntptr ndx) { return *getPtr(ndx); } function in class:de::PoolArray
80 const T& operator[] (deIntptr ndx) const { return at(ndx); }
81 T& operator[] (deIntptr ndx) { return at(ndx); }
89 const T& front (void) const { return at(0); }
90 T& front (void) { return at(0); }
92 const T& back (void) const { return at(m_numElements-1); }
93 T& back (void) { return at(m_numElements-1); }
362 at(size()-1) = value
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| RegionInfoImpl.h | 346 typename BBNodeMapT::const_iterator at = BBNodeMap.find(BB); local
348 if (at != BBNodeMap.end())
349 return at->second;
621 // No further region at exit available.
624 // We found a region e that starts at exit. Therefore (entry, e->second)
834 // Get largest region that starts at BB.
847 // Get largest region that starts at Exit.
|
| /external/skia/src/c/ |
| sk_surface.cpp | 83 SkAlphaType at; local
89 if (!from_c_alphatype(cinfo.alphaType, &at)) {
94 *info = SkImageInfo::Make(cinfo.width, cinfo.height, ct, at);
|
| /external/skia/src/core/ |
| SkMipMap.cpp | 401 const SkAlphaType at = src.alphaType(); local
554 new (&levels[i].fPixmap) SkPixmap(SkImageInfo::Make(width, height, ct, at), addr, rowBytes);
|
| /external/skia/tools/debugger/ |
| SkDebugCanvas.cpp | 236 GrAuditTrail* at = nullptr; local
239 at = this->getAuditTrail(originalCanvas);
255 if (at) {
256 acb = new GrAuditTrail::AutoCollectOps(at, i);
273 if (at && acb) {
336 if (at) {
339 GrAuditTrail::AutoEnable ae(at);
356 at->getBoundsByClientID(&childrenBounds, index);
359 at->getBoundsByOpListID(&childrenBounds.push_back(), m);
422 GrAuditTrail* at = nullptr
453 GrAuditTrail* at = this->getAuditTrail(canvas); local
467 GrAuditTrail* at = this->getAuditTrail(canvas); local
496 GrAuditTrail* at = this->getAuditTrail(canvas); local
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Analysis/ |
| RegionInfo.cpp | 304 BBNodeMapT::const_iterator at = BBNodeMap.find(BB); local
306 if (at != BBNodeMap.end())
307 return at->second;
524 // No further region at exit available.
527 // We found a region e that starts at exit. Therefore (entry, e->second)
749 // Get largest region that starts at BB.
762 // Get largest region that starts at Exit.
|
| /frameworks/base/media/java/android/media/audiopolicy/ |
| AudioPolicy.java | 6 * You may obtain a copy of the License at
409 AudioTrack at = new AudioTrack( local
420 return at;
|
| /libcore/ojluni/src/main/java/java/net/ |
| URL.java | 41 * information on the types of URLs and their formats can be found at:
1290 int at = host.lastIndexOf('@'); local
[all...] |
| /packages/apps/DocumentsUI/tests/common/com/android/documentsui/testing/ |
| TestEvent.java | 6 * You may obtain a copy of the License at
419 public Builder at(int position) { method in class:TestEvent.Builder
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/bits/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
125 * of _Hashtable::count(k) is always at most one, false if it may
468 // DR 761. unordered_map needs an at() member function.
470 at(const key_type& __k);
473 at(const key_type& __k) const;
536 at(const key_type& __k) function in class:__detail::_Map_base
544 __throw_out_of_range(__N("_Map_base::at"));
556 at(const key_type& __k) const function in class:__detail::_Map_base
564 __throw_out_of_range(__N("_Map_base::at"));
[all...] |
| stl_deque.h | 8 // Free Software Foundation; either version 3, or (at your option)
486 //standard container and at the same time makes use of the EBO
574 * at first.
647 * constant-time manipulation of elements at either end.
670 * map_size is at least 8. %map is an array of map_size
686 * /middle/ %map pointers will be valid, and the ones at the edges
890 * input iterators are used, then this will do at most 2N calls to the
1284 at(size_type __n) function in class:deque
1302 at(size_type __n) const function in class:deque
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/bits/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
125 * of _Hashtable::count(k) is always at most one, false if it may
468 // DR 761. unordered_map needs an at() member function.
470 at(const key_type& __k);
473 at(const key_type& __k) const;
536 at(const key_type& __k) function in class:__detail::_Map_base
544 __throw_out_of_range(__N("_Map_base::at"));
556 at(const key_type& __k) const function in class:__detail::_Map_base
564 __throw_out_of_range(__N("_Map_base::at"));
[all...] |
| stl_deque.h | 8 // Free Software Foundation; either version 3, or (at your option)
486 //standard container and at the same time makes use of the EBO
574 * at first.
647 * constant-time manipulation of elements at either end.
670 * map_size is at least 8. %map is an array of map_size
686 * /middle/ %map pointers will be valid, and the ones at the edges
890 * input iterators are used, then this will do at most 2N calls to the
1284 at(size_type __n) function in class:deque
1302 at(size_type __n) const function in class:deque
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/bits/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
125 * of _Hashtable::count(k) is always at most one, false if it may
468 // DR 761. unordered_map needs an at() member function.
470 at(const key_type& __k);
473 at(const key_type& __k) const;
536 at(const key_type& __k) function in class:__detail::_Map_base
544 __throw_out_of_range(__N("_Map_base::at"));
556 at(const key_type& __k) const function in class:__detail::_Map_base
564 __throw_out_of_range(__N("_Map_base::at"));
[all...] |
| stl_deque.h | 8 // Free Software Foundation; either version 3, or (at your option)
486 //standard container and at the same time makes use of the EBO
574 * at first.
647 * constant-time manipulation of elements at either end.
670 * map_size is at least 8. %map is an array of map_size
686 * /middle/ %map pointers will be valid, and the ones at the edges
890 * input iterators are used, then this will do at most 2N calls to the
1284 at(size_type __n) function in class:deque
1302 at(size_type __n) const function in class:deque
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| basic_string.h | 8 // Free Software Foundation; either version 3, or (at your option)
65 * @c push_back, @c at, and @c %array access are supported.
93 * object at the front.
485 * NB: @a __s must have at least @a __n characters, '\\0'
833 * see at().)
850 * see at().) Unshares the string.
875 at(size_type __n) const function in class:basic_string
878 __throw_out_of_range_fmt(__N("basic_string::at: __n "
897 at(size_type __n) function in class:basic_string
900 __throw_out_of_range_fmt(__N("basic_string::at: __n
[all...] |
| stl_deque.h | 8 // Free Software Foundation; either version 3, or (at your option)
495 //standard container and at the same time makes use of the EBO
579 * at first.
652 * constant-time manipulation of elements at either end.
675 * map_size is at least 8. %map is an array of map_size
691 * /middle/ %map pointers will be valid, and the ones at the edges
895 * input iterators are used, then this will do at most 2N calls to the
1302 at(size_type __n) function in class:deque
1320 at(size_type __n) const function in class:deque
[all...] |
| /prebuilts/ndk/r10/sources/cxx-stl/stlport/stlport/stl/ |
| _string.h | 9 * or implied. Any use is at your own risk.
68 * First, basic_string always stores a null character at the end;
96 // a block of memory whose size is at least n + 1.
437 const_reference at(size_type __n) const { function in class:basic_string
443 reference at(size_type __n) { function in class:basic_string
[all...] |
| _vector.h | 16 * or implied. Any use is at your own risk.
210 reference at(size_type __n) { _M_range_check(__n); return (*this)[__n]; } function in class:vector
211 const_reference at(size_type __n) const { _M_range_check(__n); return (*this)[__n]; } function in class:vector
|
| /prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/bits/ |
| basic_string.h | 8 // Free Software Foundation; either version 3, or (at your option)
65 * @c push_back, @c at, and @c %array access are supported.
93 * object at the front.
485 * NB: @a __s must have at least @a __n characters, '\\0'
833 * see at().)
850 * see at().) Unshares the string.
875 at(size_type __n) const function in class:basic_string
878 __throw_out_of_range_fmt(__N("basic_string::at: __n "
897 at(size_type __n) function in class:basic_string
900 __throw_out_of_range_fmt(__N("basic_string::at: __n
[all...] |
| stl_deque.h | 8 // Free Software Foundation; either version 3, or (at your option)
495 //standard container and at the same time makes use of the EBO
579 * at first.
652 * constant-time manipulation of elements at either end.
675 * map_size is at least 8. %map is an array of map_size
691 * /middle/ %map pointers will be valid, and the ones at the edges
895 * input iterators are used, then this will do at most 2N calls to the
1302 at(size_type __n) function in class:deque
1320 at(size_type __n) const function in class:deque
[all...] |
