/external/skia/src/core/ |
H A D | SkPictureStateTree.h | 27 struct Node; 37 Node* fNode; 90 Iterator(const SkTDArray<void*>& draws, SkCanvas* canvas, Node* root); 101 Node* fCurrentNode; 104 SkTDArray<Node*> fNodes; 133 Node* fLastRestoredNode; 142 struct Node { struct in class:SkPictureStateTree 143 Node* fParent; 154 Node fRoot;
|
H A D | SkRTree.h | 101 struct Node; 108 Node* subtree; 117 struct Node { struct in class:SkRTree 160 Branch* insert(Node* root, Branch* branch, uint16_t level = 0); 162 int chooseSubtree(Node* root, Branch* branch); 163 SkIRect computeBounds(Node* n); 165 void search(Node* root, const SkIRect query, SkTDArray<void*>* results) const; 181 int validateSubtree(Node* root, SkIRect bounds, bool isRoot = false); 196 Node* allocateNode(uint16_t level);
|
/external/zopfli/src/zopfli/ |
H A D | katajainen.c | 30 typedef struct Node Node; typedef in typeref:struct:Node 35 struct Node { struct 37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */ 46 Node* nodes; /* The pool. */ 47 Node* next; /* Pointer to a possibly free node in the pool. */ 54 static void InitNode(size_t weight, int count, Node* tail, Node* node) { 67 static Node* GetFreeNode(Node* (*list [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/chromevox/injected/ |
H A D | externs.js | 5 Node.prototype.role; 0 Node.prototype.role; class
|
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
H A D | node.cc | 28 Node::Node(Filesystem* filesystem) : filesystem_(filesystem) { function in class:nacl_io::Node 42 Node::~Node() { 45 Error Node::Init(int open_flags) { 49 void Node::Destroy() { 55 EventEmitter* Node::GetEventEmitter() { 59 uint32_t Node::GetEventStatus() { 66 bool Node::CanOpen(int open_flags) { 79 Error Node [all...] |
/external/chromium_org/net/spdy/ |
H A D | spdy_priority_tree.h | 54 struct Node { struct in class:net::SpdyPriorityTree 55 Node(); 56 ~Node(); 138 const Node* FindNode(NodeId node_id) const; 151 typedef base::hash_map<NodeId, Node> NodeMap; 153 NodeMap all_nodes_; // maps from node IDs to Node objects 160 Node* root_node = &all_nodes_[kRootNodeId]; 173 SpdyPriorityTree<NodeId>::Node::Node() : function in class:net::SpdyPriorityTree::Node 185 SpdyPriorityTree<NodeId>::Node [all...] |
/external/chromium_org/v8/src/ |
H A D | global-handles.cc | 27 class GlobalHandles::Node { class in class:v8::internal::GlobalHandles 40 static Node* FromLocation(Object** location) { 41 DCHECK(OFFSET_OF(Node, object_) == 0); 42 return reinterpret_cast<Node*>(location); 45 Node() { function in class:v8::internal::GlobalHandles::Node 46 DCHECK(OFFSET_OF(Node, class_id_) == Internals::kNodeClassIdOffset); 47 DCHECK(OFFSET_OF(Node, flags_) == Internals::kNodeFlagsOffset); 60 ~Node() { 74 void Initialize(int index, Node** first_free) { 198 Node* next_fre [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/ |
H A D | PODRedBlackTree.h | 99 class Node; 125 : m_arena(PODFreeListArena<Node>::create()) 136 explicit PODRedBlackTree(PassRefPtr<PODFreeListArena<Node> > arena) 165 m_arena = PODFreeListArena<Node>::create(); 168 void initIfNeeded(PODFreeListArena<Node>* arena) 177 Node* node = m_arena->template allocateObject<T>(data); 185 Node* node = treeSearch(data); 251 // The base Node class which is stored in the tree. Nodes are only 254 class Node { class in class:blink::PODRedBlackTree 255 WTF_MAKE_NONCOPYABLE(Node); 258 explicit Node(const T& data) function in class:blink::PODRedBlackTree::Node [all...] |
/external/chromium_org/ui/gfx/geometry/ |
H A D | r_tree_base.cc | 75 // RTreeBase::Node ------------------------------------------------------------ 77 RTreeBase::Node::Node() : NodeBase(Rect(), NULL), level_(0) { function in class:gfx::RTreeBase::Node 80 RTreeBase::Node::~Node() { 83 scoped_ptr<RTreeBase::Node> RTreeBase::Node::ConstructParent() { 85 scoped_ptr<Node> new_parent(new Node(level_ + 1)); 90 void RTreeBase::Node [all...] |
/external/llvm/include/llvm/Support/ |
H A D | YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 59 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { class in namespace:llvm::yaml 118 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 129 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 139 Node *parseBlockNode(); 163 virtual ~Node() {} 176 class NullNode : public Node { 181 : Node(NK_Nul [all...] |
/external/chromium_org/build/android/gyp/util/ |
H A D | build_utils.py | 273 def Node(dep): function in function:GetSortedTransitiveDependencies 287 unsorted_deps = dict(map(Node, all_deps))
|
/external/chromium_org/cc/resources/ |
H A D | task_graph_runner.h | 43 struct Node { struct in struct:cc::TaskGraph 48 bool operator()(const Node& node) const { return node.task == task_; } 54 typedef std::vector<Node> Vector; 56 Node(Task* task, unsigned priority, size_t dependencies) function in struct:cc::TaskGraph::Node 80 Node::Vector nodes;
|
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
H A D | HeapSnapshotCommon.js | 125 WebInspector.HeapSnapshotCommon.Node = function(id, name, distance, nodeIndex, retainedSize, selfSize, type) 142 * @param {!WebInspector.HeapSnapshotCommon.Node} node
|
/external/chromium_org/third_party/WebKit/Source/web/ |
H A D | WebNode.cpp | 37 #include "core/dom/Node.h" 230 const Node& coreNode = *constUnwrap<Node>(); 246 const Node* coreNode = constUnwrap<Node>(); 250 WebNode::WebNode(const PassRefPtrWillBeRawPtr<Node>& node) 255 WebNode& WebNode::operator=(const PassRefPtrWillBeRawPtr<Node>& node) 261 WebNode::operator PassRefPtrWillBeRawPtr<Node>() const
|
/external/chromium_org/third_party/cython/src/Cython/Compiler/ |
H A D | UtilNodes.py | 9 from Nodes import Node namespace 74 class TempsBlockNode(Node):
|
/external/chromium_org/third_party/icu/source/common/unicode/ |
H A D | stringtriebuilder.h | 93 class Node; 97 Node *makeNode(int32_t start, int32_t limit, int32_t unitIndex, UErrorCode &errorCode); 99 Node *makeBranchSubNode(int32_t start, int32_t limit, int32_t unitIndex, 153 Node *registerNode(Node *newNode, UErrorCode &errorCode); 164 Node *registerFinalValue(int32_t value, UErrorCode &errorCode); 174 * NULL Node pointers can be safely passed into other Nodes because 175 * they call the static Node::hashCode() which checks for a NULL pointer first. 179 * a Node pointer, or before setting a new UErrorCode. 187 class Node class in class:StringTrieBuilder 189 Node(int32_t initialHash) : hash(initialHash), offset(0) {} function in class:StringTrieBuilder::Node [all...] |
/external/chromium_org/third_party/leveldatabase/src/db/ |
H A D | skiplist.h | 19 // (2) The contents of a Node except for the next/prev pointers are 20 // immutable after the Node has been linked into the SkipList. 40 struct Node; 90 Node* node_; 101 Node* const head_; 115 Node* NewNode(const Key& key, int height); 120 bool KeyIsAfterNode(const Key& key, Node* n) const; 127 Node* FindGreaterOrEqual(const Key& key, Node** prev) const; 131 Node* FindLessTha 144 struct SkipList<Key,Comparator>::Node { struct in class:leveldb::SkipList 145 explicit Node(const Key& k) : key(k) { } function in struct:leveldb::SkipList::Node [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
H A D | nv50_ir_graph.cpp | 41 reinterpret_cast<Node *>(it->get())->cut(); 44 void Graph::insert(Node *node) 87 Graph::Node::Node(void *priv) : data(priv), function in class:nv50_ir::Graph::Node 95 void Graph::Node::attach(Node *node, Edge::Type kind) 129 bool Graph::Node::detach(Graph::Node *node) 144 void Graph::Node::cut() 158 Graph::Edge::Edge(Node *or [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | pagemap.h | 422 struct Node { struct in class:TCMalloc_PageMap3 423 Node* ptrs[INTERIOR_LENGTH]; 431 Node* root_; // Root of radix tree 434 Node* NewNode() { 435 Node* result = reinterpret_cast<Node*>((*allocator_)(sizeof(Node))); 480 Node* n = NewNode(); 490 root_->ptrs[i1]->ptrs[i2] = reinterpret_cast<Node*>(leaf);
|
/external/chromium_org/third_party/yasm/source/patched-yasm/tools/python-yasm/pyxelator/ |
H A D | cparse.py | 17 class Node(node_module.Node): class in inherits:node_module.Node 21 if isinstance(x,Node): 29 #if isinstance(x,Node): 47 class BasicType(Node): 50 Node.__init__(self,name) 52 class Qualifier(Node): 56 Node.__init__(self,name) 59 class StorageClass(Node): 63 Node [all...] |
H A D | genpyx.py | 13 So, for example, when we refer to Node we get ir.Node . 64 class Node(object): class in inherits:object 70 Node._unique_id += 1 71 return Node._unique_id 82 if isinstance(x,Node): 142 if isinstance(x,Node): 183 return Node.pyxstr(self,toks,indent, **kw) 197 return Node( *self[:-1] ).pyxstr( toks,indent, **kw ) 334 node.tag.name = "_anon_%s" % Node 381 toks.append( ' '*indent + comment + cdef + Node.pyxstr(self,indent=indent, cprefix=cprefix, **kw).strip() ) # + "(cprefix=%s)"%cprefix) function in function:Declarator.pyxstr [all...] |
/external/chromium_org/tools/clang/blink_gc_plugin/ |
H A D | process-graph.py | 76 return graph.setdefault(name, Node(name)) 91 class Node: class in inherits:
|
/external/chromium_org/tools/grit/grit/node/ |
H A D | base.py | 19 class Node(object): class in inherits:object 83 '''Returns the root Node in the tree this Node belongs to.''' 106 parent: grit.node.base.Node or subclass or None 109 assert not parent or isinstance(parent, Node) 116 assert isinstance(child, Node) 295 if isinstance(mixed_item, Node): 530 return Node.EvaluateExpression( 609 class ContentNode(Node):
|
/external/chromium_org/tools/grit/grit/tool/ |
H A D | android2grd.py | 12 from xml.dom import Node namespace 237 if child.nodeType == Node.COMMENT_NODE: 240 elif child.nodeType == Node.ELEMENT_NODE: 299 if node.nodeType in (Node.TEXT_NODE, Node.CDATA_SECTION_NODE): 303 elif node.nodeType == Node.ELEMENT_NODE: 321 elif node.nodeType != Node.COMMENT_NODE: 326 (is_last_node or nodes[i + 1].nodeType == Node.ELEMENT_NODE)): 385 if childNode.nodeType in (Node.TEXT_NODE, Node [all...] |
/external/chromium_org/v8/src/compiler/ |
H A D | generic-algorithm.h | 34 // Control Pre(Traits::Node* current); 35 // Control Post(Traits::Node* current); 36 // void PreEdge(Traits::Node* from, int index, Traits::Node* to); 37 // void PostEdge(Traits::Node* from, int index, Traits::Node* to); 43 typedef typename Traits::Node Node; typedef 49 Node* current = *root_begin; 64 Node* post_order_nod [all...] |