/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_fs_cfg.h | 44 void *node; local 46 node = rzalloc_size(ctx, size); 47 assert(node != NULL); 49 return node; 73 void *node; local 75 node = rzalloc_size(ctx, size); 76 assert(node != NULL); 78 return node;
|
/external/openssl/crypto/lhash/ |
H A D | num.pl | 3 #node 10 -> 4 7 next unless /^node/;
|
/external/sfntly/cpp/src/test/ |
H A D | test_xml_utils.h | 27 TiXmlNodeVector* GetNodesWithName(const TiXmlNode* node, 29 const TiXmlAttribute* GetAttribute(const TiXmlNode* node,
|
/external/skia/src/views/ |
H A D | SkBGViewArtist.cpp | 27 void SkBGViewArtist::onInflate(const SkDOM& dom, const SkDOM::Node* node) argument 29 SkPaint_Inflate(&fPaint, dom, node);
|
/external/chromium_org/third_party/WebKit/Source/core/editing/ |
H A D | htmlediting.cpp | 66 // Atomic means that the node has no children, or has children which are ignored for the 68 bool isAtomicNode(const Node *node) argument 70 return node && (!node->hasChildren() || editingIgnoresContent(node)); 129 ContainerNode* node = highestRoot->parentNode(); 130 while (node) { 131 if (node->hasEditableStyle(editableType)) 132 highestRoot = node; 133 if (isHTMLBodyElement(*node)) 141 lowestEditableAncestor(Node* node) argument 156 Node* node = p.parentAnchoredEquivalent().anchorNode(); local 172 Node* node = pos.deprecatedNode(); local 179 Node* node = p.deprecatedNode(); local 191 Node* node = p.containerNode(); local 317 isBlock(const Node* node) argument 322 isInline(const Node* node) argument 331 enclosingBlock(Node* node, EditingBoundaryCrossingRule rule) argument 337 enclosingBlockFlowElement(Node& node) argument 367 lastOffsetForEditing(const Node* node) argument 415 isTableStructureNode(const Node *node) argument 531 visiblePositionBeforeNode(Node& node) argument 541 visiblePositionAfterNode(Node& node) argument 629 hasARenderedDescendant(Node* node, Node* excludedNode) argument 643 highestNodeToRemoveInPruning(Node* node, Node* excludeNode) argument 674 enclosingList(Node* node) argument 691 enclosingListChild(Node *node) argument 727 outermostEnclosingList(Node* node, HTMLElement* rootList) argument 754 isRenderedHTMLTableElement(const Node* node) argument 759 isRenderedTableElement(const Node* node) argument 768 isTableCell(const Node* node) argument 775 isEmptyTableCell(const Node* node) argument 851 isTabHTMLSpanElement(const Node* node) argument 859 isTabHTMLSpanElementTextNode(const Node* node) argument 864 tabSpanElement(const Node* node) argument 902 isNodeRendered(const Node *node) argument 991 updatePositionForNodeRemoval(Position& position, Node& node) argument 1021 isMailHTMLBlockquoteElement(const Node* node) argument 1146 isNodeVisiblyContainedWithin(Node& node, const Range& selectedRange) argument 1163 isRenderedAsNonInlineTableImageOrHR(const Node* node) argument 1184 isNonTableCellHTMLBlockElement(const Node* node) argument 1203 isBlockFlowElement(const Node& node) argument [all...] |
H A D | SimplifyMarkupCommand.cpp | 51 for (Node* node = m_firstNode.get(); node && node != m_nodeAfterLast; node = NodeTraversal::next(*node)) { 52 if (node->hasChildren() || (node->isTextNode() && node->nextSibling())) 55 ContainerNode* startingNode = node->parentNode(); 84 for (ContainerNode* node [all...] |
/external/chromium_org/third_party/WebKit/Source/core/dom/shadow/ |
H A D | InsertionPoint.h | 67 Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); } 68 Node* previousTo(const Node* node) const { return m_distribution.previousTo(node); } 91 inline bool isActiveInsertionPoint(const Node& node) argument 93 return node.isInsertionPoint() && toInsertionPoint(node).isActive(); 96 inline bool isActiveShadowInsertionPoint(const Node& node) argument 98 return node.isInsertionPoint() && toInsertionPoint(node) 101 shadowWhereNodeCanBeDistributed(const Node& node) argument [all...] |
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/heap_snapshot_worker/ |
H A D | AllocationProfile.js | 158 var node = this._ensureBottomUpNode(nodeId); 160 while (node.callers().length === 1) { 161 node = node.callers()[0]; 162 nodesWithSingleCaller.push(this._serializeCaller(node)); 166 var callers = node.callers(); 179 var node = this._idToTopDownNode[traceNodeId]; 181 while (node) { 182 var functionInfo = node.functionInfo; 190 node [all...] |
/external/chromium_org/components/bookmarks/test/ |
H A D | test_bookmark_client.h | 33 // Returns true if |node| is one of the |extra_nodes_|. 34 bool IsExtraNodeRoot(const BookmarkNode* node); 36 // Returns true if |node| belongs to the tree of one of the |extra_nodes_|. 37 bool IsAnExtraNode(const BookmarkNode* node); 42 const BookmarkPermanentNode* node) OVERRIDE; 47 virtual bool CanSyncNode(const BookmarkNode* node) OVERRIDE; 48 virtual bool CanBeEditedByUser(const BookmarkNode* node) OVERRIDE;
|
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | FlagStd140Structs.cpp | 47 bool FlagStd140Structs::isInStd140InterfaceBlock(TIntermTyped *node) const 49 TIntermBinary *binaryNode = node->getAsBinaryNode(); 56 const TType &type = node->getType(); 68 std::vector<TIntermTyped *> FlagStd140ValueStructs(TIntermNode *node) argument 72 node->traverse(&flaggingTraversal);
|
/external/chromium_org/third_party/freetype/include/freetype/ |
H A D | ftlist.h | 84 /* Find the list node for a given listed object. */ 91 /* List node. NULL if it wasn't found. */ 108 /* node :: The node to append. */ 112 FT_ListNode node ); 125 /* node :: The node to insert. */ 129 FT_ListNode node ); 138 /* Remove a node from a list. This function doesn't check whether */ 139 /* the node i [all...] |
/external/chromium_org/third_party/libwebp/utils/ |
H A D | huffman.h | 25 // A node of a Huffman tree. 52 // Returns true if the given node is not a leaf of the Huffman tree. 54 const HuffmanTreeNode* const node) { 55 return node->children_; 60 const HuffmanTreeNode* node, int right_child) { 61 return node + node->children_ + right_child; 53 HuffmanTreeNodeIsNotLeaf( const HuffmanTreeNode* const node) argument 59 HuffmanTreeNextNode( const HuffmanTreeNode* node, int right_child) argument
|
/external/chromium_org/ui/accessibility/ |
H A D | ax_tree_source.h | 17 // it's a strict tree, it has a unique id for each node, and all 18 // of the accessibility information about a node can be serialized 30 // Get a node by its id. If no node by that id exists in the tree, return a 31 // null node, i.e. one that will return false if you call IsValid on it. 34 // Return the id of a node. All ids must be positive integers. 35 virtual int32 GetId(AXNodeSource node) const = 0; 37 // Append all children of |node| to |out_children|. 38 virtual void GetChildren(AXNodeSource node, 41 // Get the parent of |node| [all...] |
/external/chromium_org/v8/test/cctest/ |
H A D | test-ast.cc | 45 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); local 46 list->Add(node); 48 CHECK_EQ(node, list->at(0)); 49 CHECK_EQ(node, list->last()); 53 list->Add(node);
|
/external/freetype/include/ |
H A D | ftlist.h | 84 /* Find the list node for a given listed object. */ 91 /* List node. NULL if it wasn't found. */ 108 /* node :: The node to append. */ 112 FT_ListNode node ); 125 /* node :: The node to insert. */ 129 FT_ListNode node ); 138 /* Remove a node from a list. This function doesn't check whether */ 139 /* the node i [all...] |
/external/pdfium/core/include/thirdparties/freetype/freetype/ |
H A D | ftlist.h | 84 /* Find the list node for a given listed object. */ 91 /* List node. NULL if it wasn't found. */ 108 /* node :: The node to append. */ 112 FT_ListNode node ); 125 /* node :: The node to insert. */ 129 FT_ListNode node ); 138 /* Remove a node from a list. This function doesn't check whether */ 139 /* the node i [all...] |
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/include/freetype/ |
H A D | ftlist.h | 84 /* Find the list node for a given listed object. */ 91 /* List node. NULL if it wasn't found. */ 108 /* node :: The node to append. */ 112 FT_ListNode node ); 125 /* node :: The node to insert. */ 129 FT_ListNode node ); 138 /* Remove a node from a list. This function doesn't check whether */ 139 /* the node i [all...] |
/external/webp/src/utils/ |
H A D | huffman.h | 25 // A node of a Huffman tree. 52 // Returns true if the given node is not a leaf of the Huffman tree. 54 const HuffmanTreeNode* const node) { 55 return node->children_; 60 const HuffmanTreeNode* node, int right_child) { 61 return node + node->children_ + right_child; 53 HuffmanTreeNodeIsNotLeaf( const HuffmanTreeNode* const node) argument 59 HuffmanTreeNextNode( const HuffmanTreeNode* node, int right_child) argument
|
/external/chromium_org/tools/deep_memory_profiler/visualizer/static/third_party/jqTree/ |
H A D | tree.jquery.js | 378 var child, node, _i, _len; 381 node = new _this.tree.node_class(''); 382 node.initFromData(child); 383 _this.addChild(node); 411 var node, o, _i, _len; 415 node = new this.tree.node_class(o); 416 this.addChild(node); 418 node.loadFromData(o.children); 433 Node.prototype.addChild = function(node) { 434 this.children.push(node); [all...] |
/external/jemalloc/src/ |
H A D | huge.c | 27 extent_node_t *node; local 38 /* Allocate an extent node with which to track the chunk. */ 39 node = base_node_alloc(); 40 if (node == NULL) 51 base_node_dalloc(node); 55 /* Insert node into huge. */ 56 node->addr = ret; 57 node->size = csize; 58 node->arena = arena; 61 extent_tree_ad_insert(&huge, node); 162 extent_node_t *node, key; local 184 extent_node_t *node, key; local 204 extent_node_t *node, key; local 223 extent_node_t *node, key; local [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
H A D | SAX2DTM2.java | 69 * Iterator that returns all immediate children of a given node 80 * or set current node to END, to indicate request-not-honored? 82 * @param node Sets the root of the iteration. 86 public DTMAxisIterator setStartNode(int node) argument 89 if (node == DTMDefaultBase.ROOTNODE) 90 node = getDocument(); 93 _startNode = node; 94 _currentNode = (node == DTM.NULL) ? DTM.NULL 95 : _firstch2(makeNodeIdentity(node)); 104 * Get the next node i 140 setStartNode(int node) argument 243 setStartNode(int node) argument 416 setStartNode(int node) argument 512 setStartNode(int node) argument 577 setStartNode(int node) argument 638 setStartNode(int node) argument 859 setStartNode(int node) argument 1063 setStartNode(int node) argument 1287 setStartNode(int node) argument 1414 setStartNode(int node) argument 1522 setStartNode(int node) argument [all...] |
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/ |
H A D | description_util.js | 39 * navigated to the node. 92 * tree to the lowest, i.e. ending with the current leaf node. 120 var node = ancestorsArray[i]; 122 hint = cvox.DomUtil.getHint(node); 125 var role = node.getAttribute ? node.getAttribute('role') : null; 130 var roleText = cvox.DomUtil.getRole(node, verbosity); 134 personality = cvox.AuralStyleUtil.getStyleForNode(node); 137 if (i < len - 1 && node.hasAttribute('role')) { 138 var name = cvox.DomUtil.getName(node, fals [all...] |
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 102 static void cso_free_node(struct cso_node *node) argument 104 FREE(node); 112 struct cso_node *node = cso_data_allocate_node(hash->data.d); local 114 if (!node) 117 node->key = akey; 118 node->value = avalue; 120 node->next = (struct cso_node*)(*anextNode); 121 *anextNode = node; 123 return node; 205 struct cso_node **node; local 225 struct cso_node *node = cso_hash_create_node(hash, key, data, nextNode); local 301 cso_hash_data_next(struct cso_node *node) argument 332 cso_hash_data_prev(struct cso_node *node) argument 385 struct cso_node **node = cso_hash_find_node(hash, akey); local 419 struct cso_node *node = iter.node; local 437 struct cso_node **node = cso_hash_find_node(hash, key); local [all...] |
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkTLList.h | 55 Node* node = iter.init(fList, Iter::kHead_IterStart); local 56 while (node) { 57 SkTCast<T*>(node->fObj)->~T(); 58 Block* block = node->fBlock; 59 node = iter.next(); 71 Node* node = this->createNode(); local 72 fList.addToHead(node); 73 SkNEW_PLACEMENT_ARGS(node->fObj, T, (t)); 75 return reinterpret_cast<T*>(node->fObj); 80 Node* node local 89 Node* node = this->createNode(); local 98 Node* node = this->createNode(); local 128 Node* node = fList.head(); local 137 Node* node = fList.head(); local 146 Node* node = reinterpret_cast<Node*>(t); local 221 nodeToObj(Node* node) argument 245 Node* node = fFreeList.head(); local 265 removeNode(Node* node) argument 346 Node* node = this->createNode(); local 354 Node* node = this->createNode(); local [all...] |
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 102 static void cso_free_node(struct cso_node *node) argument 104 FREE(node); 112 struct cso_node *node = cso_data_allocate_node(hash->data.d); local 114 if (!node) 117 node->key = akey; 118 node->value = avalue; 120 node->next = (struct cso_node*)(*anextNode); 121 *anextNode = node; 123 return node; 205 struct cso_node **node; local 225 struct cso_node *node = cso_hash_create_node(hash, key, data, nextNode); local 301 cso_hash_data_next(struct cso_node *node) argument 332 cso_hash_data_prev(struct cso_node *node) argument 385 struct cso_node **node = cso_hash_find_node(hash, akey); local 419 struct cso_node *node = iter.node; local 437 struct cso_node **node = cso_hash_find_node(hash, key); local [all...] |