Node 12 base/containers/linked_list_unittest.cc class Node : public LinkNode<Node> { Node 37 base/containers/linked_list_unittest.cc void ExpectListContentsForDirection(const LinkedList<Node>& list, Node 40 base/containers/linked_list_unittest.cc for (const LinkNode<Node>* node = (forward ? list.head() : list.tail()); Node 51 base/containers/linked_list_unittest.cc void ExpectListContents(const LinkedList<Node>& list, Node 65 base/containers/linked_list_unittest.cc LinkedList<Node> list; Node 72 base/containers/linked_list_unittest.cc LinkedList<Node> list; Node 75 base/containers/linked_list_unittest.cc Node n1(1); Node 85 base/containers/linked_list_unittest.cc Node n2(2); Node 95 base/containers/linked_list_unittest.cc Node n3(3); Node 107 base/containers/linked_list_unittest.cc LinkedList<Node> list; Node 109 base/containers/linked_list_unittest.cc Node n1(1); Node 110 base/containers/linked_list_unittest.cc Node n2(2); Node 111 base/containers/linked_list_unittest.cc Node n3(3); Node 112 base/containers/linked_list_unittest.cc Node n4(4); Node 113 base/containers/linked_list_unittest.cc Node n5(5); Node 182 base/containers/linked_list_unittest.cc LinkedList<Node> list; Node 184 base/containers/linked_list_unittest.cc Node n1(1); Node 185 base/containers/linked_list_unittest.cc Node n2(2); Node 186 base/containers/linked_list_unittest.cc Node n3(3); Node 187 base/containers/linked_list_unittest.cc Node n4(4); Node 219 base/containers/linked_list_unittest.cc LinkedList<Node> list; Node 221 base/containers/linked_list_unittest.cc Node n1(1); Node 222 base/containers/linked_list_unittest.cc Node n2(2); Node 223 base/containers/linked_list_unittest.cc Node n3(3); Node 224 base/containers/linked_list_unittest.cc Node n4(4); Node 174 cc/debug/rasterize_and_record_benchmark_impl.cc graph.nodes.push_back(internal::TaskGraph::Node( Node 437 cc/output/direct_renderer.cc internal::TaskGraph::Node(on_demand_raster_task, Node 324 cc/resources/raster_worker_pool.cc for (internal::TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); Node 327 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node& node = *it; Node 410 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node::TaskComparator(task)) == Node 413 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node(task, priority, dependencies)); Node 438 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node::Vector::iterator decode_it = Node 441 cc/resources/raster_worker_pool.cc internal::TaskGraph::Node::TaskComparator(decode_task)); Node 25 cc/resources/task_graph_runner.cc TaskGraph::Node& operator->() const { Node 32 cc/resources/task_graph_runner.cc TaskGraph::Node& operator*() const { Node 49 cc/resources/task_graph_runner.cc TaskGraph::Node::Vector::iterator it = Node 52 cc/resources/task_graph_runner.cc TaskGraph::Node::TaskComparator( Node 66 cc/resources/task_graph_runner.cc TaskGraph::Node* current_node_; Node 74 cc/resources/task_graph_runner.cc bool operator()(const TaskGraph::Node& node) const { Node 180 cc/resources/task_graph_runner.cc TaskGraph::Node& node = *node_it; Node 188 cc/resources/task_graph_runner.cc for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); Node 191 cc/resources/task_graph_runner.cc TaskGraph::Node& node = *it; Node 196 cc/resources/task_graph_runner.cc TaskGraph::Node::Vector::iterator old_it = Node 199 cc/resources/task_graph_runner.cc TaskGraph::Node::TaskComparator(node.task)); Node 233 cc/resources/task_graph_runner.cc for (TaskGraph::Node::Vector::iterator it = graph->nodes.begin(); Node 236 cc/resources/task_graph_runner.cc TaskGraph::Node& node = *it; Node 429 cc/resources/task_graph_runner.cc TaskGraph::Node& dependent_node = *it; Node 47 cc/resources/task_graph_runner.h bool operator()(const Node& node) const { return node.task == task_; } Node 53 cc/resources/task_graph_runner.h typedef std::vector<Node> Vector; Node 55 cc/resources/task_graph_runner.h Node(Task* task, unsigned priority, size_t dependencies) Node 79 cc/resources/task_graph_runner.h Node::Vector nodes; Node 240 cc/resources/task_graph_runner_perftest.cc graph->nodes.push_back(internal::TaskGraph::Node(it->get(), 0u, 0u)); Node 247 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph::Node(it->get(), 0u, leaf_tasks.size())); Node 269 cc/resources/task_graph_runner_perftest.cc internal::TaskGraph::Node(it->get(), 0u, tasks.size())); Node 92 cc/resources/task_graph_runner_unittest.cc internal::TaskGraph::Node(new_task.get(), it->priority, 0u)); Node 97 cc/resources/task_graph_runner_unittest.cc new_graph.nodes.push_back(internal::TaskGraph::Node( Node 10 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java import org.chromium.chrome.browser.omaha.XMLParser.Node; Node 86 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java Node rootNode = parser.getRootNode(); Node 123 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private boolean logError(Node node, int errorCode) throws RequestFailureException { Node 131 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private void parseRootNode(Node rootNode) throws RequestFailureException { Node 144 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private boolean parseResponseNode(Node node) throws RequestFailureException { Node 152 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java Node current = node.children.get(i); Node 179 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private boolean parseDaystartNode(Node node) throws RequestFailureException { Node 188 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private boolean parseAppNode(Node node) throws RequestFailureException { Node 195 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java Node current = node.children.get(i); Node 214 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private boolean parseUpdatecheck(Node node) throws RequestFailureException { Node 220 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java Node current = node.children.get(i); Node 246 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private void parsePing(Node node) { Node 250 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private void parseEvent(Node node) { Node 254 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private void parseUrls(Node node) { Node 256 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java Node current = node.children.get(i); Node 261 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private void parseUrl(Node node) { Node 270 chrome/android/java/src/org/chromium/chrome/browser/omaha/ResponseParser.java private void parseManifest(Node node) { Node 34 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java public final List<Node> children; Node 39 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java children = new ArrayList<Node>(); Node 43 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java private final Node mRootNode; Node 44 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java private final Stack<Node> mTagStack; Node 47 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java mRootNode = new Node(null); Node 48 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java mTagStack = new Stack<Node>(); Node 75 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java public Node getRootNode() { Node 84 chrome/android/java/src/org/chromium/chrome/browser/omaha/XMLParser.java Node currentNode = new Node(qName); Node 13 chrome/browser/sync_file_system/subtree_set.cc SubtreeSet::Node::Node() Node 18 chrome/browser/sync_file_system/subtree_set.cc SubtreeSet::Node::Node(bool contained_as_subtree_root, Node 56 chrome/browser/sync_file_system/subtree_set.cc = Node(true, 1); Node 43 chrome/browser/sync_file_system/subtree_set.h Node(); Node 44 chrome/browser/sync_file_system/subtree_set.h Node(bool contained_as_subtree_root, Node 49 chrome/browser/sync_file_system/subtree_set.h typedef base::hash_map<StringType, Node> Subtrees; Node 66 components/sync_driver/model_associator.h template <class Node, class IDType> Node 77 components/sync_driver/model_associator.h virtual const Node* GetChromeNodeFromSyncId(int64 sync_id) = 0; Node 87 components/sync_driver/model_associator.h virtual void Associate(const Node* node, int64 sync_id) = 0; Node 135 courgette/adjustment_method.cc Node(LabelInfo* in_edge, Node* prev) Node 141 courgette/adjustment_method.cc Node* prev_; // Node at shorter length. Node 144 courgette/adjustment_method.cc typedef std::map<LabelInfo*, Node*> Edges; Node 147 courgette/adjustment_method.cc std::list<Node*> edges_in_frequency_order; Node 157 courgette/adjustment_method.cc static std::string ToString(Node* node) { Node 159 courgette/adjustment_method.cc for (Node* n = node; n->prev_; n = n->prev_) Node 182 courgette/adjustment_method.cc bool operator()(Node* a, Node* b) const { Node 190 courgette/adjustment_method.cc bool operator()(Node* a, Node* b) const { Node 226 courgette/adjustment_method.cc Node* node = *worklist_.begin(); Node 237 courgette/adjustment_method.cc void AddToQueue(Node* node) { Node 255 courgette/adjustment_method.cc void SkipCommittedLabels(Node* node) { Node 267 courgette/adjustment_method.cc void TrySolveNode(Node* p_node) { Node 268 courgette/adjustment_method.cc Node* front = p_node->edges_in_frequency_order.front(); Node 279 courgette/adjustment_method.cc Node* m_node = FindModelNode(p_node); Node 297 courgette/adjustment_method.cc Node* m_match = m_node->edges_in_frequency_order.front(); Node 298 courgette/adjustment_method.cc Node* p_match = p_node->edges_in_frequency_order.front(); Node 495 courgette/adjustment_method.cc Node* FindModelNode(Node* node) { Node 499 courgette/adjustment_method.cc Node* m_parent = FindModelNode(node->prev_); Node 513 courgette/adjustment_method.cc Node::Edges::iterator e = m_parent->edges_.find(m_label); Node 522 courgette/adjustment_method.cc Node* MakeRootNode(const Trace& trace) { Node 523 courgette/adjustment_method.cc Node* node = new Node(NULL, NULL); Node 532 courgette/adjustment_method.cc void ExtendNode(Node* node, const Trace& trace) { Node 540 courgette/adjustment_method.cc Node*& slot = node->edges_[item]; Node 542 courgette/adjustment_method.cc slot = new Node(item, node); Node 555 courgette/adjustment_method.cc Node* m_root_; Node 556 courgette/adjustment_method.cc Node* p_root_; Node 561 courgette/adjustment_method.cc std::vector<Node*> all_nodes_; Node 12 native_client_sdk/src/libraries/nacl_io/char_node.h class CharNode : public Node { Node 14 native_client_sdk/src/libraries/nacl_io/char_node.h explicit CharNode(Filesystem* filesystem) : Node(filesystem) { Node 35 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.cc class RealNode : public Node { Node 80 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.cc class ZeroNode : public Node { Node 94 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.cc class UrandomNode : public Node { Node 114 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.cc RealNode::RealNode(Filesystem* filesystem, int fd) : Node(filesystem), fd_(fd) { Node 190 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.cc ZeroNode::ZeroNode(Filesystem* filesystem) : Node(filesystem) { Node 211 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.cc UrandomNode::UrandomNode(Filesystem* filesystem) : Node(filesystem) { Node 13 native_client_sdk/src/libraries/nacl_io/devfs/dev_fs.h class Node; Node 24 native_client_sdk/src/libraries/nacl_io/dir_node.cc : Node(filesystem), Node 25 native_client_sdk/src/libraries/nacl_io/dir_node.h class DirNode : public Node { Node 41 native_client_sdk/src/libraries/nacl_io/filesystem.cc void Filesystem::OnNodeCreated(Node* node) { Node 46 native_client_sdk/src/libraries/nacl_io/filesystem.cc void Filesystem::OnNodeDestroyed(Node* node) { Node 25 native_client_sdk/src/libraries/nacl_io/filesystem.h class Node; Node 89 native_client_sdk/src/libraries/nacl_io/filesystem.h void OnNodeCreated(Node* node); Node 92 native_client_sdk/src/libraries/nacl_io/filesystem.h void OnNodeDestroyed(Node* node); Node 207 native_client_sdk/src/libraries/nacl_io/fusefs/fuse_fs.cc : Node(filesystem), fuse_ops_(fuse_ops), info_(info), path_(path) {} Node 217 native_client_sdk/src/libraries/nacl_io/fusefs/fuse_fs.cc return Node::CanOpen(open_flags); Node 41 native_client_sdk/src/libraries/nacl_io/fusefs/fuse_fs.h class FuseFsNode : public Node { Node 17 native_client_sdk/src/libraries/nacl_io/html5fs/html5_fs.h class Node; Node 255 native_client_sdk/src/libraries/nacl_io/html5fs/html5_fs_node.cc : Node(filesystem), Node 260 native_client_sdk/src/libraries/nacl_io/html5fs/html5_fs_node.cc Error error = Node::Init(open_flags); Node 297 native_client_sdk/src/libraries/nacl_io/html5fs/html5_fs_node.cc Node::Destroy(); Node 15 native_client_sdk/src/libraries/nacl_io/html5fs/html5_fs_node.h class Html5FsNode : public Node { Node 219 native_client_sdk/src/libraries/nacl_io/httpfs/http_fs_node.cc : Node(filesystem), Node 20 native_client_sdk/src/libraries/nacl_io/httpfs/http_fs_node.h class HttpFsNode : public Node { Node 26 native_client_sdk/src/libraries/nacl_io/memfs/mem_fs_node.cc MemFsNode::MemFsNode(Filesystem* filesystem) : Node(filesystem) { Node 14 native_client_sdk/src/libraries/nacl_io/memfs/mem_fs_node.h class MemFsNode : public Node { Node 28 native_client_sdk/src/libraries/nacl_io/node.cc Node::Node(Filesystem* filesystem) : filesystem_(filesystem) { Node 42 native_client_sdk/src/libraries/nacl_io/node.cc Node::~Node() {} Node 44 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Init(int open_flags) { return 0; } Node 46 native_client_sdk/src/libraries/nacl_io/node.cc void Node::Destroy() { Node 52 native_client_sdk/src/libraries/nacl_io/node.cc EventEmitter* Node::GetEventEmitter() { return NULL; } Node 54 native_client_sdk/src/libraries/nacl_io/node.cc uint32_t Node::GetEventStatus() { Node 61 native_client_sdk/src/libraries/nacl_io/node.cc bool Node::CanOpen(int open_flags) { Node 74 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::FSync() { return 0; } Node 76 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::FTruncate(off_t length) { return EINVAL; } Node 78 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::GetDents(size_t offs, Node 86 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::GetStat(struct stat* pstat) { Node 92 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Ioctl(int request, ...) { Node 100 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::VIoctl(int request, va_list args) { return EINVAL; } Node 102 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Read(const HandleAttr& attr, Node 110 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Write(const HandleAttr& attr, Node 118 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::MMap(void* addr, Node 156 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Tcflush(int queue_selector) { return EINVAL; } Node 158 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Tcgetattr(struct termios* termios_p) { return EINVAL; } Node 160 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Tcsetattr(int optional_actions, const struct termios* termios_p) { Node 164 native_client_sdk/src/libraries/nacl_io/node.cc int Node::GetLinks() { return stat_.st_nlink; } Node 166 native_client_sdk/src/libraries/nacl_io/node.cc int Node::GetMode() { return stat_.st_mode & ~S_IFMT; } Node 168 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::GetSize(size_t* out_size) { Node 173 native_client_sdk/src/libraries/nacl_io/node.cc int Node::GetType() { return stat_.st_mode & S_IFMT; } Node 175 native_client_sdk/src/libraries/nacl_io/node.cc void Node::SetType(int type) { Node 181 native_client_sdk/src/libraries/nacl_io/node.cc bool Node::IsaDir() { return (stat_.st_mode & S_IFDIR) != 0; } Node 183 native_client_sdk/src/libraries/nacl_io/node.cc bool Node::IsaFile() { return (stat_.st_mode & S_IFREG) != 0; } Node 185 native_client_sdk/src/libraries/nacl_io/node.cc bool Node::IsaSock() { return (stat_.st_mode & S_IFSOCK) != 0; } Node 187 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::Isatty() { Node 191 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::AddChild(const std::string& name, const ScopedNode& node) { Node 195 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::RemoveChild(const std::string& name) { return ENOTDIR; } Node 197 native_client_sdk/src/libraries/nacl_io/node.cc Error Node::FindChild(const std::string& name, ScopedNode* out_node) { Node 202 native_client_sdk/src/libraries/nacl_io/node.cc int Node::ChildCount() { return 0; } Node 204 native_client_sdk/src/libraries/nacl_io/node.cc void Node::Link() { stat_.st_nlink++; } Node 206 native_client_sdk/src/libraries/nacl_io/node.cc void Node::Unlink() { stat_.st_nlink--; } Node 28 native_client_sdk/src/libraries/nacl_io/node.h class Node; Node 31 native_client_sdk/src/libraries/nacl_io/node.h typedef sdk_util::ScopedRef<Node> ScopedNode; Node 35 native_client_sdk/src/libraries/nacl_io/node.h class Node : public sdk_util::RefObject { Node 37 native_client_sdk/src/libraries/nacl_io/node.h explicit Node(Filesystem* filesystem); Node 38 native_client_sdk/src/libraries/nacl_io/node.h virtual ~Node(); Node 14 native_client_sdk/src/libraries/nacl_io/passthroughfs/passthrough_fs.cc class PassthroughFsNode : public Node { Node 17 native_client_sdk/src/libraries/nacl_io/passthroughfs/passthrough_fs.cc : Node(filesystem), real_fd_(real_fd) {} Node 19 native_client_sdk/src/libraries/nacl_io/socket/tcp_event_emitter.h class Node; Node 19 native_client_sdk/src/libraries/nacl_io/stream/stream_node.cc : Node(fs), read_timeout_(-1), write_timeout_(-1), stream_state_flags_(0) {} Node 22 native_client_sdk/src/libraries/nacl_io/stream/stream_node.cc Node::Init(open_flags); Node 37 native_client_sdk/src/libraries/nacl_io/stream/stream_node.h class StreamNode : public Node { Node 13 native_client_sdk/src/tests/nacl_io_test/dev_fs_for_testing.h #define NULL_NODE ((Node*)NULL) Node 267 native_client_sdk/src/tests/nacl_io_test/http_fs_test.cc ASSERT_NE((Node*)NULL, root.get()); Node 272 native_client_sdk/src/tests/nacl_io_test/http_fs_test.cc ASSERT_NE((Node*)NULL, dir.get()); Node 275 native_client_sdk/src/tests/nacl_io_test/http_fs_test.cc Node* node = (*fs.GetNodeCacheForTesting())["/mydir/foo"].get(); Node 276 native_client_sdk/src/tests/nacl_io_test/http_fs_test.cc EXPECT_NE((Node*)NULL, node); Node 24 native_client_sdk/src/tests/nacl_io_test/kernel_object_test.cc class NodeForTesting : public Node { Node 26 native_client_sdk/src/tests/nacl_io_test/kernel_object_test.cc explicit NodeForTesting(Filesystem* fs) : Node(fs) {} Node 592 native_client_sdk/src/tests/nacl_io_test/kernel_proxy_test.cc class KernelProxyMMapTest_Node : public Node { Node 595 native_client_sdk/src/tests/nacl_io_test/kernel_proxy_test.cc : Node(filesystem), node_mmap_count_(0) { Node 24 native_client_sdk/src/tests/nacl_io_test/mem_fs_node_test.cc #define NULL_NODE ((Node*)NULL) Node 7 native_client_sdk/src/tests/nacl_io_test/mock_node.cc MockNode::MockNode(nacl_io::Filesystem* mount) : Node(mount) {} Node 13 native_client_sdk/src/tests/nacl_io_test/mock_node.h class MockNode : public nacl_io::Node { Node 115 net/spdy/spdy_priority_forest.h Node() : type(ROOT_NODE), flags(0), child() { Node 127 net/spdy/spdy_priority_forest.h typedef base::hash_map<NodeId, Node> NodeMap; Node 144 net/spdy/spdy_priority_forest.h const Node* FindNode(NodeId node_id) const; Node 173 net/spdy/spdy_priority_forest.h Node* new_node = &all_nodes_[node_id]; Node 186 net/spdy/spdy_priority_forest.h Node* parent = &all_nodes_[parent_id]; Node 191 net/spdy/spdy_priority_forest.h Node* new_node = &all_nodes_[node_id]; Node 203 net/spdy/spdy_priority_forest.h const Node& node = all_nodes_[node_id]; Node 209 net/spdy/spdy_priority_forest.h Node* parent = &all_nodes_[node.depends_on.parent_id]; Node 217 net/spdy/spdy_priority_forest.h Node* child = &all_nodes_[node.child]; Node 241 net/spdy/spdy_priority_forest.h const Node* node = FindNode(node_id); Node 251 net/spdy/spdy_priority_forest.h const Node* node = FindNode(node_id); Node 262 net/spdy/spdy_priority_forest.h const Node* node = FindNode(node_id); Node 268 net/spdy/spdy_priority_forest.h const Node* node = FindNode(node_id); Node 283 net/spdy/spdy_priority_forest.h Node* node = &all_nodes_[node_id]; Node 287 net/spdy/spdy_priority_forest.h Node* parent = &all_nodes_[node->depends_on.parent_id]; Node 303 net/spdy/spdy_priority_forest.h Node* node = &all_nodes_[node_id]; Node 304 net/spdy/spdy_priority_forest.h Node* new_parent = &all_nodes_[parent_id]; Node 318 net/spdy/spdy_priority_forest.h Node* last = node; Node 333 net/spdy/spdy_priority_forest.h Node* old_parent = &all_nodes_[old_parent_id]; Node 392 net/spdy/spdy_priority_forest.h const Node* node = FindNode(node_id); Node 427 net/spdy/spdy_priority_forest.h const Node& root = iter->second; Node 430 net/spdy/spdy_priority_forest.h for (const Node* node = &root; ; node = &all_nodes_[node->child]) { Node 462 net/spdy/spdy_priority_forest.h Node* node = &all_nodes_[node_id]; Node 468 net/spdy/spdy_priority_forest.h for (Node* next = node; next->child != NodeId();) { Node 470 net/spdy/spdy_priority_forest.h Node *child = &all_nodes_[next->child]; Node 487 net/spdy/spdy_priority_forest.h const typename SpdyPriorityForest<NodeId, Priority>::Node* Node 501 net/spdy/spdy_priority_forest.h const Node& node = iter->second; Node 554 third_party/libwebp/enc/quant.c Node nodes[17][NUM_NODES]; Node 607 third_party/libwebp/enc/quant.c Node* const cur = &NODE(n, m); Node 630 third_party/libwebp/enc/quant.c const Node* const prev = &NODE(n - 1, p); Node 688 third_party/libwebp/enc/quant.c const Node* const node = &NODE(n, best_node); Node 423 third_party/tcmalloc/chromium/src/pagemap.h Node* ptrs[INTERIOR_LENGTH]; Node 431 third_party/tcmalloc/chromium/src/pagemap.h Node* root_; // Root of radix tree Node 434 third_party/tcmalloc/chromium/src/pagemap.h Node* NewNode() { Node 435 third_party/tcmalloc/chromium/src/pagemap.h Node* result = reinterpret_cast<Node*>((*allocator_)(sizeof(Node))); Node 480 third_party/tcmalloc/chromium/src/pagemap.h Node* n = NewNode(); Node 490 third_party/tcmalloc/chromium/src/pagemap.h root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf); Node 220 third_party/tcmalloc/vendor/src/pagemap.h Node* ptrs[INTERIOR_LENGTH]; Node 228 third_party/tcmalloc/vendor/src/pagemap.h Node* root_; // Root of radix tree Node 231 third_party/tcmalloc/vendor/src/pagemap.h Node* NewNode() { Node 232 third_party/tcmalloc/vendor/src/pagemap.h Node* result = reinterpret_cast<Node*>((*allocator_)(sizeof(Node))); Node 277 third_party/tcmalloc/vendor/src/pagemap.h Node* n = NewNode(); Node 287 third_party/tcmalloc/vendor/src/pagemap.h root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);