Searched refs:node (Results 626 - 650 of 3060) sorted by relevance

<<21222324252627282930>>

/external/sepolicy/tools/sepolicy-analyze/
H A Ddups.c20 avtab_ptr_t node; local
56 for (node = avtab_search_node(&policydb->te_avtab, &avkey);
57 node != NULL;
58 node = avtab_search_node_next(node, avkey.specified)) {
59 uint32_t perms = node->datum.data & d->data;
60 if ((attrib1 && perms == node->datum.data) ||
68 display_allow(policydb, &node->key, i, node->datum.data);
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/
H A DDTMAxisIteratorBase.java32 /** The position of the last node within the iteration, as defined by XPath.
33 * Note that this is _not_ the node's handle within the DTM. Also, don't
38 /** The position of the current node within the iteration, as defined by XPath.
39 * Note that this is _not_ the node's handle within the DTM!
43 /** The position of the marked node within the iteration;
54 /** True if the start node should be considered part of the iteration.
69 * @return The root node of the iteration.
77 * @return A DTMAxisIterator which has been reset to the start node,
95 * Set the flag to include the start node in the iteration.
111 /** Returns the position of the last node withi
211 returnNode(final int node) argument
[all...]
/external/chromium_org/chrome/browser/android/bookmarks/
H A Dpartner_bookmarks_shim.cc90 bool PartnerBookmarksShim::IsReachable(const BookmarkNode* node) const {
91 DCHECK(IsPartnerBookmark(node));
95 for (const BookmarkNode* i = node; i != NULL; i = i->parent()) {
105 bool PartnerBookmarksShim::IsEditable(const BookmarkNode* node) const {
106 DCHECK(IsPartnerBookmark(node));
114 void PartnerBookmarksShim::RemoveBookmark(const BookmarkNode* node) { argument
115 DCHECK(IsEditable(node));
116 RenameBookmark(node, base::string16());
119 void PartnerBookmarksShim::RenameBookmark(const BookmarkNode* node, argument
121 DCHECK(IsEditable(node));
[all...]
/external/chromium_org/chrome/browser/android/enhanced_bookmarks/
H A Denhanced_bookmarks_bridge.cc34 const BookmarkNode* node = bookmarks::GetBookmarkNodeByID( local
37 return node ?
39 env, enhanced_bookmarks::DescriptionFromBookmark(node)) :
51 const BookmarkNode* node = bookmarks::GetBookmarkNodeByID( local
55 bookmark_model_, node,
/external/chromium_org/chrome/browser/resources/chromeos/chromevox/common/
H A Dmemoize.js10 * isAccessible that takes a node and returns a boolean:
12 * function isAccessible(node) {
13 * return expensiveComputation(node);
18 * function isAccessible(node) {
19 * return cvox.Memoize.memoize(computeIsAccessible_, 'isAccessible', node);
22 * function computeIsAccessible_(node) {
23 * return expensiveComputation(node);
50 * The cache: a map from string function name to a WeakMap from DOM node
106 * arguments in addition to a DOM node, you can incorporate those
108 * @param {Node} node Th
[all...]
/external/chromium_org/chrome/browser/ui/ash/accessibility/
H A Dax_tree_source_ash.h36 virtual int32 GetId(views::AXAuraObjWrapper* node) const OVERRIDE;
37 virtual void GetChildren(views::AXAuraObjWrapper* node,
40 views::AXAuraObjWrapper* node) const OVERRIDE;
41 virtual bool IsValid(views::AXAuraObjWrapper* node) const OVERRIDE;
46 views::AXAuraObjWrapper* node, ui::AXNodeData* out_data) const OVERRIDE;
/external/chromium_org/components/bookmarks/browser/
H A Dbookmark_index.h39 void Add(const BookmarkNode* node);
42 void Remove(const BookmarkNode* node);
63 // Add |node| to |results| if the node matches the query.
65 const BookmarkNode* node,
71 // is the first term in the query. Returns true if there is at least one node
101 // Adds |node| to |index_|.
102 void RegisterNode(const base::string16& term, const BookmarkNode* node);
104 // Removes |node| from |index_|.
105 void UnregisterNode(const base::string16& term, const BookmarkNode* node);
[all...]
/external/chromium_org/extensions/renderer/resources/
H A Dwindow_controls.js19 function WindowControls(node) {
20 this.node_ = node;
21 this.shadowRoot_ = this.createShadowRoot_(node);
33 WindowControls.prototype.createShadowRoot_ = function(node) {
43 var shadowRoot = node.createShadowRoot();
/external/chromium_org/third_party/WebKit/Source/core/rendering/
H A DRenderMeter.cpp43 ASSERT(node());
45 if (isHTMLMeterElement(*node()))
46 return toHTMLMeterElement(node());
48 ASSERT(node()->shadowHost());
49 return toHTMLMeterElement(node()->shadowHost());
H A DRenderProgress.cpp105 if (!node())
108 if (isHTMLProgressElement(*node()))
109 return toHTMLProgressElement(node());
111 ASSERT(node()->shadowHost());
112 return toHTMLProgressElement(node()->shadowHost());
/external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/tool/servers/data/rebaselineserver/
H A Dutil.js61 var node = $('log');
67 node.appendChild(typeNode);
70 node.appendChild(document.createTextNode(text + '\n'));
71 node.scrollTop = node.scrollHeight;
/external/chromium_org/third_party/angle/src/compiler/translator/
H A DOutputGLSLBase.cpp22 bool isSingleStatement(TIntermNode *node) argument
24 if (const TIntermAggregate *aggregate = node->getAsAggregate())
29 else if (const TIntermSelection *selection = node->getAsSelectionNode())
35 else if (node->getAsLoopNode())
183 void TOutputGLSLBase::visitSymbol(TIntermSymbol *node) argument
186 if (mLoopUnrollStack.needsToReplaceSymbolWithValue(node))
187 out << mLoopUnrollStack.getLoopIndexValue(node);
189 out << hashVariableName(node->getSymbol());
191 if (mDeclaringVariables && node->getType().isArray())
192 out << arrayBrackets(node
195 visitConstantUnion(TIntermConstantUnion *node) argument
200 visitBinary(Visit visit, TIntermBinary *node) argument
390 visitUnary(Visit visit, TIntermUnary *node) argument
501 visitSelection(Visit visit, TIntermSelection *node) argument
538 visitAggregate(Visit visit, TIntermAggregate *node) argument
557 TIntermNode *node = *iter; local
802 visitLoop(Visit visit, TIntermLoop *node) argument
885 visitBranch(Visit visit, TIntermBranch *node) argument
908 visitCodeBlock(TIntermNode *node) argument
[all...]
/external/chromium_org/third_party/libxml/src/include/libxml/
H A Dxlink.h59 * @node: the node to check
64 typedef void (*xlinkNodeDetectFunc) (void *ctx, xmlNodePtr node);
74 * @node: the node carrying the link
83 xmlNodePtr node,
91 * @node: the node carrying the link
108 xmlNodePtr node,
124 * @node
[all...]
/external/chromium_org/tools/memory_inspector/memory_inspector/classification/
H A Dmmap_classifier_unittest.py91 def CheckResult(node, prefix):
92 node_name = prefix + node.name
94 subtotal = node.values[0]
95 values = node.values[1:]
103 for child in node.children:
/external/chromium_org/v8/src/compiler/
H A Dgraph-replay.cc10 #include "src/compiler/node.h"
27 GenericGraphVisit::Control GraphReplayPrinter::Pre(Node* node) { argument
28 PrintReplayOpCreator(node->op());
29 PrintF(" Node* n%d = graph.NewNode(op", node->id());
30 for (int i = 0; i < node->InputCount(); ++i) {
33 PrintF("); USE(n%d);\n", node->id());
H A Dscheduler.h30 // Build and connect the CFG for a node graph, but don't schedule nodes.
36 // Per-node data tracked during scheduling.
38 int unscheduled_count_; // Number of unscheduled uses of this node.
40 bool is_connected_control_; // {true} if control-connected to the end node.
42 // to the end node.
43 Placement placement_ : 3; // Whether the node is fixed, schedulable,
59 SchedulerData* GetData(Node* node) { argument
60 DCHECK(node->id() < static_cast<int>(node_data_.size()));
61 return &node_data_[node->id()];
66 Placement GetPlacement(Node* node);
[all...]
/external/droiddriver/src/com/google/android/droiddriver/actions/accessibility/
H A DAccessibilityClickAction.java43 protected boolean perform(AccessibilityNodeInfo node, UiElement element) { argument
54 protected boolean perform(AccessibilityNodeInfo node, UiElement element) { argument
59 return node.performAction(AccessibilityNodeInfo.ACTION_LONG_CLICK);
69 protected boolean perform(AccessibilityNodeInfo node, UiElement element) { argument
74 return node.performAction(AccessibilityNodeInfo.ACTION_CLICK);
/external/libxml2/include/libxml/
H A Dxlink.h59 * @node: the node to check
64 typedef void (*xlinkNodeDetectFunc) (void *ctx, xmlNodePtr node);
74 * @node: the node carrying the link
83 xmlNodePtr node,
91 * @node: the node carrying the link
108 xmlNodePtr node,
124 * @node
[all...]
/external/skia/src/core/
H A DSkQuadTree.h19 * in which each internal node has exactly four children.
40 * Insert a node, consisting of bounds and a data value into the tree, if we don't immediately
67 * This gets the insertion count (rather than the node count)
93 SkIPoint fSplitPoint; // Only valid if the node has children.
104 void insert(Node* node, Entry* entry);
105 void split(Node* node);
106 void search(Node* node, const SkIRect& query, SkTDArray<void*>* results) const;
107 void clear(Node* node);
108 int getDepth(Node* node) const;
/external/smack/src/org/jivesoftware/smackx/packet/
H A DOfflineMessageInfo.java37 private String node = null; field in class:OfflineMessageInfo
67 return node;
75 * @param node the stamp that uniquely identifies the offline message.
77 public void setNode(String node) { argument
78 this.node = node;
86 buf.append("<item node=\"").append(getNode()).append("\"/>");
116 info.setNode(parser.getAttributeValue("", "node"));
/external/chromium_org/third_party/WebKit/Source/devtools/front_end/sdk/
H A DDOMModel.js79 var node = new WebInspector.DOMNode(this._domModel, this.ownerDocument, true, root);
80 this._shadowRoots.push(node);
81 node.parentNode = this;
505 * @param {?WebInspector.DOMNode} node
507 function canPush(node)
509 return node && ("index" in node || (node.isShadowRoot() && node.parentNode)) && node
1261 var node = parent._insertChild(prev, payload); variable
[all...]
/external/chromium_org/third_party/WebKit/Source/web/resources/
H A DsuggestionPicker.js147 var node = this._containerElement.childNodes[i];
148 if (node.classList.contains(SuggestionPicker.ListEntryClass))
150 totalHeight += node.offsetHeight;
224 var node = childNodes[i];
225 if (node.nodeType !== Node.ELEMENT_NODE || !node.classList.contains(SuggestionPicker.ListEntryClass))
227 if (node.offsetTop + node.offsetHeight - scrollTop > SuggestionPicker.VisibleEntryThresholdHeight)
228 return node;
240 var node
[all...]
/external/chromium_org/third_party/WebKit/Source/core/dom/
H A DPosition.cpp54 static Node* nextRenderedEditable(Node* node) argument
56 for (node = node->nextLeafNode(); node; node = node->nextLeafNode()) {
57 RenderObject* renderer = node->renderer();
60 if (!node->hasEditableStyle())
63 return node;
68 static Node* previousRenderedEditable(Node* node) argument
124 moveToPosition(PassRefPtrWillBeRawPtr<Node> node, int offset) argument
281 Node* node = anchorNode(); local
297 Node* node = deprecatedNode(); local
333 Node* node = deprecatedNode(); local
482 endsOfNodeAreVisuallyDistinctPositions(Node* node) argument
503 enclosingVisualBoundary(Node* node) argument
788 nodeIsUserSelectNone(Node* node) argument
793 nodeIsUserSelectAll(const Node* node) argument
798 rootUserSelectAllForNode(Node* node) argument
[all...]
/external/icu/icu4c/source/i18n/
H A Dcollationbuilder.cpp315 int64_t node = nodes.elementAti(index); local
316 // If the index is for a "weaker" tailored node,
318 while(strengthFromNode(node) > strength) {
319 index = previousIndexFromNode(node);
320 node = nodes.elementAti(index);
323 // Find or insert a node whose index we will put into a temporary CE.
324 if(strengthFromNode(node) == strength && isTailoredNode(node)) {
325 // Reset to just before this same-strength tailored node.
326 index = previousIndexFromNode(node);
491 int64_t node = nodes.elementAti(index); local
510 int64_t node = nodes.elementAti(index); local
579 int64_t node = nodes.elementAti(index); local
828 int64_t node = nodes[rootPrimaryIndexes[i]]; local
879 int64_t node = nodes.elementAti(index); local
917 int64_t node = nodes.elementAti(index); local
930 insertNodeBetween(int32_t index, int32_t nextIndex, int64_t node, UErrorCode &errorCode) argument
955 int64_t node = nodes.elementAti(index); local
1360 int64_t node = nodesArray[i]; local
1524 int64_t node = nodesArray[i]; local
[all...]
/external/srec/tools/grxmlcompile/
H A Dgrxmldoc.cpp117 bool GRXMLDoc::parseGrammar( XMLNode &node, std::string & xMLFileName ) argument
122 // The top level "document" node is given to this fn
130 parseNode( node, p_SubGraph, 1 ); // NB Subgraph pointed to will change in recursive fn.
142 bool GRXMLDoc::parseNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level ) argument
144 // We will create a new subgraph for each rule node.
149 // Initial processing of the current node before processing children
151 if(node.Type() == TiXmlNode::ELEMENT)
152 node.ToElement()->Print( stdout, level);
153 else if(node.Type() == TiXmlNode::DOCUMENT)
154 node
184 beginNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level ) argument
277 endNode( XMLNode &node, SubGraph *&p_SubGraph, const unsigned int level ) argument
358 beginParseGrammarNode(XMLNode &node) argument
374 beginParseMetaNode(XMLNode &node) argument
400 endParseGrammarNode(XMLNode &node) argument
407 beginParseRuleNode( XMLNode &node, SubGraph *&p_SubGraph) argument
461 endParseRuleNode( XMLNode &node, SubGraph *&p_SubGraph ) argument
484 processCDATA( XMLNode &node, SubGraph *&p_SubGraph ) argument
555 beginItem( XMLNode &node, SubGraph *&p_SubGraph ) argument
586 endItem( XMLNode &node, SubGraph *&p_SubGraph ) argument
597 beginRuleRef( XMLNode &node, SubGraph *&p_SubGraph ) argument
673 beginTag( XMLNode &node, SubGraph *&p_SubGraph ) argument
694 endTag( XMLNode &node, SubGraph *&p_SubGraph ) argument
701 beginCount( XMLNode &node, SubGraph *&p_SubGraph ) argument
742 endCount( XMLNode &node, SubGraph *&p_SubGraph ) argument
749 endParseMetaNode(XMLNode &node) argument
755 printNode(XMLNode &node, int level) argument
979 getRuleRefName(XMLNode &node, std::string &ruleName) argument
[all...]

Completed in 1485 milliseconds

<<21222324252627282930>>