start_ 374 src/compiler.h start_(OS::Ticks()),
start_ 378 src/compiler.h *location_ += (OS::Ticks() - start_);
start_ 382 src/compiler.h int64_t start_;
start_ 3554 src/debug.cc int result = start_;
start_ 3555 src/debug.cc start_ = (start_ + 1) % size_;
start_ 3561 src/debug.cc if ((end_ + 1) % size_ == start_) {
start_ 3578 src/debug.cc new_queue.start_ = new_queue.end_;
start_ 720 src/debug.h bool IsEmpty() const { return start_ == end_; }
start_ 723 src/debug.h void Clear() { start_ = end_ = 0; } // Queue is empty after Clear().
start_ 729 src/debug.h int start_;
start_ 9553 src/hydrogen.cc if (FLAG_hydrogen_stats) start_ = OS::Ticks();
start_ 9562 src/hydrogen.cc HStatistics::Instance()->SaveTiming(name_, end - start_, size);
start_ 1367 src/hydrogen.h int64_t start_;
start_ 436 src/lithium-allocator.cc first_interval_->start_ = Min(start, first_interval_->start_);
start_ 209 src/lithium-allocator.h : start_(start), end_(end), next_(NULL) {
start_ 213 src/lithium-allocator.h LifetimePosition start() const { return start_; }
start_ 224 src/lithium-allocator.h if (other->start().Value() < start_.Value()) return other->Intersect(this);
start_ 230 src/lithium-allocator.h return start_.Value() <= point.Value() && point.Value() < end_.Value();
start_ 234 src/lithium-allocator.h void set_start(LifetimePosition start) { start_ = start; }
start_ 237 src/lithium-allocator.h LifetimePosition start_;
start_ 1212 src/mips/assembler-mips.h start_ = 0;
start_ 1218 src/mips/assembler-mips.h start_ = start;
start_ 1224 src/mips/assembler-mips.h return start_;
start_ 1246 src/mips/assembler-mips.h int start_;
start_ 413 src/objects-inl.h return static_cast<const byte*>(start_)[index];
start_ 415 src/objects-inl.h return static_cast<const uc16*>(start_)[index];
start_ 6402 src/objects.cc start_ = content.ToAsciiVector().start();
start_ 6404 src/objects.cc start_ = content.ToUC16Vector().start();
start_ 7794 src/objects.h const void* start_;
start_ 4343 src/parser.cc SingletonLogger() : has_error_(false), start_(-1), end_(-1) { }
start_ 4354 src/parser.cc start_ = start;
start_ 4374 src/parser.cc start_ = start;
start_ 4397 src/parser.cc int start() { return start_; }
start_ 4422 src/parser.cc int start_;
start_ 1089 src/spaces.cc start_ = chunk_base_;
start_ 1092 src/spaces.cc object_expected_ = reinterpret_cast<uintptr_t>(start_) | kHeapObjectTag;
start_ 1110 src/spaces.cc start_ = NULL;
start_ 1334 src/spaces.cc start_ = start;
start_ 1338 src/spaces.cc age_mark_ = start_;
start_ 1343 src/spaces.cc start_ = NULL;
start_ 1351 src/spaces.cc Address end = start_ + maximum_capacity_;
start_ 1375 src/spaces.cc Address start = start_ + maximum_capacity_ - capacity_;
start_ 1397 src/spaces.cc Address end = start_ + maximum_capacity_;
start_ 1433 src/spaces.cc Address space_end = start_ + maximum_capacity_;
start_ 1821 src/spaces.h start_(NULL),
start_ 1835 src/spaces.h bool HasBeenSetUp() { return start_ != NULL; }
start_ 1886 src/spaces.h == reinterpret_cast<uintptr_t>(start_);
start_ 1952 src/spaces.h Address start_;
start_ 2099 src/spaces.h == reinterpret_cast<uintptr_t>(start_);
start_ 2168 src/spaces.h Address start() { return start_; }
start_ 2175 src/spaces.h return static_cast<uint32_t>(addr - start_) >> kPointerSizeLog2;
start_ 2292 src/spaces.h Address start_;
start_ 39 src/store-buffer.cc start_(NULL),
start_ 62 src/store-buffer.cc start_ =
start_ 64 src/store-buffer.cc limit_ = start_ + (kStoreBufferSize / kPointerSize);
start_ 84 src/store-buffer.cc ASSERT(reinterpret_cast<Address>(start_) >= virtual_memory_->address());
start_ 89 src/store-buffer.cc ASSERT(start_ <= vm_limit);
start_ 96 src/store-buffer.cc CHECK(virtual_memory_->Commit(reinterpret_cast<Address>(start_),
start_ 99 src/store-buffer.cc heap_->public_set_store_buffer_top(start_);
start_ 115 src/store-buffer.cc start_ = limit_ = NULL;
start_ 116 src/store-buffer.cc heap_->public_set_store_buffer_top(start_);
start_ 339 src/store-buffer.cc for (Address* current = top - 1; current >= start_; current--) {
start_ 668 src/store-buffer.cc if (top == start_) return;
start_ 673 src/store-buffer.cc heap_->public_set_store_buffer_top(start_);
start_ 674 src/store-buffer.cc EnsureSpace(top - start_);
start_ 681 src/store-buffer.cc for (Address* current = start_; current < top; current++) {
start_ 131 src/store-buffer.h Address* start_;
start_ 82 src/string-search.h start_(Max(0, pattern.length() - kBMMaxShift)) {
start_ 184 src/string-search.h return isolate_->good_suffix_shift_table() - start_;
start_ 192 src/string-search.h return isolate_->suffix_table() - start_;
start_ 201 src/string-search.h int start_;
start_ 307 src/string-search.h int start = search->start_;
start_ 357 src/string-search.h int start = start_;
start_ 479 src/string-search.h int start = start_;
start_ 364 src/utils.h Vector() : start_(NULL), length_(0) {}
start_ 365 src/utils.h Vector(T* data, int length) : start_(data), length_(length) {
start_ 389 src/utils.h T* start() const { return start_; }
start_ 394 src/utils.h return start_[index];
start_ 399 src/utils.h T& first() { return start_[0]; }
start_ 401 src/utils.h T& last() { return start_[length_ - 1]; }
start_ 406 src/utils.h for (int i = 0; i < length_; i++) result[i] = start_[i];
start_ 430 src/utils.h DeleteArray(start_);
start_ 431 src/utils.h start_ = NULL;
start_ 437 src/utils.h return Vector<T>(start_ + offset, length_ - offset);
start_ 450 src/utils.h void set_start(T* start) { start_ = start; }
start_ 453 src/utils.h T* start_;