| /external/libchrome/base/strings/ |
| string_piece.h | 227 value_type back() const { return ptr_[length_ - 1]; } function in class:base::BasicStringPiece
|
| /external/libcxx/test/support/ |
| nasty_containers.hpp | 83 reference back() { return v_.back(); } function in class:nasty_vector
84 const_reference back() const { return v_.back(); } function in class:nasty_vector
199 reference back() { return l_.back(); } function in class:nasty_list
200 const_reference back() const { return l_.back(); } function in class:nasty_list
|
| /external/libxaac/decoder/ |
| ixheaacd_info.h | 87 ia_ele_list_struct back; member in struct:__anon26562
|
| /external/lisa/libs/utils/android/ |
| system.py | 425 def back(target): member in class:System
427 Press BACK button
|
| /external/mesa3d/src/gallium/drivers/vc4/ |
| vc4_state.c | 225 const struct pipe_stencil_state *back = &cso->stencil[1]; local
234 if (back->enabled) {
235 back_writemask = back->writemask;
237 tlb_stencil_setup_writemask(back->writemask);
241 tlb_stencil_setup_bits(back, back_writemask_bits);
|
| /external/mesa3d/src/gallium/state_trackers/clover/util/ |
| range.hpp | 131 back() { function in class:clover::detail::basic_range
|
| /external/mesa3d/src/gallium/state_trackers/glx/xlib/ |
| xm_st.c | 233 enum st_attachment_type back, front; local
235 back = ST_ATTACHMENT_BACK_LEFT;
237 /* copy the contents if front is newly allocated and back is not */
238 if ((statt_mask & (1 << back)) &&
240 !(new_mask & (1 << back))) {
241 xmesa_st_framebuffer_copy_textures(stfbi, back, front,
348 struct pipe_resource **front, **back, *tmp; local
351 back = &xstfb->textures[ST_ATTACHMENT_BACK_LEFT];
355 *front = *back;
356 *back = tmp
[all...] |
| /external/opencv/cv/src/ |
| cvoptflowbm.cpp | 111 const float back = 1.f / (float) (1 << 16); local
537 float vx = (float)velx[j]*back, vy = (float)vely[j]*back;
|
| /external/parameter-framework/upstream/test/functional-tests/ |
| Handle.cpp | 636 AND_THEN ("Getting it back should give the same value") {
637 uint32_t back = 42; local
638 CHECK_NOTHROW(intScalar.getAsInteger(back));
639 CHECK(back == expected);
656 AND_THEN ("Getting it back should give the same value") {
657 std::vector<int32_t> back = {-42, 42, 43, -43}; local
658 CHECK_NOTHROW(intArray.getAsSignedIntegerArray(back));
659 CHECK(back == expected);
|
| /external/python/cpython2/Demo/pdist/ |
| FSProxy.py | 39 self.back()
98 def back(self): member in class:FSProxyLocal
280 while self._dirstack: self.back()
|
| /external/python/cpython2/Tools/msi/ |
| msi.py | 237 # back in case the installation is interrupted
289 then a list of buttons: back, next, cancel. Optionally a bitmap at the
308 def back(self, title, next, name = "Back", active = 1): member in class:PyDialog
309 """Add a back button with a given title, the tab-next button,
495 fatal.back("< Back", "Finish", active = 0)
496 fatal.cancel("Cancel", "Back", active = 0)
510 user_exit.back("< Back", "Finish", active = 0
[all...] |
| /external/selinux/gui/ |
| polgengui.py | 229 self.back_button.connect("clicked", self.back)
393 def back(self, arg): member in class:childWindow
[all...] |
| /external/skia/include/private/ |
| SkTArray.h | 200 * Construct a new T at the back of this array.
285 * Pushes or pops from the back to resize. Pushes will be default
354 T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];} function
356 const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];} function
|
| /external/skia/src/gpu/ |
| GrAllocator.h | 57 void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock;
74 sk_free(fBlocks.back());
115 void* back() { function in class:GrAllocator
118 return (char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
124 const void* back() const { function in class:GrAllocator
127 return (const char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
272 this->back().~T();
302 T& back() { function in class:GrTAllocator
303 return *(T*)fAllocator.back();
309 const T& back() const function in class:GrTAllocator
[all...] |
| GrBufferAllocPool.cpp | 58 GrBuffer* buffer = fBlocks.back().fBuffer;
60 UNMAP_BUFFER(fBlocks.back());
88 BufferBlock& block = fBlocks.back();
93 this->flushCpuData(fBlocks.back(), flushSize);
105 if (fBlocks.back().fBuffer->isMapped()) {
106 GrBuffer* buf = fBlocks.back().fBuffer;
112 SkASSERT(fBlocks.empty() || !fBlocks.back().fBuffer->isMapped());
150 BufferBlock& back = fBlocks.back(); local
151 size_t usedBytes = back.fBuffer->gpuMemorySize() - back.fBytesFree
179 BufferBlock& back = fBlocks.back(); local
200 BufferBlock& back = fBlocks.back(); local
236 BufferBlock& back = fBlocks.back(); local
[all...] |
| GrFragmentProcessor.cpp | 486 const GrFragmentProcessor* back = fFPStack.back(); local
488 for (int i = back->numChildProcessors() - 1; i >= 0; --i) {
489 fFPStack.push_back(&back->childProcessor(i));
491 return back;
|
| GrResourceCache.cpp | 175 GrGpuResource* back = *(fNonpurgeableResources.end() - 1); local
176 SkASSERT(!back->wasDestroyed());
177 back->cacheAccess().abandon();
203 // they also have a raw pointer back to this class (which is presumably going away)!
207 GrGpuResource* back = *(fNonpurgeableResources.end() - 1); local
208 SkASSERT(!back->wasDestroyed());
209 back->cacheAccess().release();
[all...] |
| GrTRecorder.h | 23 * To create a new item and append it to the back of the list, use the following macros:
68 TBase& back() { function in class:GrTRecorder
187 // We popped the last entry in a block that isn't the head block. Move back a block but
242 * Iterates through a recorder from front to back. The initial state of the iterator is
285 * Iterates through a recorder in reverse, from back to front. This version mirrors "Iter",
286 * so the initial state is to have recorder.back() loaded already. (Note that this will
299 fItem(&recorder.back()) {
|
| /external/skqp/include/private/ |
| SkTArray.h | 200 * Construct a new T at the back of this array.
285 * Pushes or pops from the back to resize. Pushes will be default
354 T& back() { SkASSERT(fCount); return fItemArray[fCount - 1];} function
356 const T& back() const { SkASSERT(fCount > 0); return fItemArray[fCount - 1];} function
|
| /external/skqp/src/gpu/ |
| GrAllocator.h | 57 void* ret = (char*)fBlocks.back() + fItemSize * fInsertionIndexInBlock;
74 sk_free(fBlocks.back());
115 void* back() { function in class:GrAllocator
118 return (char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
124 const void* back() const { function in class:GrAllocator
127 return (const char*)(fBlocks.back()) + (fInsertionIndexInBlock - 1) * fItemSize;
272 this->back().~T();
302 T& back() { function in class:GrTAllocator
303 return *(T*)fAllocator.back();
309 const T& back() const function in class:GrTAllocator
[all...] |
| GrBufferAllocPool.cpp | 58 GrBuffer* buffer = fBlocks.back().fBuffer;
60 UNMAP_BUFFER(fBlocks.back());
88 BufferBlock& block = fBlocks.back();
93 this->flushCpuData(fBlocks.back(), flushSize);
105 if (fBlocks.back().fBuffer->isMapped()) {
106 GrBuffer* buf = fBlocks.back().fBuffer;
112 SkASSERT(fBlocks.empty() || !fBlocks.back().fBuffer->isMapped());
150 BufferBlock& back = fBlocks.back(); local
151 size_t usedBytes = back.fBuffer->gpuMemorySize() - back.fBytesFree
179 BufferBlock& back = fBlocks.back(); local
200 BufferBlock& back = fBlocks.back(); local
236 BufferBlock& back = fBlocks.back(); local
[all...] |
| GrFragmentProcessor.cpp | 488 const GrFragmentProcessor* back = fFPStack.back(); local
490 for (int i = back->numChildProcessors() - 1; i >= 0; --i) {
491 fFPStack.push_back(&back->childProcessor(i));
493 return back;
|
| GrResourceCache.cpp | 175 GrGpuResource* back = *(fNonpurgeableResources.end() - 1); local
176 SkASSERT(!back->wasDestroyed());
177 back->cacheAccess().abandon();
203 // they also have a raw pointer back to this class (which is presumably going away)!
207 GrGpuResource* back = *(fNonpurgeableResources.end() - 1); local
208 SkASSERT(!back->wasDestroyed());
209 back->cacheAccess().release();
|
| GrTRecorder.h | 23 * To create a new item and append it to the back of the list, use the following macros:
68 TBase& back() { function in class:GrTRecorder
187 // We popped the last entry in a block that isn't the head block. Move back a block but
242 * Iterates through a recorder from front to back. The initial state of the iterator is
285 * Iterates through a recorder in reverse, from back to front. This version mirrors "Iter",
286 * so the initial state is to have recorder.back() loaded already. (Note that this will
299 fItem(&recorder.back()) {
|
| /external/swiftshader/third_party/llvm-subzero/include/llvm/ADT/ |
| ArrayRef.h | 149 /// back - Get the last element.
150 const T &back() const { function in class:llvm::ArrayRef
336 /// back - Get the last element.
337 T &back() const { function in class:llvm::ArrayRef
|
