| /external/v8/src/ |
| H A D | lithium-allocator-inl.h | 63 limit_(instr->TempCount()),
69 bool TempIterator::Done() { return current_ >= limit_; }
79 while (current_ < limit_ && instr_->TempAt(current_) == NULL) ++current_;
91 limit_(instr->InputCount()),
97 bool InputIterator::Done() { return current_ >= limit_; }
113 while (current_ < limit_ && instr_->InputAt(current_)->IsConstantOperand()) {
|
| H A D | regexp-stack.h | 79 Address* limit_address() { return &(thread_local_.limit_); }
112 Address limit_; member in struct:v8::internal::RegExpStack::ThreadLocal
116 limit_ = reinterpret_cast<Address>(kMemoryTop);
|
| H A D | zone.cc | 74 limit_(0),
145 limit_ = keep->end();
151 position_ = limit_ = 0;
171 ASSERT(size > limit_ - position_);
210 limit_ = segment->end();
211 ASSERT(position_ <= limit_);
|
| H A D | store-buffer-inl.h | 48 ASSERT(top == limit_);
51 ASSERT(top < limit_);
|
| H A D | regexp-stack.cc | 105 thread_local_.limit_ = new_memory + kStackLimitSlack * kPointerSize;
|
| H A D | store-buffer.cc | 40 limit_(NULL),
64 limit_ = start_ + (kStoreBufferSize / kPointerSize);
85 ASSERT(reinterpret_cast<Address>(limit_) >= virtual_memory_->address());
90 ASSERT(limit_ <= vm_limit);
92 ASSERT((reinterpret_cast<uintptr_t>(limit_) & kStoreBufferOverflowBit) != 0);
93 ASSERT((reinterpret_cast<uintptr_t>(limit_ - 1) & kStoreBufferOverflowBit) ==
115 start_ = limit_ = NULL;
672 ASSERT(top <= limit_);
|
| H A D | zone-inl.h | 58 if (size > limit_ - position_) {
|
| H A D | lithium.h | 538 limit_(env != NULL ? env->values()->length() : 0),
543 bool Done() { return current_ >= limit_; }
565 while (current_ < limit_ && ShouldSkip(env_->values()->at(current_))) {
571 int limit_; member in class:v8::internal::BASE_EMBEDDED
|
| H A D | zone.h | 137 Address limit_; member in class:v8::internal::Zone
|
| H A D | store-buffer.h | 132 Address* limit_; member in class:v8::internal::StoreBuffer
|
| H A D | lithium-allocator.h | 171 int limit_; member in class:v8::internal::BASE_EMBEDDED
187 int limit_; member in class:v8::internal::BASE_EMBEDDED
|
| H A D | heap-inl.h | 59 Page::FromAllocationTop(reinterpret_cast<Address>(limit_)));
61 if ((rear_ - 2) < limit_) {
|
| H A D | frames.cc | 66 : limit_(frame->fp()), handler_(handler) {
74 return handler_ == NULL || handler_->address() > limit_;
82 const Address limit_; member in class:v8::internal::BASE_EMBEDDED
|
| H A D | heap.h | 295 limit_(NULL),
319 limit_ = reinterpret_cast<intptr_t*>(limit);
321 if (limit_ <= rear_) {
362 intptr_t* limit_; member in class:v8::internal::PromotionQueue
|
| H A D | spaces.h | 1988 if (current_ == limit_) return NULL;
1994 if (current_ == limit_) return NULL;
2015 Address limit_; member in class:v8::internal::SemiSpaceIterator
|
| H A D | spaces.cc | 1573 limit_ = end;
|
| H A D | heap.cc | 1103 limit_ = reinterpret_cast<intptr_t*>(heap_->new_space()->ToSpaceStart());
|
| /external/protobuf/src/google/protobuf/io/ |
| H A D | zero_copy_stream_impl.cc | 415 : input_(input), limit_(limit) {}
419 if (limit_ < 0) input_->BackUp(-limit_);
423 if (limit_ <= 0) return false;
426 limit_ -= *size;
427 if (limit_ < 0) {
429 *size += limit_;
435 if (limit_ < 0) {
436 input_->BackUp(count - limit_);
437 limit_
[all...] |
| H A D | zero_copy_stream_impl.h | 346 int64 limit_; // Decreases as we go, becomes negative if we overshoot. member in class:google::protobuf::io::LimitingInputStream
|
| /external/chromium/base/ |
| H A D | utf_offset_string_conversions.h | 62 : limit_(limit) {}
65 if (offset >= limit_)
69 size_t limit_; member in struct:LimitOffset
|
| /external/oprofile/libregex/ |
| H A D | op_regex.cpp | 80 regular_expression_replace::regular_expression_replace(size_t limit_, argument
83 limit(limit_),
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| H A D | expand.h | 485 Weight limit_; // Weight limit member in class:fst::PrunedExpand
683 return less_(limit_, w);
717 if ((final == Weight::Zero()) || less_(limit_, Times(Distance(s), final)))
817 if (less_(limit_, w))
878 limit_ = Times(DistanceToDest(ifst_->Start(), rfst_.Start() - 1), threshold);
|