Searched refs:node (Results 451 - 475 of 3060) sorted by relevance

<<11121314151617181920>>

/external/chromium_org/third_party/libjingle/source/talk/xmpp/
H A Ddiscoitemsquerytask.h35 // node='blah '/>
45 // node='blah'>
63 std::string node; member in struct:buzz::DiscoItem
70 const Jid& to, const std::string& node);
75 static XmlElement* MakeRequest(const std::string& node);
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/
H A DTemplateSyntaxTree.java19 import com.google.clearsilver.jsilver.syntax.node.Start;
20 import com.google.clearsilver.jsilver.syntax.node.Switch;
21 import com.google.clearsilver.jsilver.syntax.node.Switchable;
24 * Simple wrapper class to encapsulate the root node of the AST and allow additional information to
H A DSyntaxTreeDumper.java22 import com.google.clearsilver.jsilver.syntax.node.EOF;
23 import com.google.clearsilver.jsilver.syntax.node.Node;
24 import com.google.clearsilver.jsilver.syntax.node.Start;
25 import com.google.clearsilver.jsilver.syntax.node.Token;
55 public void defaultIn(Node node) { argument
56 write(nodeName(node) + " {");
61 public void defaultOut(Node node) { argument
67 public void defaultCase(Node node) { argument
68 write(nodeName(node));
71 private String nodeName(Node node) { argument
[all...]
/external/smack/src/org/jivesoftware/smackx/packet/
H A DDiscoverItems.java37 * may be addressable by its JID and others may require to be addressed by a JID and a node name.
46 private String node; field in class:DiscoverItems
83 * Returns the node attribute that supplements the 'jid' attribute. A node is merely
89 * @return the node attribute that supplements the 'jid' attribute
92 return node;
96 * Sets the node attribute that supplements the 'jid' attribute. A node is merely
102 * @param node the node attribut
104 setNode(String node) argument
148 private String node; field in class:DiscoverItems.Item
209 setNode(String node) argument
[all...]
/external/chromium_org/net/disk_cache/blockfile/
H A Drankings.cc40 // addr is the cache addres of the node being inserted or removed. We want to
184 // Update the timestamp fields of |node|.
185 void UpdateTimes(disk_cache::CacheRankingsBlock* node, bool modified) { argument
187 node->Data()->last_used = now.ToInternalValue();
189 node->Data()->last_modified = now.ToInternalValue();
202 Rankings* rankings, CacheRankingsBlock* node)
203 : scoped_ptr<CacheRankingsBlock>(node), rankings_(rankings) {}
249 void Rankings::Insert(CacheRankingsBlock* node, bool modified, List list) { argument
250 Trace("Insert 0x%x l %d", node->address().value(), list);
251 DCHECK(node
201 ScopedRankingsBlock( Rankings* rankings, CacheRankingsBlock* node) argument
320 Remove(CacheRankingsBlock* node, List list, bool strict) argument
405 UpdateRank(CacheRankingsBlock* node, bool modified, List list) argument
419 GetNext(CacheRankingsBlock* node, List list) argument
452 GetPrev(CacheRankingsBlock* node, List list) argument
485 FreeRankingsBlock(CacheRankingsBlock* node) argument
489 TrackRankingsBlock(CacheRankingsBlock* node, bool start_tracking) argument
516 SanityCheck(CacheRankingsBlock* node, bool from_list) const argument
548 DataSanityCheck(CacheRankingsBlock* node, bool from_list) const argument
560 SetContents(CacheRankingsBlock* node, CacheAddr address) argument
671 FinishInsert(CacheRankingsBlock* node) argument
689 RevertRemove(CacheRankingsBlock* node) argument
747 CheckLinks(CacheRankingsBlock* node, CacheRankingsBlock* prev, CacheRankingsBlock* next, List* list) argument
887 UpdateIterators(CacheRankingsBlock* node) argument
898 InvalidateIterators(CacheRankingsBlock* node) argument
[all...]
/external/chromium_org/third_party/libxml/src/include/libxml/
H A DdebugXML.h41 xmlNodePtr node,
45 xmlNodePtr node,
49 xmlNodePtr node,
81 xmlLsOneNode (FILE *output, xmlNodePtr node);
83 xmlLsCountNode (xmlNodePtr node);
116 xmlNodePtr node; member in struct:_xmlShellCtxt
127 * @node: a first node
128 * @node2: a second node
136 xmlNodePtr node,
[all...]
/external/chromium_org/third_party/skia/src/views/animated/
H A DSkStaticTextView.cpp12 static void assert_no_attr(const SkDOM& dom, const SkDOM::Node* node, const char attr[]) argument
14 const char* value = dom.findAttr(node, attr);
19 #define assert_no_attr(dom, node, attr)
151 void SkStaticTextView::onInflate(const SkDOM& dom, const SkDOM::Node* node) argument
154 this->INHERITED::onInflate(dom, node);
157 if ((index = dom.findList(node, "mode", "fixed,auto-width,auto-height")) >= 0) {
160 assert_no_attr(dom, node, "mode");
163 if ((index = dom.findList(node, "spacing-align", "start,center,end")) >= 0) {
166 assert_no_attr(dom, node, "spacing-align");
170 if (dom.findScalars(node, "margi
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DBstNodeTest.java37 private void testLacksChild(SimpleNode node, BstSide side) { argument
38 assertNull(node.childOrNull(side));
39 assertFalse(node.hasChild(side));
41 node.getChild(side);
46 private void testChildIs(SimpleNode node, BstSide side, SimpleNode expectedChild) { argument
47 assertEquals(expectedChild, node.childOrNull(side));
48 assertTrue(node.hasChild(side));
49 assertEquals(expectedChild, node.getChild(side));
60 SimpleNode node = new SimpleNode('b', leaf, null);
61 testChildIs(node, LEF
[all...]
/external/libsepol/src/
H A Dassertion.c34 const avtab_ptr_t node)
43 node->datum.data & curperm->data));
50 node->datum.data & curperm->data));
57 node->datum.data & curperm->data));
68 avtab_ptr_t node; local
77 for (node = avtab_search_node(te_avtab, &avkey);
78 node != NULL;
79 node = avtab_search_node_next(node, avkey.specified)) {
80 if (node
30 report_failure(sepol_handle_t *handle, policydb_t *p, const avrule_t * avrule, unsigned int stype, unsigned int ttype, const class_perm_node_t *curperm, const avtab_ptr_t node) argument
[all...]
/external/libxml2/include/libxml/
H A DdebugXML.h41 xmlNodePtr node,
45 xmlNodePtr node,
49 xmlNodePtr node,
81 xmlLsOneNode (FILE *output, xmlNodePtr node);
83 xmlLsCountNode (xmlNodePtr node);
116 xmlNodePtr node; member in struct:_xmlShellCtxt
127 * @node: a first node
128 * @node2: a second node
136 xmlNodePtr node,
[all...]
/external/skia/src/views/animated/
H A DSkStaticTextView.cpp12 static void assert_no_attr(const SkDOM& dom, const SkDOM::Node* node, const char attr[]) argument
14 const char* value = dom.findAttr(node, attr);
19 #define assert_no_attr(dom, node, attr)
151 void SkStaticTextView::onInflate(const SkDOM& dom, const SkDOM::Node* node) argument
154 this->INHERITED::onInflate(dom, node);
157 if ((index = dom.findList(node, "mode", "fixed,auto-width,auto-height")) >= 0) {
160 assert_no_attr(dom, node, "mode");
163 if ((index = dom.findList(node, "spacing-align", "start,center,end")) >= 0) {
166 assert_no_attr(dom, node, "spacing-align");
170 if (dom.findScalars(node, "margi
[all...]
/external/chromium_org/v8/src/compiler/
H A Djs-typed-lowering.cc9 #include "src/compiler/node-aux-data-inl.h"
10 #include "src/compiler/node-properties-inl.h"
23 // Relax the effects of {node} by immediately replacing effect uses of {node}
24 // with the effect input to {node}.
25 // TODO(turbofan): replace the effect input to {node} with {graph->start()}.
27 static void RelaxEffects(Node* node) { argument
28 NodeProperties::ReplaceWithValue(node, node, NULL);
35 Reduction JSTypedLowering::ReplaceEagerly(Node* old, Node* node) { argument
47 JSBinopReduction(JSTypedLowering* lowering, Node* node) argument
146 ConvertToString(Node* node) argument
156 ConvertToNumber(Node* node) argument
167 TryNarrowingToI32(Type* type, Node* node) argument
194 ConvertToI32(bool is_signed, Node* node) argument
224 ReduceJSAdd(Node* node) argument
253 ReduceNumberBinop(Node* node, const Operator* numberOp) argument
268 ReduceI32Binop(Node* node, bool left_signed, bool right_signed, const Operator* intOp) argument
281 ReduceI32Shift(Node* node, bool left_signed, const Operator* shift_op) argument
289 ReduceJSComparison(Node* node) argument
357 ReduceJSEqual(Node* node, bool invert) argument
377 ReduceJSStrictEqual(Node* node, bool invert) argument
528 ReduceJSLoadProperty(Node* node) argument
568 ReduceJSStoreProperty(Node* node) argument
622 ReplaceWithReduction(Node* node, Reduction reduction) argument
631 Reduce(Node* node) argument
[all...]
/external/chromium_org/third_party/libxml/src/
H A Dcheck-relaxng-test-suite.py70 def handle_valid(node, schema):
76 child = node.children
111 def handle_invalid(node, schema):
117 child = node.children
151 def handle_correct(node):
157 child = node.children
177 def handle_incorrect(node):
183 child = node.children
209 def handle_resource(node, dir):
213 name = node
[all...]
/external/chromium_org/components/enhanced_bookmarks/
H A Dmetadata_accessor.cc20 std::string DataForMetaInfoField(const BookmarkNode* node, argument
22 const BookmarkNode::MetaInfoMap* map = node->GetMetaInfoMap();
40 const BookmarkNode* node) {
47 node, enhanced_bookmarks::kIdDataKey, random_id_str);
79 const BookmarkNode* node) {
80 const BookmarkNode::MetaInfoMap* map = node->GetMetaInfoMap();
82 return SetRemoteIdOnBookmark(bookmark_model, node);
86 return SetRemoteIdOnBookmark(bookmark_model, node);
93 const BookmarkNode* node,
95 bookmark_model->SetNodeMetaInfo(node, kNoteKe
39 SetRemoteIdOnBookmark(BookmarkModel* bookmark_model, const BookmarkNode* node) argument
78 RemoteIdFromBookmark(BookmarkModel* bookmark_model, const BookmarkNode* node) argument
92 SetDescriptionForBookmark(BookmarkModel* bookmark_model, const BookmarkNode* node, const std::string& description) argument
98 DescriptionFromBookmark(const BookmarkNode* node) argument
112 SetOriginalImageForBookmark(BookmarkModel* bookmark_model, const BookmarkNode* node, const GURL& url, int width, int height) argument
149 OriginalImageFromBookmark(const BookmarkNode* node, GURL* url, int* width, int* height) argument
168 ThumbnailImageFromBookmark(const BookmarkNode* node, GURL* url, int* width, int* height) argument
187 SnippetFromBookmark(const BookmarkNode* node) argument
200 SetAllImagesForBookmark(BookmarkModel* bookmark_model, const BookmarkNode* node, const GURL& image_url, int image_width, int image_height, const GURL& thumbnail_url, int thumbnail_width, int thumbnail_height) argument
[all...]
/external/chromium_org/third_party/WebKit/Source/core/testing/
H A DPrivateScriptTest.js71 PrivateScriptTestPrototype.firstChild = function(node) {
72 return node.firstChild;
75 PrivateScriptTestPrototype.nextSibling = function(node) {
76 return node.nextSibling;
79 PrivateScriptTestPrototype.innerHTML = function(node) {
80 return node.innerHTML;
83 PrivateScriptTestPrototype.setInnerHTML = function(node, string) {
84 node.innerHTML = string;
87 PrivateScriptTestPrototype.addClickListener = function(node) {
88 node
[all...]
/external/chromium_org/third_party/WebKit/Source/platform/
H A DPODIntervalTree.h154 // Starting from the given node, adds all overlaps with the given
158 void searchForOverlapsFrom(IntervalNode* node, AdapterType& adapter) const argument
160 if (!node)
167 IntervalNode* left = node->left();
174 // Check for overlap with current node.
175 adapter.collectIfNeeded(node->data());
180 if (!(adapter.highValue() < node->data().low()))
181 searchForOverlapsFrom<AdapterType>(node->right(), adapter);
184 virtual bool updateNode(IntervalNode* node) OVERRIDE
188 const T* curMax = &node
207 checkInvariantsFromNode(IntervalNode* node, T* currentMaxValue) const argument
[all...]
/external/chromium_org/third_party/freetype/src/cache/
H A Dftccmap.c39 /* 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 local
159 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
185 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
242 FTC_Node node; local
[all...]
/external/chromium_org/third_party/polymer/components-chromium/core-layout-grid/
H A Dcore-layout-grid-extracted.js24 function(node) {
25 switch(node.localName) {
105 // node index at [i,j]
107 // if a node is there
137 var node = nodes[col - 1];
138 if (node.hasAttribute('h-flex') || node.hasAttribute('flex')) {
141 var w = node.offsetWidth;
154 var node = nodes[row - 1];
155 if (node
[all...]
/external/chromium_org/tools/grit/
H A Dgrit_info.py39 for node in grd:
40 if node.name == 'structure':
41 with node:
43 # hack - see grit/node/structure.py
44 if node.HasFileForLanguage() and node.attrs['sconsdep'] == 'true':
46 path = node.FileForLanguage(lang, lang_folders[lang],
73 for node in grd.ActiveDescendants():
74 with node:
75 if (node
[all...]
/external/chromium_org/ui/views/controls/tree/
H A Dtree_view.cc143 void TreeView::StartEditing(TreeModelNode* node) { argument
144 DCHECK(node);
148 if (model_->GetParent(node))
149 Expand(model_->GetParent(node));
150 // Select the node, else if the user commits the edit the selection reverts.
151 SetSelectedNode(node);
152 if (GetSelectedNode() != node)
223 InternalNode* node = model_node ? GetInternalNodeForModelNode(
226 bool changed = (selected_node_ != node);
229 selected_node_ = node;
275 Expand(TreeModelNode* node) argument
281 ExpandAll(TreeModelNode* node) argument
301 InternalNode* node = GetInternalNodeForModelNode( local
329 InternalNode* node = GetNodeByRow(row, &depth); local
333 GetRowForNode(ui::TreeModelNode* node) argument
396 InternalNode* node = GetNodeByRow(row, &depth); local
471 InternalNode* node = local
642 InternalNode* node = GetNodeByRow(row, &depth); local
677 LoadChildren(InternalNode* node) argument
689 ConfigureInternalNode(TreeModelNode* model_node, InternalNode* node) argument
695 UpdateNodeTextWidth(InternalNode* node) argument
739 SchedulePaintForNode(InternalNode* node) argument
745 PaintRows(gfx::Canvas* canvas, int min_row, int max_row, InternalNode* node, int depth, int* row) argument
764 PaintRow(gfx::Canvas* canvas, InternalNode* node, int row, int depth) argument
865 GetBoundsForNode(InternalNode* node) argument
871 GetBoundsForNodeImpl(InternalNode* node, int row, int depth) argument
883 GetRowForInternalNode(InternalNode* node, int* depth) argument
909 GetNodeByRowImpl(InternalNode* node, int target_row, int current_depth, int* current_row, int* node_depth) argument
944 InternalNode* node = GetNodeByRow(row_count - 1, &depth); local
1017 Reset(ui::TreeModelNode* node) argument
[all...]
/external/freetype/src/cache/
H A Dftccmap.c39 /* 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 local
159 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
185 FTC_CMapNode node = (FTC_CMapNode)ftcnode; local
242 FTC_Node node; local
[all...]
/external/xmp_toolkit/XMPCore/src/com/adobe/xmp/impl/
H A DXMPSerializerRDF.java408 * @param parentNode the parent property node
440 * Recursively handles the "value" for a node that must be written as an RDF
483 * @param parentNode the parent node
493 XMPNode node = (XMPNode) it.next();
494 if (canBeRDFAttrProp (node))
505 String elemName = node.getName();
518 for (Iterator iq = node.iterateQualifier(); iq.hasNext();)
540 serializeCompactRDFGeneralQualifier(indent, node);
544 // This node has only attribute qualifiers. Emit as a property element.
545 if (!node
587 serializeCompactRDFSimpleProp(XMPNode node) argument
626 serializeCompactRDFArrayProp(XMPNode node, int indent) argument
655 serializeCompactRDFStructProp(XMPNode node, int indent, boolean hasRDFResourceQual) argument
744 serializeCompactRDFGeneralQualifier(int indent, XMPNode node) argument
830 declareUsedNamespaces(XMPNode node, Set usedPrefixes, int indent) argument
950 serializePrettyRDFProperty(XMPNode node, boolean emitAsRDFValue, int indent) argument
1207 canBeRDFAttrProp(XMPNode node) argument
[all...]
/external/chromium_org/third_party/libxslt/libxslt/
H A Dnamespaces.c87 * @node: the xsl:namespace-alias node
93 xsltNamespaceAlias(xsltStylesheetPtr style, xmlNodePtr node) argument
103 if ((style == NULL) || (node == NULL))
128 stylePrefix = xmlGetNsProp(node, (const xmlChar *)"stylesheet-prefix", NULL);
130 xsltTransformError(NULL, style, node,
135 literalNs = xmlSearchNs(node->doc, node, NULL);
137 literalNs = xmlSearchNs(node->doc, node, stylePrefi
735 xsltCopyNamespaceList(xsltTransformContextPtr ctxt, xmlNodePtr node, xmlNsPtr cur) argument
[all...]
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.cpp44 void Graph::insert(Node *node) argument
47 root = node;
49 node->graph = this;
95 void Graph::Node::attach(Node *node, Edge::Type kind) argument
97 Edge *edge = new Edge(this, node, kind);
108 if (node->in) {
109 edge->next[1] = node->in;
110 edge->prev[1] = node->in->prev[1];
112 node->in->prev[1] = edge;
114 node
129 detach(Graph::Node *node) argument
169 reachableBy(const Node *node, const Node *term) const argument
220 search(Graph::Node *node, const bool preorder, const int sequence) argument
284 search(Graph::Node *node, const int sequence) argument
344 Node *node = reinterpret_cast<Node *>(it->get()); local
357 Graph::Node *node; local
[all...]
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.cpp44 void Graph::insert(Node *node) argument
47 root = node;
49 node->graph = this;
95 void Graph::Node::attach(Node *node, Edge::Type kind) argument
97 Edge *edge = new Edge(this, node, kind);
108 if (node->in) {
109 edge->next[1] = node->in;
110 edge->prev[1] = node->in->prev[1];
112 node->in->prev[1] = edge;
114 node
129 detach(Graph::Node *node) argument
169 reachableBy(const Node *node, const Node *term) const argument
220 search(Graph::Node *node, const bool preorder, const int sequence) argument
284 search(Graph::Node *node, const int sequence) argument
344 Node *node = reinterpret_cast<Node *>(it->get()); local
357 Graph::Node *node; local
[all...]

Completed in 721 milliseconds

<<11121314151617181920>>