| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/html5fs/ |
| html5_fs.cc | 34 ScopedNode node; local
35 return Open(path, O_RDONLY, &node);
49 ScopedNode node(new Html5FsNode(this, fileref));
50 error = node->Init(open_flags);
54 *out_node = node;
|
| /external/chromium_org/native_client_sdk/src/tests/nacl_io_test/fake_ppapi/ |
| fake_pepper_interface_html5_fs.h | 68 const FakeHtml5FsNode* node; member in struct:FakeHtml5FsFilesystem::DirectoryEntry
|
| /external/chromium_org/native_client_sdk/src/tests/nacl_io_test/ |
| fuse_fs_test.cc | 218 ScopedNode node; local
219 ASSERT_EQ(0, fs_.Open(Path("/hello"), O_RDONLY, &node));
224 ASSERT_EQ(0, node->Read(attr, &buffer[0], sizeof(buffer), &bytes_read));
231 ScopedNode node; local
232 ASSERT_EQ(0, fs_.Open(Path("/foobar"), O_RDWR | O_CREAT, &node));
237 ASSERT_EQ(0, node->Write(attr, &message[0], strlen(message), &bytes_written));
243 ASSERT_EQ(0, node->Read(attr, &buffer[0], sizeof(buffer), &bytes_read));
251 ScopedNode node; local
253 ASSERT_EQ(0, fs_.Open(Path("/hello"), O_RDONLY, &node));
254 EXPECT_EQ(0, node->GetStat(&statbuf))
296 ScopedNode node; local
[all...] |
| html5_fs_test.cc | 185 ScopedNode node; local
186 ASSERT_EQ(0, fs->Open(path, O_RDONLY, &node));
187 EXPECT_EQ(0, node->GetStat(&stat));
250 ScopedNode node; local
251 ASSERT_EQ(0, fs->Open(path, O_CREAT | O_RDWR, &node));
256 EXPECT_EQ(0, node->Write(HandleAttr(), &contents[0], strlen(contents),
261 ASSERT_EQ(0, fs->Open(path, O_CREAT, &node));
265 EXPECT_EQ(0, node->GetSize(&size));
269 EXPECT_EQ(EEXIST, fs->Open(path, O_CREAT | O_EXCL, &node));
272 EXPECT_EQ(EINVAL, fs->Open(path, O_CREAT | O_TRUNC, &node));
290 ScopedNode node; local
333 ScopedNode node; local
386 ScopedNode node; local
435 ScopedNode node; local
472 ScopedNode node; local
[all...] |
| http_fs_test.cc | 93 ScopedNode node; local
94 ASSERT_EQ(EIO, fs_.Open(Path("/file"), O_RDONLY, &node));
107 ScopedNode node; local
108 ASSERT_EQ(0, fs_.Open(Path("/file"), O_RDONLY, &node));
110 EXPECT_EQ(0, node->Read(attr, buf, sizeof(buf) - 1, &result_bytes));
116 ASSERT_EQ(0, node->Read(attr, buf, sizeof(buf) - 1, &result_bytes));
123 EXPECT_EQ(0, node->Read(attr, &buf[0], sizeof(buf), &result_bytes));
137 ScopedNode node; local
138 ASSERT_EQ(0, fs_.Open(Path("/file"), O_RDONLY, &node));
140 EXPECT_EQ(0, node->Read(attr, buf, sizeof(buf) - 1, &result_bytes))
161 ScopedNode node; local
176 ScopedNode node; local
194 ScopedNode node; local
221 ScopedNode node; local
251 ScopedNode node; local
345 Node* node = (*fs.GetNodeCacheForTesting())["\/mydir\/foo"].get(); local
[all...] |
| mem_fs_node_test.cc | 21 #include "nacl_io/node.h"
24 #define NULL_NODE ((Node*)NULL)
169 MemFsNodeForTesting* node = new MemFsNodeForTesting(); local
171 ScopedNode file(node);
179 ASSERT_EQ(0, node->Init(0));
290 MemFsNodeForTesting* node = new MemFsNodeForTesting(); local
292 ScopedNode file(node);
|
| /external/chromium_org/net/disk_cache/memory/ |
| mem_backend_impl.cc | 104 void MemBackendImpl::UpdateRank(MemEntryImpl* node) {
105 rankings_.UpdateRank(node);
253 MemEntryImpl* node = rankings_.GetNext(NULL); local
254 // Last valid entry before |node|.
255 // Note, that entries after |node| may become invalid during |node| doom in
257 // parent node will go prior to it childs in ranking list (see
264 while (node) {
265 if (node->GetLastUsed() < initial_time)
268 if (node->GetLastUsed() < end_time
292 MemEntryImpl* node = rankings_.GetNext(current); local
314 MemEntryImpl* node = next; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| ElementTraversal.h | 37 // First or last ElementType child of the node.
39 static ElementType* firstChild(const Node& current) { return firstChildTemplate(current); }
41 static ElementType* lastChild(const Node& current) { return lastChildTemplate(current); }
43 // First ElementType ancestor of the node.
44 static ElementType* firstAncestor(const Node& current);
45 static ElementType* firstAncestorOrSelf(Node& current) { return firstAncestorOrSelfTemplate(current); }
48 // First or last ElementType descendant of the node.
51 static ElementType* firstWithin(const Node& current) { return firstWithinTemplate(current); }
53 static ElementType* lastWithin(const Node& current) { return lastWithinTemplate(current); }
57 static ElementType* next(const Node& current) { return nextTemplate(current);
122 Node* node = NodeTraversal::lastWithin(current); local
132 Node* node = NodeTraversal::next(current); local
142 Node* node = NodeTraversal::next(current, stayWithin); local
152 Node* node = NodeTraversal::previous(current); local
162 Node* node = NodeTraversal::previous(current, stayWithin); local
173 Node* node = current.firstChild(); local
201 Node* node = current.lastChild(); local
271 Node* node = NodeTraversal::nextSkippingChildren(current); local
281 Node* node = NodeTraversal::nextSkippingChildren(current, stayWithin); local
290 Node* node = NodeTraversal::previousIncludingPseudo(current, stayWithin); local
299 Node* node = NodeTraversal::nextIncludingPseudo(current, stayWithin); local
308 Node* node = NodeTraversal::nextIncludingPseudoSkippingChildren(current, stayWithin); local
317 Node* node = current.pseudoAwarePreviousSibling(); local
326 Node* node = current.previousSibling(); local
335 Node* node = current.nextSibling(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/editing/ |
| SpellCheckRequester.cpp | 31 #include "core/dom/Node.h"
162 const Node* node = range->startContainer(); local
163 if (node && node->isElementNode() && !toElement(node)->isSpellCheckingEnabled())
|
| /external/chromium_org/third_party/WebKit/Source/core/frame/ |
| EventHandlerRegistry.cpp | 192 Node* node = it->key->toNode(); local
194 if (node && !visitor->isAlive(node)) {
195 deadTargets.append(node);
213 if (Node* node = iter->key->toNode()) {
214 for (Document* doc = &node->document(); doc; doc = doc->ownerElement() ? &doc->ownerElement()->document() : 0) {
239 if (Node* node = iter->key->toNode())
[all...] |
| SmartClip.cpp | 57 static Node* nodeInsideFrame(Node* node)
59 if (node->isFrameOwnerElement())
60 return toHTMLFrameOwnerElement(node)->contentDocument();
83 Node* bestNode = findBestOverlappingNode(m_frame->document(), resizedCropRect);
87 if (Node* nodeFromFrame = nodeInsideFrame(bestNode)) {
89 if (Node* bestNodeInFrame = findBestOverlappingNode(nodeFromFrame, resizedCropRect))
93 WillBeHeapVector<RawPtrWillBeMember<Node> > hitNodes;
119 Node* SmartClip::minNodeContainsNodes(Node* minNode, Node* newNode
148 Node* node = minNode; local
169 Node* node = rootNode; local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLStackItem.h | 49 // Used by document fragment node and context element.
50 static PassRefPtrWillBeRawPtr<HTMLStackItem> create(PassRefPtrWillBeRawPtr<ContainerNode> node, ItemType type)
52 return adoptRefWillBeNoop(new HTMLStackItem(node, type));
56 static PassRefPtrWillBeRawPtr<HTMLStackItem> create(PassRefPtrWillBeRawPtr<ContainerNode> node, AtomicHTMLToken* token, const AtomicString& namespaceURI = HTMLNames::xhtmlNamespaceURI)
58 return adoptRefWillBeNoop(new HTMLStackItem(node, token, namespaceURI));
62 ContainerNode* node() const { return m_node.get(); } function in class:WebCore::HTMLStackItem
213 HTMLStackItem(PassRefPtrWillBeRawPtr<ContainerNode> node, ItemType type)
214 : m_node(node)
228 HTMLStackItem(PassRefPtrWillBeRawPtr<ContainerNode> node, AtomicHTMLToken* token, const AtomicString& namespaceURI = HTMLNames::xhtmlNamespaceURI)
229 : m_node(node)
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/rendering/ |
| CounterNode.cpp | 50 // so we need to handle these cases. The node is still connected to the tree so we need to detach it.
75 // The node's children are reparented to the old parent.
218 CounterNode* node = this; local
220 node->resetRenderers();
221 node = node->nextInPreOrder(this);
222 } while (node);
227 for (CounterNode* node = this; node; node = node->m_nextSibling)
[all...] |
| HitTestResult.cpp | 129 if (Node* node = innerNode()) {
130 node = node->document().ancestorInThisScope(node);
131 setInnerNode(node);
134 if (Node* node = innerNonSharedNode()) {
135 node = node->document().ancestorInThisScope(node)
482 Node* node = innerNode(); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/svg/ |
| SVGGlyphMap.h | 67 RefPtr<GlyphMapNode> node; local
70 node = findOrCreateNode(textIterator);
73 node = findOrCreateNode(textIterator);
75 if (!node)
79 node->glyphs.append(glyph);
80 SVGGlyph& lastGlyph = node->glyphs.last();
132 RefPtr<GlyphMapNode> node;
135 node = findNode(textIterator);
138 node = findNode(textIterator);
141 if (node)
192 RefPtr<GlyphMapNode> node; local
213 RefPtr<GlyphMapNode> node; local
235 RefPtr<GlyphMapNode> node = currentLayer->get(character); local
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathExpressionNode.h | 30 #include "core/dom/Node.h"
43 RefPtrWillBePersistent<Node> node; member in struct:WebCore::XPath::EvaluationContext
|
| XPathNodeSet.cpp | 37 // When a node set is large, sorting it by traversing the whole document is
42 typedef WillBeHeapVector<RawPtrWillBeMember<Node> > NodeSetVector;
53 static inline Node* parentWithDepth(unsigned depth, const NodeSetVector& parents)
72 Node* commonAncestor;
113 Node* n = parentMatrix[i][0];
125 // node-set. Sort it according to this subdivision, and recursively sort
127 WillBeHeapHashSet<RawPtrWillBeMember<Node> > parentNodes;
133 for (Node* n = commonAncestor->firstChild(); n; n = n->nextSibling()) {
134 // If parentNodes contains the node, perform a linear search to move its
135 // children in the node-set to the beginning
220 Node* node = m_nodes[i].get(); local
[all...] |
| XSLStyleSheetLibxslt.cpp | 26 #include "core/dom/Node.h"
56 XSLStyleSheet::XSLStyleSheet(Node* parentNode, const String& originalURL, const KURL& finalURL, bool embedded)
257 Node* node = styleSheet->ownerNode(); local
258 if (node)
259 return &node->document();
|
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/ |
| CanvasReplayStateView.js | 320 * @param {!WebInspector.DataGridNode=} node
322 function populateNameToNodesMap(map, node)
324 if (!node)
326 for (var i = 0, child; child = node.children[i]; ++i) {
328 node: child,
367 var oldChildNode = oldChildrenItem.node;
388 this._highlightedGridNodes[i].element.classList.remove("canvas-grid-node-highlighted");
393 var node = this._highlightedGridNodes[i];
394 WebInspector.runCSSAnimationOnce(node.element, "canvas-grid-node-highlighted")
327 node: child, property
[all...] |
| /external/chromium_org/third_party/WebKit/Source/devtools/front_end/ui/ |
| TextPrompt.js | 632 var node = selectionRange.startContainer; variable
633 if (!node.isSelfOrDescendant(this._element))
636 if (node.nodeType === Node.TEXT_NODE && selectionRange.startOffset < node.nodeValue.length)
640 while (node) {
641 if (node.nodeType === Node.TEXT_NODE && node.nodeValue.length) {
642 if (foundNextText && (!this.autoCompleteElement || !this.autoCompleteElement.isAncestor(node)))
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/TestResultServer/static-dashboards/ |
| treemap.js | 121 // "name": (name of this node),
123 // childCount is added just to be includes in the node's name
133 var node = {
137 children.push(node);
198 allNodes.forEach(function(node) {
199 var average = node.data['$area'] / node.childCount;
200 if (average > 100 && node.childCount != 1) {
202 tr.innerHTML = '<td></td><td>' + node.childCount + '</td><td>' + humanReadableTime(average) + '</td>';
203 tr.querySelector('td').innerText = node.path
[all...] |
| /external/chromium_org/third_party/eyesfree/src/android/java/src/com/googlecode/eyesfree/braille/selfbraille/ |
| WriteData.java | 27 * part of the accessibility node tree.
42 AccessibilityNodeInfo node = AccessibilityNodeInfo.obtain(view); local
44 writeData.mAccessibilityNodeInfo = node;
53 * Sets the text to be displayed when the accessibility node associated
56 * this node.
120 "Accessibility node info can't be null");
169 // The above call recycles the node, so make sure we don't use it
|
| /external/chromium_org/third_party/freetype/src/cache/ |
| ftcbasic.c | 217 /* we must call this function to avoid this node from appearing
285 FTC_Node node = 0; /* make compiler happy */ local
326 node,
332 &node );
336 *aglyph = FTC_INODE( node )->glyph;
340 *anode = node;
341 node->ref_count++;
361 FTC_Node node = 0; /* make compiler happy */ local
394 node,
398 *aglyph = FTC_INODE( node )->glyph
473 FTC_Node node = 0; \/* make compiler happy *\/ local
551 FTC_Node node = 0; \/* make compiler happy *\/ local
[all...] |
| ftccache.c | 42 /***** CACHE NODE DEFINITIONS *****/
47 /* add a new node to the head of the manager's circular MRU list */
49 ftc_node_mru_link( FTC_Node node,
56 (FTC_MruNode)node );
61 /* remove a node from the manager's MRU list */
63 ftc_node_mru_unlink( FTC_Node node,
70 (FTC_MruNode)node );
77 /* move a node to the head of the manager's MRU list */
79 ftc_node_mru_up( FTC_Node node,
83 (FTC_MruNode)node );
117 FTC_Node node, *pnode; local
232 FTC_Node node = *pnode; local
364 FTC_Node *pnode = cache->buckets + i, next, node = *pnode; local
450 FTC_Node node; local
490 FTC_Node node; local
581 FTC_Node node = *pnode; local
603 FTC_Node node; local
[all...] |
| ftccmap.c | 39 /* For now, the implementation is very basic: Each node maps a range of */
48 /* number of glyph indices / character code per node */
51 /* compute a query/node hash */
69 /* the cmap cache node */
72 FTC_NodeRec node; member in struct:FTC_CMapNodeRec_
75 FT_UInt32 first; /* first character in node */
102 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
106 FT_FREE( node );
110 /* initialize a new cmap node */
120 FTC_CMapNode node = NULL local
159 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
185 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
242 FTC_Node node; local
[all...] |
