/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/libunwindstack/ |
H A D | DwarfOp.cpp | 248 AddressType top = stack_[0]; local 251 stack_[2] = top; 267 AddressType top = StackPop(); local 268 stack_[0] &= top; 274 AddressType top = StackPop(); local 275 if (top == 0) { 279 SignedType signed_divisor = static_cast<SignedType>(top); 287 AddressType top = StackPop(); local 288 stack_[0] -= top; 294 AddressType top local 305 AddressType top = StackPop(); local 325 AddressType top = StackPop(); local 332 AddressType top = StackPop(); local 345 AddressType top = StackPop(); local 346 stack_[0] <<= top; local 352 AddressType top = StackPop(); local 353 stack_[0] >>= top; local 359 AddressType top = StackPop(); local 367 AddressType top = StackPop(); local 375 AddressType top = StackPop(); local 389 AddressType top = StackPop(); local 396 AddressType top = StackPop(); local 403 AddressType top = StackPop(); local 410 AddressType top = StackPop(); local 417 AddressType top = StackPop(); local 424 AddressType top = StackPop(); local [all...] |
H A D | DwarfCfa.cpp | 397 *loc_regs = loc_reg_state_.top();
|
/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) { 102 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 | 191 * return -EINVAL if width or height <=0, or if left or top < 0 194 int left, int top, int width, int height);
|
/system/core/property_service/libpropertyinfoparser/ |
H A D | property_info_parser.cpp | 35 int top = array_length - 1; local 36 while (top >= bottom) { 37 int search = (top + bottom) / 2; 43 if (cmp > 0) top = search - 1;
|
/system/chre/core/ |
H A D | timer_pool.cc | 44 (!mTimerRequests.empty() && mTimerRequests.top() > timerRequest); 156 TimerRequest& currentTimerRequest = mTimerRequests.top();
|
/system/extras/simpleperf/ |
H A D | CallChainJoiner.cpp | 53 // 2. Check if the (tid, ip, sp) tuples of the top [matched_node_count_to_extend_callchain] 76 CacheNode* top = chain.back(); local 77 while ((top = GetParent(top)) != nullptr) { 78 if (top->sp == chain.back()->sp) { 83 for (auto it = chain.rbegin(); it != chain.rend() && (*it)->sp == top->sp; ++it) { 84 if ((*it)->ip == top->ip) { 96 ips.push_back(top->ip); 97 sps.push_back(top->sp);
|
H A D | record.cpp | 1285 Record* r = queue_.top().record; 1298 result.emplace_back(queue_.top().record); 1308 Record* r = queue_.top().record;
|
/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); 426 if (t < GGLint(c->state.scissor.top)) 427 t = GGLint(c->state.scissor.top); 545 const int32_t miny = max(bminy, c->state.scissor.top); 642 ALOGI( " top 670 const GGLfixed* top = p1; local 860 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/core/include/utils/ |
H A D | SortedVector.h | 100 //! stack-usage of the vector. returns the top of the stack (last element) 101 const TYPE& top() const; 215 const TYPE& SortedVector<TYPE>::top() const { function in class:android::SortedVector
|
H A D | Vector.h | 120 //! stack-usage of the vector. returns the top of the stack (last element) 121 const TYPE& top() const; 129 //! grants right access to the top of the stack (last element) 157 //! pop the top of the stack (removes the last element). No-op if the stack's empty 161 //! pushes an item on the top of the stack 302 const TYPE& Vector<TYPE>::top() const { function in class:android::Vector
|
/system/core/libutils/include/utils/ |
H A D | SortedVector.h | 100 //! stack-usage of the vector. returns the top of the stack (last element) 101 const TYPE& top() const; 215 const TYPE& SortedVector<TYPE>::top() const { function in class:android::SortedVector
|
H A D | Vector.h | 120 //! stack-usage of the vector. returns the top of the stack (last element) 121 const TYPE& top() const; 129 //! grants right access to the top of the stack (last element) 157 //! pop the top of the stack (removes the last element). No-op if the stack's empty 161 //! pushes an item on the top of the stack 302 const TYPE& Vector<TYPE>::top() const { function in class:android::Vector
|
/system/bt/profile/avrcp/ |
H A D | device.h | 243 return current_path_.top();
|
/system/core/demangle/ |
H A D | Demangler.cpp | 442 cur_state_ = state_stack_.top(); 556 cur_state_ = state_stack_.top(); 858 // At the top level is the only place where T is allowed.
|
/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 | 128 # The A/B updater uses a top-level /postinstall directory to mount the new
|
/system/media/camera/docs/ |
H A D | html.mako | 57 .entry_name { color: #333333; padding-left:1.0em; font-size:1.1em; font-family: monospace; vertical-align:top; } 416 [ <a href="#">top</a> ]
|