Searched refs:node (Results 526 - 550 of 3060) sorted by relevance

<<21222324252627282930>>

/external/wpa_supplicant_8/hs20/server/
H A Dspp_server.h24 void debug_dump_node(struct hs20_svc *ctx, const char *title, xml_node_t *node);
26 xml_node_t * hs20_spp_server_process(struct hs20_svc *ctx, xml_node_t *node,
/external/chromium_org/net/spdy/
H A Dspdy_priority_tree.h26 // node can have at most one parent and at most one child (forming a list), but
29 // whole structure can be queried to pick the next node to read/write out of
61 // The total weight of this node's direct descendants.
66 // on calls to PropagateNodeState(node.id).
68 List* child_list; // node ID's of children, if any
71 float priority; // The fraction of resources to dedicate to this node.
85 // Return true if the tree contains a node with the given ID.
88 // Add a new node with the given weight and parent. Non-exclusive nodes
89 // simply get added below the parent node. If exclusive = true, the node
249 const Node& node = all_nodes_[node_id]; local
285 const Node* node = FindNode(node_id); local
294 const Node* node = FindNode(node_id); local
303 const Node* node = FindNode(node_id); local
320 Node* node = &all_nodes_[node_id]; local
385 Node* node = &all_nodes_[node_id]; local
395 Node* node = &all_nodes_[node_id]; local
403 Node* node = &all_nodes_[node_id]; local
506 const Node& node = iter->second; local
[all...]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/
H A DDebugTreeAdaptor.cs48 * The debug listener has to deal with tree node IDs for which it did
49 * not see a createNode event. A single &lt;unknown&gt; node is sufficient even
71 object node = adaptor.Create( payload );
72 dbg.CreateNode( node, payload );
73 return node;
79 object node = adaptor.ErrorNode( input, start, stop, e );
80 if ( node != null )
82 dbg.ErrorNode( node );
84 return node;
140 object node
[all...]
/external/bluetooth/bluedroid/btif/src/
H A Dbtif_profile_queue.c63 ASSERTC(p_node != NULL, "Failed to allocate new list node", 0);
120 connect_node_t node; local
121 memset(&node, 0, sizeof(connect_node_t));
122 memcpy(&node.bda, bda, sizeof(bt_bdaddr_t));
123 node.uuid = uuid;
124 node.connect_cb = connect_cb;
127 (char *)&node, sizeof(connect_node_t), NULL);
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/walkers/
H A Dstructural_line_walker.js40 sel.absStart().node, sel.absStart().index) + desc[0].text;
51 var objNode = this.objWalker_.sync(sel).absStart().node;
52 var node = sel.absStart().node;
53 var prevNode = prevSel.absEnd().node;
56 // labels computed for the node.
59 // but these reflect the initial value of the node only, and are not updated
65 cvox.DomUtil.getPrefixText(sel.absStart().node, sel.absStart().index);
/external/chromium_org/content/renderer/accessibility/
H A Dblink_ax_tree_source.h23 // node ids to the frame routing id for an out-of-process iframe during
30 bool IsInTree(blink::WebAXObject node) const;
35 virtual int32 GetId(blink::WebAXObject node) const OVERRIDE;
37 blink::WebAXObject node,
39 virtual blink::WebAXObject GetParent(blink::WebAXObject node) const
41 virtual void SerializeNode(blink::WebAXObject node,
43 virtual bool IsValid(blink::WebAXObject node) const OVERRIDE;
/external/chromium_org/native_client_sdk/src/libraries/nacl_io/
H A Dfilesystem.cc15 #include "nacl_io/node.h"
54 void Filesystem::OnNodeCreated(Node* node) { argument
55 node->stat_.st_ino = inode_pool_.Acquire();
56 node->stat_.st_dev = dev_;
59 void Filesystem::OnNodeDestroyed(Node* node) { argument
60 if (node->stat_.st_ino)
61 inode_pool_.Release(node->stat_.st_ino);
/external/chromium_org/third_party/libjingle/source/talk/xmpp/
H A Ddiscoitemsquerytask.cc37 const std::string& node)
38 : IqTask(parent, STR_GET, to, MakeRequest(node)) {
41 XmlElement* DiscoItemsQueryTask::MakeRequest(const std::string& node) { argument
43 if (!node.empty()) {
44 element->AddAttr(QN_NODE, node);
75 item->node = element->Attr(QN_NODE);
35 DiscoItemsQueryTask(XmppTaskParentInterface* parent, const Jid& to, const std::string& node) argument
/external/chromium_org/tools/grit/grit/node/
H A Dempty.py10 from grit.node import base
11 from grit.node import include
12 from grit.node import structure
13 from grit.node import message
14 from grit.node import io
15 from grit.node import misc
/external/chromium_org/v8/src/compiler/
H A Dgraph-reducer.h19 // Represents the result of trying to reduce a node in the graph.
32 // A reducer can reduce or simplify a given node based on its operator and
42 // Try to reduce a node if possible.
43 virtual Reduction Reduce(Node* node) = 0;
45 // Helper functions for subclasses to produce reductions for a node.
47 static Reduction Replace(Node* node) { return Reduction(node); } argument
48 static Reduction Changed(Node* node) { return Reduction(node); } argument
55 // Performs an iterative reduction of a node grap
[all...]
/external/chromium_org/v8/test/mjsunit/tools/
H A Dprofile_view.js34 var node = new ProfileView.Node(name, time, time, null);
36 opt_parent.addChild(node);
38 return node;
68 function fillFlatTree(node) {
69 flatTree.push(node.internalFuncName);
70 flatTree.push(node.selfTime);
/external/qemu/util/
H A Dnotify.c26 QLIST_INSERT_HEAD(&list->notifiers, notifier, node);
31 QLIST_REMOVE(notifier, node);
38 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
51 QLIST_INSERT_HEAD(&list->notifiers, notifier, node);
56 QLIST_REMOVE(notifier, node);
64 QLIST_FOREACH_SAFE(notifier, &list->notifiers, node, next) {
/external/valgrind/main/coregrind/
H A Dm_hashtable.c46 VgHashNode* iterNode; // current iterator node
95 VgHashNode * node; local
126 node = table->chains[i];
127 while (node != NULL) {
128 VgHashNode* next = node->next;
129 UWord chain = CHAIN_NO(node->key, table);
130 node->next = chains[chain];
131 chains[chain] = node;
132 node = next;
141 the node t
144 VgHashNode* node = (VgHashNode*)vnode; local
201 VgHashNode* node; local
255 VgHashNode *node, *node_next; local
[all...]
/external/tinyxml/
H A Dtinyxml.cpp157 TiXmlNode* node = firstChild; local
160 while ( node )
162 temp = node;
163 node = node->next;
178 TiXmlNode* node = firstChild; local
181 while ( node )
183 temp = node;
184 node = node
212 TiXmlNode* node = addThis.Clone(); local
324 const TiXmlNode* node; local
336 TiXmlNode* node; local
348 const TiXmlNode* node; local
359 TiXmlNode* node; local
422 const TiXmlNode* node; local
433 TiXmlNode* node; local
444 const TiXmlNode* node; local
455 TiXmlNode* node; local
466 TiXmlAttribute* node = attributeSet.Find( name ); local
476 const TiXmlNode* node; local
490 TiXmlNode* node; local
504 const TiXmlNode* node; local
518 TiXmlNode* node; local
532 const TiXmlNode* node; local
546 TiXmlNode* node; local
560 const TiXmlNode* node; local
574 TiXmlNode* node; local
589 const TiXmlNode* node; local
601 TiXmlNode* node; local
655 TiXmlAttribute* node = attributeSet.First(); local
664 const TiXmlAttribute* node = attributeSet.Find( name ); local
703 const TiXmlAttribute* node = attributeSet.Find( name ); local
713 const TiXmlAttribute* node = attributeSet.Find( name ); local
747 TiXmlAttribute* node = attributeSet.Find( name ); local
787 TiXmlNode* node; local
830 TiXmlNode* node; local
863 TiXmlNode* node = 0; local
1138 const TiXmlNode* node; local
1148 const TiXmlNode* node; local
1545 TiXmlAttribute* node; local
1563 const TiXmlAttribute* node; local
1575 TiXmlAttribute* node; local
[all...]
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dselection_util.js25 * node (the end of the selection) is not on a text node.
35 // Ending with a text node, which is incorrect. Keep extending forward.
52 * node (the end of the selection) is not on a text node.
65 // Ending with a text node, which is incorrect. Keep extending backward.
83 * node (the end of the selection) is either:
84 * - not on a text node
85 * - on a text node that ends with a period or a space
99 // The focus node i
[all...]
/external/chromium_org/ui/accessibility/
H A Dax_tree_serializer.h23 // AXTree. An AXTreeSerializer keeps track of the tree of node ids that its
27 // Every node in the source tree must have an id that's a unique positive
28 // integer, the same node must not appear twice.
32 // You must call SerializeChanges() every time a node in the tree changes,
35 // If a node is added, call SerializeChanges on its parent.
36 // If a node is removed, call SerializeChanges on its parent.
41 // For example, if node 1 has children 2, 3, 4, 5 and then child 2 is
43 // update nodes 1 and 6 (and any children of node 6 recursively). It will
47 // As long as the source tree has unique ids for every node and no loops,
65 // Serialize all changes to |node| an
191 LeastCommonAncestor( AXSourceNode node, ClientTreeNode* client_node) argument
227 LeastCommonAncestor( AXSourceNode node) argument
241 AnyDescendantWasReparented( AXSourceNode node, AXSourceNode* out_lca) argument
288 SerializeChanges( AXSourceNode node, AXTreeUpdate* out_update) argument
333 DeleteClientSubtree(AXSourceNode node) argument
351 SerializeChangedNodes( AXSourceNode node, AXTreeUpdate* out_update) argument
[all...]
/external/qemu/android/
H A Dconfig-file.c38 AConfig *node; local
40 for(node = root->first_child; node; node = node->next) {
41 if(!strcmp(node->name, name)) return node;
45 node = (AConfig*) calloc(sizeof(AConfig), 1);
46 node->name = name;
47 node
121 AConfig *node = _aconfig_find(root, name, 1); local
275 parse_block(cstate *cs, AConfig *node) argument
293 parse_expr(cstate *cs, AConfig *node) argument
431 writer_node(Writer* w, AConfig* node, int margin) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/accessibility/
H A DAXRenderObject.cpp122 return toRenderInline(r->node()->renderer());
127 return toRenderInline(toRenderBlock(r)->inlineElementContinuation()->node()->renderer());
170 : AXNodeObject(renderer->node())
213 setNode(renderer->node());
263 Node* node = m_renderer->node(); local
270 if (node && node->isLink()) {
279 if (isHTMLButtonElement(node))
281 if (isHTMLDetailsElement(node))
787 Node* node = m_renderer->node(); local
1514 Node* AXRenderObject::node() const function in class:blink::AXRenderObject
1870 Node* node = m_renderer->node(); local
2105 Node* node = this->node(); local
2156 Node* node = this->node(); local
[all...]
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DOutputHLSL.cpp1368 void OutputHLSL::visitSymbol(TIntermSymbol *node) argument
1373 if (mFlaggedStructMappedNames.count(node) > 0)
1375 out << mFlaggedStructMappedNames[node];
1379 TString name = node->getSymbol();
1388 TQualifier qualifier = node->getQualifier();
1392 const TType& nodeType = node->getType();
1397 mReferencedInterfaceBlocks[interfaceBlock->name()] = node;
1401 mReferencedUniforms[name] = node;
1408 mReferencedAttributes[name] = node;
1413 mReferencedVaryings[name] = node;
1467 visitRaw(TIntermRaw *node) argument
1472 visitBinary(Visit visit, TIntermBinary *node) argument
1745 visitUnary(Visit visit, TIntermUnary *node) argument
1815 visitAggregate(Visit visit, TIntermAggregate *node) argument
2278 visitSelection(Visit visit, TIntermSelection *node) argument
2339 visitConstantUnion(TIntermConstantUnion *node) argument
2344 visitLoop(Visit visit, TIntermLoop *node) argument
2430 visitBranch(Visit visit, TIntermBranch *node) argument
2486 traverseStatements(TIntermNode *node) argument
2496 isSingleStatement(TIntermNode *node) argument
2525 handleExcessiveLoop(TIntermLoop *node) argument
[all...]
/external/chromium_org/components/enhanced_bookmarks/
H A Denhanced_bookmark_model.h46 // Moves |node| to |new_parent| and inserts it at the given |index|.
47 void Move(const BookmarkNode* node,
51 // Adds a new folder node at the specified position.
63 // Returns the remote id for a bookmark |node|.
64 std::string GetRemoteId(const BookmarkNode* node);
66 // Returns the bookmark node corresponding to the given |remote_id|, or NULL
67 // if there is no node with the id.
70 // Sets the description of a bookmark |node|.
71 void SetDescription(const BookmarkNode* node, const std::string& description);
73 // Returns the description of a bookmark |node|
[all...]
/external/chromium_org/third_party/WebKit/Source/modules/webaudio/
H A DAudioNodeInput.cpp37 inline AudioNodeInput::AudioNodeInput(AudioNode& node) argument
38 : AudioSummingJunction(node.context())
39 , m_node(node)
45 AudioNodeInput* AudioNodeInput::create(AudioNode& node) argument
47 return new AudioNodeInput(node);
79 // since the node may be deleted.
88 // since the node may be deleted.
105 node().disableOutputsIfNecessary();
119 node().enableOutputsIfNecessary();
124 node()
[all...]
/external/chromium_org/third_party/skia/src/views/
H A DSkViewInflate.cpp20 void SkViewInflate::rInflate(const SkDOM& dom, const SkDOM::Node* node, SkView* parent) argument
22 const char* str = dom.findAttr(node, "id");
26 const SkDOM::Node* child = dom.getFirstChild(node);
50 this->inflateView(parent, dom, node);
53 void SkViewInflate::inflateView(SkView* view, const SkDOM& dom, const SkDOM::Node* node) argument
58 view->inflate(dom, node);
61 SkView* SkViewInflate::inflate(const SkDOM& dom, const SkDOM::Node* node, SkView* root) argument
67 root = this->createView(dom, node);
70 printf("createView returned NULL on <%s>\n", dom.getName(node));
74 this->rInflate(dom, node, roo
104 const SkDOM::Node* node = dom.build(xml, len); local
116 createView(const SkDOM& dom, const SkDOM::Node* node) argument
[all...]
/external/chromium_org/v8/tools/
H A Dcodemap.js155 var node = tree.findGreatestLessThan(addr);
156 if (!node) break;
157 var start2 = node.key, end2 = start2 + node.value.size;
168 CodeMap.prototype.isAddressBelongsTo_ = function(addr, node) {
169 return addr >= node.key && addr < (node.key + node.value.size);
177 var node = tree.findGreatestLessThan(addr);
178 return node
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/
H A DADefCommand.java3 package com.google.clearsilver.jsilver.syntax.node;
58 public void setPosition(PPosition node) argument
65 if(node != null)
67 if(node.parent() != null)
69 node.parent().removeChild(node);
72 node.parent(this);
75 this._position_ = node;
123 public void setCommand(PCommand node) argument
130 if(node !
[all...]
/external/skia/src/views/
H A DSkViewInflate.cpp20 void SkViewInflate::rInflate(const SkDOM& dom, const SkDOM::Node* node, SkView* parent) argument
22 const char* str = dom.findAttr(node, "id");
26 const SkDOM::Node* child = dom.getFirstChild(node);
50 this->inflateView(parent, dom, node);
53 void SkViewInflate::inflateView(SkView* view, const SkDOM& dom, const SkDOM::Node* node) argument
58 view->inflate(dom, node);
61 SkView* SkViewInflate::inflate(const SkDOM& dom, const SkDOM::Node* node, SkView* root) argument
67 root = this->createView(dom, node);
70 printf("createView returned NULL on <%s>\n", dom.getName(node));
74 this->rInflate(dom, node, roo
104 const SkDOM::Node* node = dom.build(xml, len); local
116 createView(const SkDOM& dom, const SkDOM::Node* node) argument
[all...]

Completed in 754 milliseconds

<<21222324252627282930>>