| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| DragController.cpp | 38 #include "core/dom/Node.h"
174 RefPtrWillBeRawPtr<Node> anchorText = document.createTextNode(title);
301 static HTMLInputElement* asFileInput(Node* node)
303 ASSERT(node);
304 for (; node; node = node->shadowHost()) {
305 if (isHTMLInputElement(*node) && toHTMLInputElement(node)->isFileUpload()
630 Node* node = 0; local
743 Node* node = state.m_dragSrc.get(); local
873 Node* node = state.m_dragSrc.get(); local
[all...] |
| FocusController.cpp | 66 static inline bool isShadowInsertionPointFocusScopeOwner(Node& node)
68 return isActiveShadowInsertionPoint(node) && toHTMLShadowElement(node).olderShadowRoot();
71 // FIXME: Some of Node* return values and Node* arguments should be Element*.
79 Node* FocusNavigationScope::rootNode() const
86 Node* root = rootNode();
97 FocusNavigationScope FocusNavigationScope::focusNavigationScopeOf(Node* node)
402 RefPtrWillBeRawPtr<Node> node = findFocusableNodeAcrossFocusScope(type, FocusNavigationScope::focusNavigationScopeOf(currentNode ? currentNode : document), currentNode); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| FastTextAutosizer.cpp | 76 Node* node = renderer->node(); local
77 if (!node)
79 if (node->isDocumentNode())
80 node = toDocument(node)->documentElement();
81 if (!node->isElementNode())
83 node->document().postTask(adoptPtr(new WriteDebugInfoTask(toElement(node), output)))
122 const Node* node = renderer->node(); local
135 const Node* node = renderer ? renderer->node() : 0; local
152 Node* node = renderer->generatingNode(); local
663 Node* node = renderer->generatingNode(); local
[all...] |
| TextAutosizer.cpp | 76 Node* node = renderObject->node(); local
77 if (node && node->isElementNode())
78 toElement(node)->setAttribute("data-autosizing", output, ASSERT_NO_EXCEPTION);
108 Node* parentNode = ancestor->generatingNode();
115 static Node* getGeneratingElementNode(const RenderObject* renderer)
117 Node* node = renderer->generatingNode() local
508 Node* node = renderer->generatingNode(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/ |
| PODRedBlackTree.h | 64 // add additional and summary information to each node to efficiently
66 // the IntervalTree, which extends each node with a summary statistic
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); local
178 insertNode(node);
185 Node* node = treeSearch(data); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| Font.cpp | 417 GlyphPageTreeNode* node = pageNumber ? m_fontFallbackList->m_pages.get(pageNumber) : m_fontFallbackList->m_pageZero; local
418 if (!node) {
419 node = GlyphPageTreeNode::getRootChild(fontDataAt(0), pageNumber);
421 m_fontFallbackList->m_pages.set(pageNumber, node);
423 m_fontFallbackList->m_pageZero = node;
430 page = node->page();
451 if (node->isSystemFallback())
456 node = node->getChild(fontDataAt(node->level()), pageNumber)
549 GlyphPageTreeNode* node = GlyphPageTreeNode::getRootChild(primaryFont(), pageNumber); local
[all...] |
| /external/chromium_org/third_party/freetype/src/base/ |
| ftdbgmem.c | 277 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/chromium_org/third_party/jsoncpp/overrides/src/lib_json/ |
| json_value.cpp | 1846 const Value *node = &root; local
1879 const Value *node = &root; local
1905 Value *node = &root; local
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/i965/ |
| brw_fs.h | 73 void *node; local
75 node = ralloc_size(ctx, size);
76 assert(node != NULL);
78 return node;
133 void *node; local
135 node = rzalloc_size(ctx, size);
136 assert(node != NULL);
138 return node;
|
| brw_vec4.h | 86 void *node; local
88 node = ralloc_size(ctx, size);
89 assert(node != NULL);
91 return node;
124 void *node; local
126 node = ralloc_size(ctx, size);
127 assert(node != NULL);
129 return node;
153 void *node; local
155 node = rzalloc_size(ctx, size)
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/main/ |
| errors.c | 624 struct simple_node *node; local
631 foreach(node, &ClientIDs->Namespaces[s][t].Severity[sev]) {
632 entry = (struct gl_client_severity *)node;
784 struct simple_node *node, *tmp; local
787 foreach_s(node, tmp, &ClientIDs->Namespaces[s][t].Severity[sev]) {
788 entry = (struct gl_client_severity *)node;
|
| /external/chromium_org/third_party/mesa/src/src/mesa/vbo/ |
| vbo_save_api.c | 105 const struct vbo_save_vertex_list *node,
109 const struct _mesa_prim *prim = &node->prim[node->prim_count - 1];
316 struct vbo_save_vertex_list *node; local
321 node = (struct vbo_save_vertex_list *)
322 _mesa_dlist_alloc(ctx, save->opcode_vertex_list, sizeof(*node));
324 if (!node)
329 memcpy(node->attrsz, save->attrsz, sizeof(node->attrsz));
330 memcpy(node->attrtype, save->attrtype, sizeof(node->attrtype))
1575 struct vbo_save_vertex_list *node = (struct vbo_save_vertex_list *) data; local
1594 struct vbo_save_vertex_list *node = (struct vbo_save_vertex_list *) data; local
[all...] |
| /external/chromium_org/third_party/zlib/ |
| trees.c | 431 /* Index within the heap array of least frequent node in the Huffman tree */
454 * Restore the heap property by moving down the tree starting at node k,
455 * exchanging a node with the smallest of its two sons if necessary, stopping
462 int k; /* node to move down */
525 if (n > max_code) continue; /* not a leaf node */
632 int node; /* new node being created */ local
655 node = s->heap[++(s->heap_len)] = (max_code < 2 ? ++max_code : 0);
656 tree[node].Freq = 1;
657 s->depth[node] = 0
[all...] |
| /external/chromium_org/v8/src/ |
| profile-generator.cc | 201 // New node added.
234 void AfterAllChildrenTraversed(ProfileNode* node) {
235 delete node;
256 ProfileNode* node = root_; local
261 node = node->FindOrAddChild(*entry);
264 node->IncrementSelfTicks();
265 return node;
270 ProfileNode* node = root_; local
275 node = node->FindOrAddChild(*entry)
302 ProfileNode* node; member in class:v8::internal::Position
[all...] |
| /external/chromium_org/v8/test/cctest/ |
| cctest.h | 468 v8::internal::FreeListNode* node = local
470 node->set_size(space->heap(), new_linear_size);
|
| /external/doclava/src/com/google/doclava/ |
| SampleCode.java | 69 * a node tree that reflects the project's directory structure. After iterating
75 * @return A root Node for the project containing its metadata and tree structure.
77 public Node setSamplesTOC(boolean offlineMode) {
78 List<Node> filelist = new ArrayList<Node>();
91 Node rootNode = writeSampleIndexCs(hdf, f,
92 new Node.Builder().setLabel(mProjectDir).setLink(link).setChildren(filelist).build(),false);
105 List<Node> filelist = new ArrayList<Node>();
126 //Write root _index.jd to out and add metadata to Node
420 Node node = new Node.Builder().setLabel("Samples").setLink(ClearPage.toroot local
[all...] |
| /external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/org.eclipse.build.tools/src/org/eclipse/releng/generators/ |
| TestVersionTracker.java | 46 import org.w3c.dom.Node;
244 Node node = nodeList.item(i); local
245 NamedNodeMap map = node.getAttributes();
246 Node namedItem = map.getNamedItem("plugin");
309 Node node = nodeList.item(i); local
310 NamedNodeMap map = node.getAttributes();
311 Node namedItem = map.getNamedItem("name");
|
| /external/freetype/src/base/ |
| ftdbgmem.c | 277 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/guava/guava/src/com/google/common/collect/ |
| TreeMultiset.java | 129 this.rootReference = new Reference<Node<E>>();
132 private TreeMultiset(GeneralRange<E> range, Reference<Node<E>> root) {
145 private transient final Reference<Node<E>> rootReference;
167 Node<E> root = rootReference.get();
173 Node<E> root = rootReference.get();
182 Node<E> node = BstOperations.seek(comparator(), rootReference.get(), e); local
183 return countOrZero(node);
194 BstMutationRule<E, Node<E>> mutationRule = BstMutationRule.createRule(
197 <E, Node<E>>singleRebalancePolicy(distinctAggregate())
[all...] |
| /external/jsoncpp/chromium-overrides/src/lib_json/ |
| json_value.cpp | 1840 const Value *node = &root; local
1873 const Value *node = &root; local
1899 Value *node = &root; local
[all...] |
| /external/jsoncpp/src/lib_json/ |
| json_value.cpp | 1836 const Value *node = &root; local
1869 const Value *node = &root; local
1895 Value *node = &root; local
[all...] |
| /external/libpcap/ |
| pcap-dag.c | 191 pcap_dag_node_t *node = NULL; local
193 if ((node = malloc(sizeof(pcap_dag_node_t))) == NULL) {
202 node->next = pcap_dags;
203 node->p = p;
204 node->pid = getpid();
206 pcap_dags = node;
[all...] |
| /external/libselinux/src/ |
| avc.c | 220 struct avc_node *node; local
227 node = avc_cache.slots[i];
228 if (node) {
231 while (node) {
233 node = node->next;
378 struct avc_node *node; local
382 node = avc_search_node(ssid, tsid, tclass, &probes);
384 if (node && ((node->ae.avd.decided & requested) == requested))
420 struct avc_node *node; local
454 struct avc_node *node, *tmp; local
498 struct avc_node *node, *tmp; local
889 struct avc_node *node; local
[all...] |
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 156 unsigned PBQPRAProblem::getVRegForNode(PBQPRAGraph::NodeId node) const {
157 Node2VReg::const_iterator vregItr = node2VReg.find(node);
158 assert(vregItr != node2VReg.end() && "No vreg for node.");
164 assert(nodeItr != vreg2Node.end() && "No node for vreg.");
251 // Construct the node.
355 PBQPRAGraph::NodeId node = p->getNodeForVReg(src); local
356 llvm::dbgs() << "Reading node costs for node " << node << "\n";
357 llvm::dbgs() << "Source node: " << &g.getNodeCosts(node) << "\n"
[all...] |
| /external/ltrace/ |
| read_config_file.c | 678 struct expr_node *node = malloc(sizeof(*node)); local
679 if (node == NULL) {
685 expr_init_argno(node, param_num);
687 param_pack_init_printf(*packp, node, 1);
|
