/system/core/libunwindstack/ |
H A D | DwarfOp.cpp | 218 AddressType top = stack_[0]; local 221 stack_[2] = top; 237 AddressType top = StackPop(); local 238 stack_[0] &= top; 244 AddressType top = StackPop(); local 245 if (top == 0) { 249 SignedType signed_divisor = static_cast<SignedType>(top); 257 AddressType top = StackPop(); local 258 stack_[0] -= top; 264 AddressType top local 275 AddressType top = StackPop(); local 295 AddressType top = StackPop(); local 302 AddressType top = StackPop(); local 315 AddressType top = StackPop(); local 316 stack_[0] <<= top; local 322 AddressType top = StackPop(); local 323 stack_[0] >>= top; local 329 AddressType top = StackPop(); local 337 AddressType top = StackPop(); local 345 AddressType top = StackPop(); local 359 AddressType top = StackPop(); local 366 AddressType top = StackPop(); local 373 AddressType top = StackPop(); local 380 AddressType top = StackPop(); local 387 AddressType top = StackPop(); local 394 AddressType top = StackPop(); local [all...] |
H A D | DwarfCfa.cpp | 383 *loc_regs = loc_reg_state_.top();
|
/system/chre/util/tests/ |
H A D | priority_queue_test.cc | 103 EXPECT_DEATH(q.top(), ""); 109 EXPECT_EQ(1, q.top()); 112 EXPECT_EQ(3, q.top()); 114 EXPECT_EQ(2, q.top()); 116 EXPECT_EQ(1, q.top()); 146 EXPECT_EQ(1, q.top()); 151 EXPECT_EQ(3, q.top()); 164 EXPECT_EQ(i, q.top()); 180 EXPECT_EQ(0, q.top().getValue()); 181 EXPECT_EQ(0, q.top() [all...] |
/system/core/libmemunreachable/ |
H A D | PtracerThread.cpp | 55 mprotect(top(), page_size_, PROT_NONE); 58 void* top() { function in class:android::Stack 72 if (stack_->top() == nullptr) { 101 child_pid_ = clone(proxy, stack_->top(), CLONE_VM | CLONE_FS | CLONE_FILES /*|CLONE_UNTRACED*/,
|
/system/chre/util/include/chre/util/ |
H A D | priority_queue.h | 93 * read out of bounds. It returns the top element with index equal to 0 when 105 * read out of bounds. It returns the top element with index equal to 0 when 114 * Obtains the top element of the queue. It is illegal to do this when the 121 ElementType& top(); 124 * Obtains the top element of the queue. It is illegal to do this when the 131 const ElementType& top() const; 134 * Removes the top element from the queue if the queue is not empty. All
|
H A D | priority_queue_impl.h | 84 ElementType& PriorityQueue<ElementType, CompareFunction>::top() { function in class:chre::PriorityQueue 89 const ElementType& PriorityQueue<ElementType, CompareFunction>::top() const { function in class:chre::PriorityQueue
|
/system/tools/hidl/c2hal/test/ |
H A D | simple.h | 54 int left, int top, int width, int height);
|
H A D | test.h | 193 * return -EINVAL if width or height <=0, or if left or top < 0 196 int left, int top, int width, int height);
|
/system/chre/core/ |
H A D | timer_pool.cc | 46 (!mTimerRequests.empty() && mTimerRequests.top() > timerRequest); 174 TimerRequest& currentTimerRequest = mTimerRequests.top();
|
/system/core/libpixelflinger/ |
H A D | raster.cpp | 82 if (yd < GGLint(c->state.scissor.top)) { 83 GGLint offset = GGLint(c->state.scissor.top) - yd; 84 yd = GGLint(c->state.scissor.top); 115 // bottom to top 132 // top to bottom
|
H A D | trap.cpp | 222 if (t < GGLint(c->state.scissor.top)) { 223 ystart += TRI_FROM_INT(c->state.scissor.top-t); 224 t = GGLint(c->state.scissor.top); 287 if (t < GGLint(c->state.scissor.top)) { 288 ystart += TRI_FROM_INT(c->state.scissor.top-t); 289 t = GGLint(c->state.scissor.top); 428 if (t < GGLint(c->state.scissor.top)) 429 t = GGLint(c->state.scissor.top); 547 const int32_t miny = max(bminy, c->state.scissor.top); 644 ALOGI( " top 672 const GGLfixed* top = p1; local 862 const GGLfixed* top = p1; local [all...] |
H A D | clear.cpp | 100 const uint32_t t = c->state.scissor.top;
|
H A D | pixelflinger.cpp | 605 c->state.scissor.top = max(0, t); 609 c->state.scissor.top = 0;
|
/system/media/brillo/audio/audioservice/ |
H A D | audio_daemon.cpp | 74 &files_.top());
|
/system/core/include/utils/ |
H A D | SortedVector.h | 98 //! stack-usage of the vector. returns the top of the stack (last element) 99 const TYPE& top() const; 213 const TYPE& SortedVector<TYPE>::top() const { function in class:android::SortedVector
|
H A D | Vector.h | 118 //! stack-usage of the vector. returns the top of the stack (last element) 119 const TYPE& top() const; 127 //! grants right access to the top of the stack (last element) 155 //! pop the top of the stack (removes the last element). No-op if the stack's empty 159 //! pushes an item on the top of the stack 300 const TYPE& Vector<TYPE>::top() const { function in class:android::Vector
|
/system/core/libutils/include/utils/ |
H A D | SortedVector.h | 98 //! stack-usage of the vector. returns the top of the stack (last element) 99 const TYPE& top() const; 213 const TYPE& SortedVector<TYPE>::top() const { function in class:android::SortedVector
|
H A D | Vector.h | 118 //! stack-usage of the vector. returns the top of the stack (last element) 119 const TYPE& top() const; 127 //! grants right access to the top of the stack (last element) 155 //! pop the top of the stack (removes the last element). No-op if the stack's empty 159 //! pushes an item on the top of the stack 300 const TYPE& Vector<TYPE>::top() const { function in class:android::Vector
|
/system/core/demangle/ |
H A D | Demangler.cpp | 396 cur_state_ = state_stack_.top(); 510 cur_state_ = state_stack_.top();
|
/system/extras/simpleperf/ |
H A D | record.cpp | 998 Record* r = queue_.top().record; 1011 result.emplace_back(queue_.top().record); 1021 Record* r = queue_.top().record;
|
H A D | event_selection_set.cpp | 616 RecordBufferHead* h = q.top();
|
/system/core/libpixelflinger/include/private/pixelflinger/ |
H A D | ggl_context.h | 332 uint32_t top; member in struct:android::scissor_t
|
/system/core/rootdir/ |
H A D | Android.mk | 167 # The A/B updater uses a top-level /postinstall directory to mount the new
|
/system/media/camera/docs/ |
H A D | html.mako | 56 .entry_name { color: #333333; padding-left:1.0em; font-size:1.1em; font-family: monospace; vertical-align:top; } 409 [ <a href="#">top</a> ]
|
/system/sepolicy/ |
H A D | Android.mk | 184 # type of conditional inclusion cannot be done in top-level files such
|