| /external/v8/tools/ |
| D | consarray.js | 40 this.tail_ = new ConsArray.Cell(null, null);
41 this.currCell_ = this.tail_;
55 this.tail_.data = arr;
56 this.tail_ = this.tail_.next = new ConsArray.Cell(null, null);
|
| /external/marisa-trie/v0_1_5/lib/marisa_alpha/ |
| D | trie.cc | 10 trie_(), tail_(), num_first_branches_(0), num_keys_(0) {} in Trie()
33 temp.tail_.map(mapper); in map()
74 temp.tail_.read(reader); in read()
114 tail_.write(writer); in write()
141 + tail_.total_size() + sizeof(num_first_branches_) + sizeof(num_keys_); in total_size()
156 tail_.swap(&rhs->tail_); in swap()
|
| D | trie-build.cc | 140 progress.test_total_size(tail_.total_size()); in build_trie()
149 } else if (tail_.mode() == MARISA_ALPHA_BINARY_TAIL) { in build_trie()
160 if (has_trie() || (tail_.mode() == MARISA_ALPHA_TEXT_TAIL)) { in build_trie()
169 progress.test_total_size(tail_.total_size()); in build_trie()
282 tail_.build(strs, terminals, progress.tail()); in build_next()
305 tail_.build(strs, terminals, progress.tail()); in build_next()
|
| D | trie-search.cc | 305 if (tail_.mode() == MARISA_ALPHA_BINARY_TAIL) { in tail_restore()
308 key->append(reinterpret_cast<const char *>(tail_[offset]), length); in tail_restore()
310 key->append(reinterpret_cast<const char *>(tail_[offset])); in tail_restore()
367 if (tail_.mode() == MARISA_ALPHA_BINARY_TAIL) { in tail_restore()
368 const UInt8 *ptr = tail_[offset]; in tail_restore()
378 for (const UInt8 *str = tail_[offset]; *str != '\0'; ++str) { in tail_restore()
453 const UInt8 *ptr = tail_[offset]; in tail_match()
456 } else if (tail_.mode() == MARISA_ALPHA_BINARY_TAIL) { in tail_match()
745 const UInt8 *ptr = tail_[offset]; in tail_prefix_match()
748 } else if (tail_.mode() == MARISA_ALPHA_BINARY_TAIL) { in tail_prefix_match()
|
| D | trie-inline.h | 355 return !tail_.empty(); in has_tail()
|
| D | trie.h | 202 Tail tail_; variable
|
| /external/marisa-trie/lib/marisa/ |
| D | trie.cc | 10 trie_(), tail_(), num_first_branches_(0), num_keys_(0) {} in Trie()
33 temp.tail_.map(mapper); in map()
74 temp.tail_.read(reader); in read()
114 tail_.write(writer); in write()
141 + tail_.total_size() + sizeof(num_first_branches_) + sizeof(num_keys_); in total_size()
156 tail_.swap(&rhs->tail_); in swap()
|
| D | trie-build.cc | 131 progress.test_total_size(tail_.total_size()); in build_trie()
140 } else if (tail_.mode() == MARISA_BINARY_TAIL) { in build_trie()
151 if (has_trie() || (tail_.mode() == MARISA_TEXT_TAIL)) { in build_trie()
160 progress.test_total_size(tail_.total_size()); in build_trie()
268 tail_.build(strs, terminals, progress.tail()); in build_next()
291 tail_.build(strs, terminals, progress.tail()); in build_next()
|
| D | trie-search.cc | 286 if (tail_.mode() == MARISA_BINARY_TAIL) { in tail_restore()
289 key->append(reinterpret_cast<const char *>(tail_[offset]), length); in tail_restore()
291 key->append(reinterpret_cast<const char *>(tail_[offset])); in tail_restore()
348 if (tail_.mode() == MARISA_BINARY_TAIL) { in tail_restore()
349 const UInt8 *ptr = tail_[offset]; in tail_restore()
359 for (const UInt8 *str = tail_[offset]; *str != '\0'; ++str) { in tail_restore()
434 const UInt8 *ptr = tail_[offset]; in tail_match()
437 } else if (tail_.mode() == MARISA_BINARY_TAIL) { in tail_match()
714 const UInt8 *ptr = tail_[offset]; in tail_prefix_match()
717 } else if (tail_.mode() == MARISA_BINARY_TAIL) { in tail_prefix_match()
|
| D | trie-inline.h | 346 return !tail_.empty(); in has_tail()
|
| D | trie.h | 202 Tail tail_; variable
|
| /external/v8/src/ |
| D | futex-emulation.cc | 41 FutexWaitList::FutexWaitList() : head_(nullptr), tail_(nullptr) {} in FutexWaitList()
46 if (tail_) { in AddNode()
47 tail_->next_ = node; in AddNode()
52 node->prev_ = tail_; in AddNode()
54 tail_ = node; in AddNode()
68 tail_ = node->prev_; in RemoveNode()
|
| D | locked-queue-inl.h | 26 tail_ = head_;
50 tail_->next.SetValue(n);
51 tail_ = n;
|
| D | locked-queue.h | 35 Node* tail_; variable
|
| D | futex-emulation.h | 76 FutexWaitListNode* tail_; variable
|
| D | log.cc | 563 if (Succ(head_) == static_cast<int>(base::NoBarrier_Load(&tail_))) { in Insert()
582 *sample = buffer_[base::NoBarrier_Load(&tail_)]; in Remove()
584 base::NoBarrier_Store(&tail_, static_cast<base::Atomic32>( in Remove()
585 Succ(base::NoBarrier_Load(&tail_)))); in Remove()
599 base::Atomic32 tail_; // Index to the buffer tail. member in v8::internal::Profiler
684 base::NoBarrier_Store(&tail_, 0); in Profiler()
|
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| D | cons.h | 75 Cell(const T& head, const List<T>& tail) : head_(head), tail_(tail) {} in Cell()
81 const List<T>& tail() const { return tail_; } in tail()
87 List<T> tail_; variable
|
| /external/webp/src/enc/ |
| D | backward_references.c | 99 if (refs->tail_ != NULL) { in ClearBackwardRefs()
100 *refs->tail_ = refs->free_blocks_; // recycle all blocks at once in ClearBackwardRefs()
103 refs->tail_ = &refs->refs_; in ClearBackwardRefs()
121 refs->tail_ = &refs->refs_; in VP8LBackwardRefsInit()
161 *refs->tail_ = b; in BackwardRefsNewBlock()
162 refs->tail_ = &b->next_; in BackwardRefsNewBlock()
|
| D | backward_references.h | 146 PixOrCopyBlock** tail_; // for list recycling member
|
| /external/v8/src/crankshaft/ |
| D | hydrogen-instructions.cc | 320 while (tail_ != NULL && tail_->value()->CheckFlag(HValue::kIsDead)) { in tail()
321 tail_ = tail_->tail_; in tail()
323 return tail_; in tail()
|
| D | hydrogen-instructions.h | 273 : tail_(tail), value_(value), index_(index) { in HUseListNode()
280 void set_tail(HUseListNode* list) { tail_ = list; } in set_tail()
284 tail_ = reinterpret_cast<HUseListNode*>(1); in Zap()
291 HUseListNode* tail_;
|