| /development/tools/line_endings/ |
| line_endings.c | 20 typedef struct Node {
21 struct Node *next;
23 } Node;
62 Node* root = malloc(sizeof(Node));
63 Node* node = root; local
64 node->buf[0] = 0;
67 node->next = malloc(sizeof(Node));
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/ |
| RecognitionException.java | 75 /** If this is a tree parser exception, node is set to the node with
78 public Object node; field in class:RecognitionException
91 /** If you are parsing a tree node stream, you will encounter som
125 this.node = nodes.LT(1);
127 Token payload = adaptor.getToken(node);
131 // imaginary node; no line/pos info; scan backwards
147 else { // node created from real token
152 else if ( this.node instanceof Tree) {
153 this.line = ((Tree)this.node).getLine()
[all...] |
| /external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/tree/ |
| TreePatternParser.java | 51 Object node = parseNode(); local
53 return node;
113 TreeWizard.TreePattern node = local
116 node.label = label;
118 return node;
139 // create node
144 Object node; local
145 node = adaptor.create(treeNodeType, text);
146 if ( label!=null && node.getClass()==TreeWizard.TreePattern.class ) {
147 ((TreeWizard.TreePattern)node).label = label
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/functions/ |
| FuncId.java | 50 * @param nodeSet Node set where the nodes will be added to.
80 int node = dtm.getElementById(ref); local
82 if (DTM.NULL != node)
83 nodeSet.addNodeInDocOrder(node, xctxt);
|
| /external/bluetooth/bluedroid/osi/src/ |
| list.c | 18 static list_node_t *list_free_node_(list_t *list, list_node_t *node);
76 assert(node != NULL);
79 list_node_t *node = (list_node_t *)malloc(sizeof(list_node_t)); local
80 if (!node)
83 node->next = prev_node->next;
84 node->data = data;
85 prev_node->next = node;
87 list->tail = node;
100 list_node_t *node = (list_node_t *)malloc(sizeof(list_node_t)); local
101 if (!node)
120 list_node_t *node = (list_node_t *)malloc(sizeof(list_node_t)); local
[all...] |
| /external/chromium_org/chrome/browser/ui/views/bookmarks/ |
| bookmark_menu_delegate_unittest.cc | 59 const BookmarkNode* node = model_->bookmark_bar_node(); local
61 bookmark_menu_delegate_->Init(&test_delegate_, NULL, node, 0,
74 // bookmark bar node
81 // other node
95 // Children of the other node.
112 const BookmarkNode* node = model_->bookmark_bar_node()->GetChild(1); local
114 bookmark_menu_delegate_->Init(&test_delegate, NULL, node, 0,
118 nodes_to_remove.push_back(node->GetChild(1));
|
| /external/chromium_org/components/policy/core/browser/ |
| managed_bookmarks_tracker.cc | 123 const BookmarkNode* node = folder->GetChild(k); local
124 if (node->GetTitle() == title &&
125 ((children && node->is_folder()) ||
126 (!children && node->url() == url))) {
127 existing = node;
133 // Reuse the existing node. The Move() is a nop if |existing| is already
139 // Create a new node for this bookmark now.
|
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/ |
| kernel_object.cc | 19 #include "nacl_io/node.h"
92 // Given a path, acquire the associated filesystem and node, creating the
93 // node if needed based on the provided flags.
137 ScopedNode node; local
139 Error error = AcquireFsAndNode(abs_path, O_RDONLY, &fs, &node);
143 if ((node->GetType() & S_IFDIR) == 0)
|
| /external/chromium_org/native_client_sdk/src/libraries/nacl_io/memfs/ |
| mem_fs.cc | 15 #include "nacl_io/node.h"
43 ScopedNode node = root_; local
46 if (node == NULL)
54 for (size_t index = 1; node && index < path.Size(); index++) {
56 if (!node->IsaDir())
59 // Find the child node
60 Error error = node->FindChild(path.Part(index), &node);
66 if ((type & S_IFDIR) && !node->IsaDir())
70 if ((type & S_IFREG) && node->IsaDir()
79 ScopedNode node; local
97 ScopedNode node; local
[all...] |
| /external/chromium_org/native_client_sdk/src/tests/nacl_io_test/ |
| kernel_object_test.cc | 24 class NodeForTesting : public Node {
26 explicit NodeForTesting(Filesystem* fs) : Node(fs) {}
48 KernelHandleForTesting(const ScopedFilesystem& fs, const ScopedNode& node)
49 : KernelHandle(fs, node) {}
56 node.reset(new NodeForTesting(fs.get()));
61 node.reset(NULL);
67 ScopedNode node; member in class:__anon12994::KernelObjectTest
73 // The filesystem and node should have 1 ref count at this point
75 EXPECT_EQ(1, node->RefCount());
77 // Pass the filesystem and node into a KernelHandl
[all...] |
| /external/chromium_org/net/tools/flip_server/ |
| create_listener.cc | 103 const char* node = NULL; local
107 node = host.c_str();
124 if ((err = getaddrinfo(node, service, &hints, &results))) {
232 const char* node = NULL; local
237 node = host.c_str();
253 if ((err = getaddrinfo(node, service, &hints, &results))) {
255 LOG(ERROR) << "getaddrinfo for (" << node << ":" << service
265 LOG(ERROR) << "Unable to create socket for (" << node << ":" << service
281 LOG(ERROR) << "Connect was unsuccessful for (" << node << ":" << service
|
| /external/chromium_org/testing/gtest/samples/ |
| sample3-inl.h | 46 // QueueNode is a node in a Queue, which consists of an element of
47 // type E and a pointer to the next node.
53 // Gets the element in this node.
56 // Gets the next node in the queue.
61 // Creates a node with a given element value. The next pointer is
85 // 1. Deletes every node.
86 QueueNode<E>* node = head_; local
87 QueueNode<E>* next = node->next();
89 delete node;
90 node = next
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/dom/ |
| TreeScopeStyleSheetCollection.cpp | 49 void TreeScopeStyleSheetCollection::addStyleSheetCandidateNode(Node* node, bool createdByParser)
51 if (!node->inDocument())
59 m_styleSheetCandidateNodes.parserAdd(node);
61 m_styleSheetCandidateNodes.add(node);
63 if (!isHTMLStyleElement(*node))
66 ContainerNode* scopingNode = toHTMLStyleElement(*node).scopingNode();
71 void TreeScopeStyleSheetCollection::removeStyleSheetCandidateNode(Node* node, ContainerNode* scopingNode)
73 m_styleSheetCandidateNodes.remove(node);
199 Node* node = *it; local
[all...] |
| WeakNodeMap.cpp | 8 #include "core/dom/Node.h"
14 bool addedToMap(Node*, WeakNodeMap*);
15 bool removedFromMap(Node*, WeakNodeMap*);
16 void nodeDestroyed(Node*);
26 typedef HashMap<Node*, OwnPtr<MapList> > NodeToMapList;
30 bool NodeToWeakNodeMaps::addedToMap(Node* node, WeakNodeMap* map)
32 NodeToMapList::AddResult result = m_nodeToMapList.add(node, nullptr);
39 bool NodeToWeakNodeMaps::removedFromMap(Node* node, WeakNodeMap* map
65 Node* node = it->key; local
87 Node* WeakNodeMap::node(int value) function in class:WebCore::WeakNodeMap
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/html/forms/ |
| BaseChooserOnlyDateAndTimeInputType.cpp | 71 Node* node = element().userAgentShadowRoot()->firstChild(); local
72 if (!node || !node->isHTMLElement())
83 toHTMLElement(node)->setInnerText(displayValue, ASSERT_NO_EXCEPTION);
|
| /external/chromium_org/third_party/WebKit/Source/core/html/parser/ |
| HTMLElementStack.h | 61 ContainerNode* node() const { return m_item->node(); } function in class:WebCore::HTMLElementStack::FINAL
95 ASSERT(m_top->node());
96 return m_top->node();
181 // We remember the root node, <head> and <body> as they are pushed. Their
182 // ElementRecords keep them alive. The root node is never popped.
|
| /external/chromium_org/third_party/WebKit/Source/core/page/ |
| TouchDisambiguation.cpp | 50 static IntRect boundingBoxForEventNodes(Node* eventNode)
56 Node* node = eventNode; local
57 while (node) {
58 // Skip the whole sub-tree if the node doesn't propagate events.
59 if (node != eventNode && node->willRespondToMouseClickEvents()) {
60 node = NodeTraversal::nextSkippingChildren(*node, eventNode);
63 result.unite(node->pixelSnappedBoundingBox())
[all...] |
| /external/chromium_org/third_party/WebKit/Source/core/xml/ |
| XPathPath.cpp | 73 Node* node = nodes[j]; local
75 evaluationContext.node = node;
79 newNodes->append(node);
115 // "A / by itself selects the root node of the document containing the context node."
117 // the spec and treat / as the root node of the detached tree.
120 Node* context = evaluationContext.node.get()
163 Node* node = (*matches)[nodeIndex]; local
[all...] |
| XPathPredicate.cpp | 121 // If both objects to be compared are node-sets, then the comparison
122 // will be true if and only if there is a node in the first node-set
123 // and a node in the second node-set such that the result of
136 // If one object to be compared is a node-set and the other is a
138 // a node in the node-set such that the result of performing the
140 // converting the string-value of that node to a number using the
149 // If one object to be compared is a node-set and the other is
265 Node* node = rhsNodes[i]; local
[all...] |
| XPathStep.cpp | 68 // Evaluate predicates as part of node test if possible to avoid building
72 // This optimization can be applied to predicates that are not context node
100 // /descendant-or-self::node()/child::NodeTest to /descendant::NodeTest.
129 void Step::evaluate(Node* context, NodeSet& nodes) const
136 // Check predicates that couldn't be merged into node test.
145 Node* node = nodes[j]; local
147 evaluationContext.node = node;
151 newNodes->append(node);
[all...] |
| XSLTUnicodeSort.cpp | 57 xmlNodePtr node; local
128 // Shell's sort of node-set.
232 node = list->nodeTab[j];
234 list->nodeTab[j + incr] = node;
|
| /external/chromium_org/third_party/WebKit/Source/devtools/scripts/jsdoc-validator/src/org/chromium/devtools/jsdoc/ |
| FileCheckerCallable.java | 33 AstRoot node = parseScript(context); local
36 node.visit(dispatcher);
82 public void doVisit(AstNode node) {
84 visitor.doVisit(node);
89 public void didVisit(AstNode node) {
91 check.didVisit(node);
|
| /external/chromium_org/third_party/WebKit/Source/platform/fonts/ |
| GlyphPageTreeNodeTest.cpp | 69 GlyphPageTreeNode* node = GlyphPageTreeNode::getRootChild(data.get(), kPageNumber); local
71 EXPECT_TRUE(node->page()->glyphAt('a'));
72 EXPECT_FALSE(node->page()->glyphAt('A'));
73 EXPECT_FALSE(node->isSystemFallback());
74 EXPECT_EQ(1u, node->level());
75 EXPECT_EQ(node, node->page()->owner());
109 GlyphPageTreeNode* node = GlyphPageTreeNode::getRootChild(segmentedData.get(), kPageNumber); local
111 EXPECT_EQ(0, node->page()->glyphDataForCharacter('A').fontData);
112 EXPECT_EQ(dataBtoC, node->page()->glyphDataForCharacter('B').fontData)
126 GlyphPageTreeNode* node = GlyphPageTreeNode::getRootChild(data.get(), kPageNumber); local
148 GlyphPageTreeNode* node = GlyphPageTreeNode::getRootChild(segmentedData.get(), kPageNumber); local
[all...] |
| SimpleFontData.cpp | 164 GlyphPageTreeNode* node = GlyphPageTreeNode::getRootChild(this, character >> GlyphPage::sizeBits); local
165 return node->page() ? node->page()->glyphAt(character & 0xFF) : 0;
|
| /external/chromium_org/third_party/icu/source/tools/genrb/ |
| rle.c | 300 int32_t node = 0; local
344 * if we could look ahead, but we can't, so we use 'node' to
347 switch (node) {
349 /* Normal idle node */
351 node = 1;
363 node = 0;
367 node = 2;
384 node = 0;
390 if (node != 0){
|
