Node 44 src/global-handles.cc class GlobalHandles::Node {
Node 57 src/global-handles.cc static Node* FromLocation(Object** location) {
Node 58 src/global-handles.cc ASSERT(OFFSET_OF(Node, object_) == 0);
Node 59 src/global-handles.cc return reinterpret_cast<Node*>(location);
Node 175 src/global-handles.cc Node* next_free() {
Node 213 src/global-handles.cc if (state_ != Node::PENDING) return false;
Node 272 src/global-handles.cc Node* next_free;
Node 292 src/global-handles.cc Node* node_at(int index) {
Node 328 src/global-handles.cc Node nodes_[kSize];
Node 336 src/global-handles.cc GlobalHandles::NodeBlock* GlobalHandles::Node::FindBlock() {
Node 338 src/global-handles.cc ptr = ptr - index_ * sizeof(Node);
Node 345 src/global-handles.cc void GlobalHandles::Node::IncreaseBlockUses(GlobalHandles* global_handles) {
Node 350 src/global-handles.cc void GlobalHandles::Node::DecreaseBlockUses(GlobalHandles* global_handles) {
Node 363 src/global-handles.cc Node* node() const {
Node 414 src/global-handles.cc Node* result = first_free_;
Node 430 src/global-handles.cc Node::FromLocation(location)->Release(this);
Node 437 src/global-handles.cc Node::FromLocation(location)->MakeWeak(this, parameter, callback);
Node 442 src/global-handles.cc Node::FromLocation(location)->ClearWeakness(this);
Node 447 src/global-handles.cc Node::FromLocation(location)->MarkIndependent();
Node 452 src/global-handles.cc return Node::FromLocation(location)->IsNearDeath();
Node 457 src/global-handles.cc return Node::FromLocation(location)->IsWeak();
Node 462 src/global-handles.cc Node::FromLocation(location)->set_wrapper_class_id(class_id);
Node 494 src/global-handles.cc Node* node = new_space_nodes_[i];
Node 506 src/global-handles.cc Node* node = new_space_nodes_[i];
Node 518 src/global-handles.cc Node* node = new_space_nodes_[i];
Node 537 src/global-handles.cc Node* node = new_space_nodes_[i];
Node 572 src/global-handles.cc Node* node = new_space_nodes_[i];
Node 621 src/global-handles.cc if (it.node()->state() == Node::WEAK) {
Node 623 src/global-handles.cc } else if (it.node()->state() == Node::PENDING) {
Node 625 src/global-handles.cc } else if (it.node()->state() == Node::NEAR_DEATH) {
Node 627 src/global-handles.cc } else if (it.node()->state() == Node::FREE) {
Node 644 src/global-handles.cc if (it.node()->state() == Node::WEAK) weak++;
Node 645 src/global-handles.cc if (it.node()->state() == Node::PENDING) pending++;
Node 646 src/global-handles.cc if (it.node()->state() == Node::NEAR_DEATH) near_death++;
Node 647 src/global-handles.cc if (it.node()->state() == Node::FREE) destroyed++;
Node 651 src/global-handles.cc PrintF(" allocated memory = %" V8_PTR_PREFIX "dB\n", sizeof(Node) * total);
Node 678 src/global-handles.cc ASSERT(!Node::FromLocation(handles[i])->is_independent());
Node 693 src/global-handles.cc ASSERT(!Node::FromLocation(BitCast<Object**>(parent))->is_independent());
Node 695 src/global-handles.cc ASSERT(!Node::FromLocation(children[i])->is_independent());
Node 242 src/global-handles.h class Node;
Node 266 src/global-handles.h Node* first_free_;
Node 270 src/global-handles.h List<Node*> new_space_nodes_;
Node 1478 src/jsregexp.cc void Type##Node::Accept(NodeVisitor* visitor) { \
Node 4232 src/jsregexp.cc virtual void Visit##Type(Type##Node* that);
Node 1495 src/jsregexp.h virtual void Visit##Type(Type##Node* that) = 0;
Node 1522 src/jsregexp.h virtual void Visit##Type(Type##Node* that);
Node 1558 src/jsregexp.h virtual void Visit##Type(Type##Node* that);
Node 49 src/splay-tree-inl.h root_ = new(allocator_) Node(key, Config::NoValue());
Node 61 src/splay-tree-inl.h Node* node = new(allocator_) Node(key, Config::NoValue());
Node 70 src/splay-tree-inl.h void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
Node 119 src/splay-tree-inl.h Node* temp = root_;
Node 143 src/splay-tree-inl.h Node* temp = root_;
Node 156 src/splay-tree-inl.h Node* current = root_;
Node 168 src/splay-tree-inl.h Node* current = root_;
Node 181 src/splay-tree-inl.h Node* node_to_move = root_;
Node 200 src/splay-tree-inl.h Node* node_to_remove = root_;
Node 214 src/splay-tree-inl.h Node* right = root_->right_;
Node 230 src/splay-tree-inl.h Node dummy_node(Config::kNoKey, Config::NoValue());
Node 236 src/splay-tree-inl.h Node* dummy = &dummy_node;
Node 237 src/splay-tree-inl.h Node* left = dummy;
Node 238 src/splay-tree-inl.h Node* right = dummy;
Node 239 src/splay-tree-inl.h Node* current = root_;
Node 247 src/splay-tree-inl.h Node* temp = current->left_;
Node 263 src/splay-tree-inl.h Node* temp = current->right_;
Node 297 src/splay-tree-inl.h List<Node*, Allocator> nodes_to_visit(10, allocator_);
Node 301 src/splay-tree-inl.h Node* node = nodes_to_visit[pos++];
Node 115 src/splay-tree.h class Node {
Node 117 src/splay-tree.h Node(const Key& key, const Value& value)
Node 137 src/splay-tree.h Node* left() { return left_; }
Node 138 src/splay-tree.h Node* right() { return right_; }
Node 145 src/splay-tree.h Node* left_;
Node 146 src/splay-tree.h Node* right_;
Node 153 src/splay-tree.h explicit Locator(Node* node) : node_(node) { }
Node 158 src/splay-tree.h inline void bind(Node* node) { node_ = node; }
Node 161 src/splay-tree.h Node* node_;
Node 177 src/splay-tree.h void InsertInternal(int cmp, Node* node);
Node 187 src/splay-tree.h void Call(Node* node) {
Node 200 src/splay-tree.h void Call(Node* node) { AllocationPolicy::Delete(node); }
Node 209 src/splay-tree.h Node* root_;
Node 37 src/unbound-queue-inl.h struct UnboundQueue<Record>::Node: public Malloced {
Node 38 src/unbound-queue-inl.h explicit Node(const Record& value)
Node 43 src/unbound-queue-inl.h Node* next;
Node 49 src/unbound-queue-inl.h first_ = new Node(Record());
Node 62 src/unbound-queue-inl.h Node* tmp = first_;
Node 71 src/unbound-queue-inl.h Node* next = reinterpret_cast<Node*>(divider_)->next;
Node 79 src/unbound-queue-inl.h Node*& next = reinterpret_cast<Node*>(last_)->next;
Node 80 src/unbound-queue-inl.h next = new Node(rec);
Node 82 src/unbound-queue-inl.h while (first_ != reinterpret_cast<Node*>(divider_)) DeleteFirst();
Node 89 src/unbound-queue-inl.h Node* next = reinterpret_cast<Node*>(divider_)->next;
Node 57 src/unbound-queue.h struct Node;
Node 59 src/unbound-queue.h Node* first_;