Searched refs:node (Results 226 - 250 of 2839) sorted by relevance

1234567891011>>

/external/jemalloc/src/
H A Dchunk.c14 * Trees of chunks that were previously allocated (trees differ only in node
48 extent_node_t *node; local
70 node = extent_tree_szad_nsearch(chunks_szad, &key);
71 if (node == NULL) {
75 leadsize = ALIGNMENT_CEILING((uintptr_t)node->addr, alignment) -
76 (uintptr_t)node->addr;
77 assert(node->size >= leadsize + size);
78 trailsize = node->size - leadsize - size;
79 ret = (void *)((uintptr_t)node->addr + leadsize);
80 zeroed = node
262 extent_node_t *xnode, *node, *prev, *xprev, key; local
[all...]
/external/chromium_org/chrome/browser/ui/bookmarks/
H A Dbookmark_editor.cc17 const BookmarkNode* node; local
28 node = model->AddURL(parent, insert_index, new_title, new_url);
30 node = model->AddFolder(parent, insert_index, new_title);
32 model->AddURL(node, node->child_count(), details.urls[i].second,
41 return node;
90 const BookmarkNode* node) {
92 details.existing_node = node;
93 if (node)
94 details.parent_node = node
89 EditNode( const BookmarkNode* node) argument
134 const BookmarkNode* node = details.existing_node; local
156 const BookmarkNode* node = details.existing_node; local
[all...]
/external/chromium_org/native_client_sdk/src/libraries/third_party/pthreads-win32/
H A Dptw32_reuse.c79 ptw32_mcs_local_node_t node; local
81 ptw32_mcs_lock_acquire(&ptw32_thread_reuse_lock, &node);
101 ptw32_mcs_lock_release(&node);
118 ptw32_mcs_local_node_t node; local
120 ptw32_mcs_lock_acquire(&ptw32_thread_reuse_lock, &node);
150 ptw32_mcs_lock_release(&node);
H A Dpthread_kill.c80 ptw32_mcs_local_node_t node; local
82 ptw32_mcs_lock_acquire(&ptw32_thread_reuse_lock, &node);
93 ptw32_mcs_lock_release(&node);
H A Dptw32_processTerminate.c68 ptw32_mcs_local_node_t node; local
90 ptw32_mcs_lock_acquire(&ptw32_thread_reuse_lock, &node);
100 ptw32_mcs_lock_release(&node);
H A Dpthread_barrier_destroy.c45 ptw32_mcs_local_node_t node; local
52 if (0 != ptw32_mcs_lock_try_acquire(&(*barrier)->lock, &node))
78 ptw32_mcs_lock_release(&node);
101 ptw32_mcs_lock_release(&node);
H A Dpthread_barrier_wait.c47 ptw32_mcs_local_node_t node; local
54 ptw32_mcs_lock_acquire(&(*barrier)->lock, &node);
61 * Move our MCS local node to the global scope barrier handle so that the
64 ptw32_mcs_node_transfer(&b->proxynode, &node);
77 ptw32_mcs_lock_release(&node);
H A Dpthread_once.c52 ptw32_mcs_local_node_t node; local
54 ptw32_mcs_lock_acquire((ptw32_mcs_lock_t *)&once_control->lock, &node);
63 pthread_cleanup_push(ptw32_mcs_lock_release, &node);
74 ptw32_mcs_lock_release(&node);
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DRenderTreeBuilder.h43 RenderTreeBuilder(Node* node, RenderStyle* style) argument
44 : m_node(node)
48 ASSERT(!node->renderer());
49 ASSERT(node->needsAttach());
50 ASSERT(node->document().inStyleRecalc());
52 // FIXME: We should be able to ASSERT(node->inActiveDocument()) but childrenChanged is called
58 m_renderingParent = NodeRenderingTraversal::parent(node, &m_parentDetails);
H A DNodeWithIndex.h33 // For use when you want to get the index for a node repeatedly and
37 explicit NodeWithIndex(Node& node) argument
38 : m_node(node)
43 Node& node() const { return m_node; } function in class:WebCore::NodeWithIndex
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/
H A DAudioNodeInput.cpp39 AudioNodeInput::AudioNodeInput(AudioNode* node) argument
40 : AudioSummingJunction(node->context())
41 , m_node(node)
51 ASSERT(output && node());
52 if (!output || !node())
64 node()->ref(AudioNode::RefTypeConnection);
71 ASSERT(output && node());
72 if (!output || !node())
80 node()->deref(AudioNode::RefTypeConnection); // Note: it's important to return immediately after all deref() calls since the node ma
[all...]
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DInitializeVariables.h35 virtual bool visitBinary(Visit visit, TIntermBinary* node) { return false; } argument
36 virtual bool visitUnary(Visit visit, TIntermUnary* node) { return false; } argument
37 virtual bool visitSelection(Visit visit, TIntermSelection* node) { return false; } argument
38 virtual bool visitLoop(Visit visit, TIntermLoop* node) { return false; } argument
39 virtual bool visitBranch(Visit visit, TIntermBranch* node) { return false; } argument
41 virtual bool visitAggregate(Visit visit, TIntermAggregate* node);
H A DForLoopUnroll.h34 virtual bool visitBinary(Visit, TIntermBinary *node);
35 virtual bool visitLoop(Visit, TIntermLoop *node);
36 virtual void visitSymbol(TIntermSymbol *node);
H A DUnfoldShortCircuit.h24 void traverse(TIntermNode *node);
26 bool visitSelection(Visit visit, TIntermSelection *node);
27 bool visitLoop(Visit visit, TIntermLoop *node);
/external/chromium_org/tools/idl_parser/
H A Didl_parser_test.py25 def _TestNode(self, node):
26 comments = node.GetListOf('Comment')
30 msg = 'Expecting %s, but found %s.\n' % (value, str(node))
31 self.assertEqual(value, str(node), msg)
34 msg = node.GetLogLine('Expecting\n\t%s\nbut found \n\t%s\n' % (
35 value, str(node)))
36 self.assertEqual(value, node.GetName(), msg)
40 actual = str(node.GetProperty(key))
45 quick = '\n'.join(node.Tree())
46 lineno = node
[all...]
/external/e2fsprogs/lib/uuid/
H A Dunparse.c59 uuid.node[0], uuid.node[1], uuid.node[2],
60 uuid.node[3], uuid.node[4], uuid.node[5]);
/external/chromium_org/v8/tools/
H A Dprofile_view.js52 callTree.traverse(function(node, viewParent) {
53 var totalWeight = node.totalWeight * samplingRate;
54 var selfWeight = node.selfWeight * samplingRate;
62 var viewNode = createViewNode(node.label, totalWeight, selfWeight, head);
78 * @param {ProfileView.Node} head View head node.
87 * Factory method for a profile view node.
96 * @return {ProfileView.Node} Profile view node.
109 * @param {ProfileView.Node} head Head (root) node.
125 this.traverse(function (node) {
126 node
[all...]
/external/fio/lib/
H A Dprio_tree.h67 static inline int prio_tree_root(const struct prio_tree_node *node) argument
69 return node->parent == node;
72 static inline int prio_tree_left_empty(const struct prio_tree_node *node) argument
74 return node->left == node;
77 static inline int prio_tree_right_empty(const struct prio_tree_node *node) argument
79 return node->right == node;
84 struct prio_tree_node *old, struct prio_tree_node *node);
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dtraverse_util.js25 * Gets the text representation of a node. This allows us to substitute
27 * @param {Node} node A DOM node.
28 * @return {string} A text string representation of the node.
30 cvox.TraverseUtil.getNodeText = function(node) {
31 if (node.constructor == Text) {
32 return node.data;
39 * Return true if a node should be treated as a leaf node, because
46 * @param {Node} node
[all...]
/external/chromium_org/third_party/freetype/src/base/
H A Dftdbgmem.c277 FT_MemNode node, next, *pnode; local
281 node = table->buckets[i];
282 while ( node )
284 next = node->link;
285 hash = FT_MEM_VAL( node->address ) % new_size;
288 node->link = pnode[0];
289 pnode[0] = node;
291 node = next;
356 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local
359 while ( node )
429 FT_MemNode *pnode, node; local
454 FT_MemSource node, *pnode; local
509 FT_MemNode *pnode, node; local
609 FT_MemNode *pnode, node; local
741 FT_MemNode node, *pnode; local
[all...]
/external/freetype/src/base/
H A Dftdbgmem.c277 FT_MemNode node, next, *pnode; local
281 node = table->buckets[i];
282 while ( node )
284 next = node->link;
285 hash = FT_MEM_VAL( node->address ) % new_size;
288 node->link = pnode[0];
289 pnode[0] = node;
291 node = next;
356 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local
359 while ( node )
429 FT_MemNode *pnode, node; local
454 FT_MemSource node, *pnode; local
509 FT_MemNode *pnode, node; local
609 FT_MemNode *pnode, node; local
741 FT_MemNode node, *pnode; local
[all...]
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/
H A Dftdbgmem.c277 FT_MemNode node, next, *pnode; local
281 node = table->buckets[i];
282 while ( node )
284 next = node->link;
285 hash = FT_MEM_VAL( node->address ) % new_size;
288 node->link = pnode[0];
289 pnode[0] = node;
291 node = next;
356 FT_MemNode *pnode = table->buckets + i, next, node = *pnode; local
359 while ( node )
429 FT_MemNode *pnode, node; local
454 FT_MemSource node, *pnode; local
509 FT_MemNode *pnode, node; local
609 FT_MemNode *pnode, node; local
741 FT_MemNode node, *pnode; local
[all...]
/external/apache-xml/src/main/java/org/apache/xalan/transformer/
H A DTreeWalker2Result.java65 * @param pos Start node for traversal
78 * End processing of given node
81 * @param node Node we just finished processing
85 protected void endNode(int node) throws org.xml.sax.SAXException argument
87 super.endNode(node);
88 if(DTM.ELEMENT_NODE == m_dtm.getNodeType(node))
95 * Start traversal of the tree at the given node
98 * @param node Starting node for traversal
102 protected void startNode(int node) throw argument
[all...]
/external/chromium-trace/trace-viewer/src/tracing/analysis/
H A Dstub_analysis_table.js21 appendChild: function(node) {
22 this.nodes_.push(node);
/external/chromium_org/content/test/
H A Dcontent_browser_test_utils_internal.h19 // Navigates the frame represented by |node| to |url|, blocking until the
21 void NavigateFrameToURL(FrameTreeNode* node, const GURL& url);

Completed in 771 milliseconds

1234567891011>>