| /external/apache-xml/src/main/java/org/apache/xpath/ |
| NodeSet.java | 29 import org.w3c.dom.Node;
126 * Create a NodeSet which contains the given Node.
128 * @param node Single node to be added to the new set.
130 public NodeSet(Node node)
135 addNode(node);
139 * @return The root node of the Iterator, as specified when it was created.
142 public Node getRoot()
176 * This attribute determines which node types are presented via th
526 Node node = nodelist.item(i); local
550 Node node; local
580 Node node = nodelist.item(testIndex); local
1205 Node node = m_map[i]; local
1304 Node node = m_map[i]; local
1333 Node node = m_map[i]; local
1361 Node node = m_map[i]; local
[all...] |
| /external/v8/src/compiler/ |
| property-access-builder.cc | 11 #include "src/compiler/node-matchers.h"
53 Node** receiver, Node** effect,
54 Node* control) {
67 Node** receiver, Node** effect,
68 Node* control) {
81 bool NeedsCheckHeapObject(Node* receiver) {
107 Node* control = NodeProperties::GetControlInput(receiver);
121 Node* PropertyAccessBuilder::BuildCheckHeapObject(Node* receiver, Node** effect
[all...] |
| checkpoint-elimination.cc | 7 #include "src/compiler/node-properties.h"
21 bool IsRedundantCheckpoint(Node* node) {
22 Node* effect = NodeProperties::GetEffectInput(node);
33 Reduction CheckpointElimination::ReduceCheckpoint(Node* node) {
34 DCHECK_EQ(IrOpcode::kCheckpoint, node->opcode());
35 if (IsRedundantCheckpoint(node)) {
36 return Replace(NodeProperties::GetEffectInput(node));
[all...] |
| escape-analysis.h | 24 // the effect output of a node from changes to the value output to reduce the
41 std::function<void(Node*, Reduction*)> reduce, Zone* zone);
45 // Mark node for revisitation.
46 void Revisit(Node* node);
48 // Add a new root node to start reduction from. This is useful if the reducer
51 void AddRoot(Node* node) {
52 DCHECK_EQ(State::kUnvisited, state_.Get(node));
53 state_.Set(node, State::kRevisit)
61 Node* node; member in struct:v8::internal::compiler::EffectGraphReducer::NodeState
[all...] |
| graph-trimmer.cc | 23 // Mark end node as live.
27 Node* const live = live_[i];
28 for (Node* const input : live->inputs()) MarkAsLive(input);
31 for (Node* const live : live_) {
34 Node* const user = edge.from();
|
| select-lowering.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
23 Reduction SelectLowering::Reduce(Node* node) {
24 if (node->opcode() != IrOpcode::kSelect) return NoChange();
25 SelectParameters const p = SelectParametersOf(node->op());
27 Node* cond = node->InputAt(0);
28 Node* vthen = node->InputAt(1)
[all...] |
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellCommandLib/ |
| UefiShellCommandLib.c | 170 SHELL_COMMAND_INTERNAL_LIST_ENTRY *Node;
178 Node = (SHELL_COMMAND_INTERNAL_LIST_ENTRY *)GetFirstNode(&mCommandList.Link);
179 RemoveEntryList(&Node->Link);
180 SHELL_FREE_NON_NULL(Node->CommandString);
181 FreePool(Node);
182 DEBUG_CODE(Node = NULL;);
311 SHELL_COMMAND_INTERNAL_LIST_ENTRY *Node;
321 for ( Node = (SHELL_COMMAND_INTERNAL_LIST_ENTRY *)GetFirstNode(&mCommandList.Link)
322 ; !IsNull(&mCommandList.Link, &Node->Link)
323 ; Node = (SHELL_COMMAND_INTERNAL_LIST_ENTRY *)GetNextNode(&mCommandList.Link, &Node->Link)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/extensions/ |
| ExpressionContext.java | 26 import org.w3c.dom.Node;
37 * Get the current context node.
38 * @return The current context node.
40 public Node getContextNode();
43 * Get the current context node list.
56 * Get the value of a node as a number.
57 * @param n Node to be converted to a number. May be null.
60 public double toNumber(Node n);
63 * Get the value of a node as a string.
64 * @param n Node to be converted to a string. May be null
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOMHelper.java | 42 import org.w3c.dom.Node;
84 // create a DOM Document node to contain the result.
140 * from the node. Literal elements from template elements should
142 * @param textNode A text node from the source tree.
143 * @return true if the text node should be stripped of extra whitespace.
148 public boolean shouldStripSourceNode(Node textNode)
158 * identifier string for any given DOM Node.
160 * Warning: The base implementation uses the Node object's hashCode(),
166 * that represent a single Node in the data structure (eg via proxying),
174 * (DOM Level 3 is investigating providing a unique node "key", bu
[all...] |
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| NodeCreator.java | 30 Iterable<Node> getNodes(Iterable<Binding<?>> bindings);
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/utils/ |
| PositionUtils.java | 30 import com.github.javaparser.ast.Node;
45 public static <T extends Node> void sortByBeginPosition(List<T> nodes){
49 public static <T extends Node> void sortByBeginPosition(List<T> nodes, final boolean ignoringAnnotations){
53 public static boolean areInOrder(Node a, Node b){
57 public static boolean areInOrder(Node a, Node b, boolean ignoringAnnotations){
61 private static int compare(Node a, Node b, boolean ignoringAnnotations) {
79 public static AnnotationExpr getLastAnnotation(Node node)
[all...] |
| /external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/ |
| SoapFault12.java | 26 import org.ksoap2.kdom.Node;
43 public Node Code;
44 public Node Reason;
45 public Node Node;
46 public Node Role;
47 public Node Detail;
78 this.Code = new Node();
81 this.Reason = new Node();
83 } else if (name.toLowerCase().equals("Node".toLowerCase()))
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 107 class Node;
127 /// edges referencing them are updated to point to the graph \c Node objects
130 /// node of the graph and providing a reference back to the graph in order to
134 /// edges. The edges are stored in the source node and point at the target
135 /// node. This allows the edge structure itself to be a very compact data
144 explicit Edge(Node &N, Kind K);
160 /// have built a graph node for the function yet or not.
163 /// Get the call graph node referenced by this edge if one exists.
165 /// This requires that the edge is not null. If we have built a graph node
166 /// for the function this edge points to, this will return that node,
[all...] |
| /external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
| CommandNode.java | 35 Node out = components.get(0);
36 Node reply = components.get(1);
37 Node error = components.get(2);
48 Node evt = components.get(0);
|
| /external/skia/modules/sksg/src/ |
| SkSGNode.cpp | 16 class Node::ScopedFlag {
18 ScopedFlag(Node* node, uint32_t flag)
19 : fNode(node)
21 , fWasSet(node->fFlags & flag) {
22 node->fFlags |= flag;
33 Node* fNode;
43 Node::Node(uint32_t invalTraits)
49 Node::~Node()
[all...] |
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
| NodeTupleTest.java | 23 Node node = new ScalarNode(new Tag("!tag"), "value1", null, null, null); local
25 new NodeTuple(null, node);
26 fail("Node must be provided.");
33 Node node = new ScalarNode(new Tag("!tag"), "value1", null, null, null); local
35 new NodeTuple(node, null);
36 fail("Node must be provided.");
43 Node key = new ScalarNode(Tag.STR, "key1", null, null, null);
44 Node value = new ScalarNode(Tag.STR, "value1", null, null, null)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Transforms/Utils/ |
| ImportedFunctionsInliningStatistics.cpp | 55 assert(It != NodesMap.end() && "The node should be already there.");
56 // Save Caller as a starting node for traversal. The string has to be one
107 for (const auto &Node : SortedNodes) {
108 assert(Node->second->NumberOfInlines >= Node->second->NumberOfRealInlines);
109 if (Node->second->NumberOfInlines == 0)
112 if (Node->second->Imported) {
115 int(Node->second->NumberOfRealInlines > 0);
119 int(Node->second->NumberOfRealInlines > 0);
124 << (Node->second->Imported ? "imported " : "not imported "
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/WindowsManifest/ |
| WindowsManifestMerger.cpp | 99 static xmlAttrPtr getAttribute(xmlNodePtr Node,
101 for (xmlAttrPtr Attribute = Node->properties; Attribute != nullptr;
124 // Search for prefix-defined namespace specified by HRef, starting on Node and
127 static xmlNsPtr search(const unsigned char *HRef, xmlNodePtr Node) {
128 for (xmlNsPtr Def = Node->nsDef; Def; Def = Def->next) {
133 if (Node->parent) {
134 return search(HRef, Node->parent);
150 // Search for prefix-defined namespace specified by HRef, starting on Node and
152 // not found, then prefix-define that namespace on the node and return a
155 xmlNodePtr Node) {
[all...] |
| /external/tensorflow/tensorflow/compiler/jit/ |
| deadness_analysis.h | 27 // For example, the ADD node in the following graph
46 // Returns true if `node` may have some live inputs and some dead inputs.
48 // This is a conservatively correct routine -- if it returns false then `node`
52 // REQUIRES: node is not a Merge operation.
53 virtual bool HasInputsWithMismatchingDeadness(const Node& node) = 0;
|
| resource_operation_safety_analysis.h | 69 const std::function<Status(const Node&, bool*)>& resource_ops_to_ignore,
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNamedNodeMap.java | 27 import org.w3c.dom.Node;
47 /** The DTM for this node. */
57 * Create a getAttributes NamedNodeMap for a given DTM element node
93 * Retrieves a node specified by name.
94 * @param name The <code>nodeName</code> of a node to retrieve.
95 * @return A <code>Node</code> (of any type) with the specified
97 * any node in this map.
99 public Node getNamedItem(String name)
117 * @return The node at the <code>index</code>th position in the map, or
120 public Node item(int i
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Support/ |
| YAMLParser.h | 29 // yaml::Node *n = di->getRoot();
63 class Node;
104 void printError(Node *N, const Twine &Msg);
114 class Node {
128 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor,
133 Node(const Node &) = delete;
134 void operator=(const Node &) = delete;
148 /// Get the value of the anchor attached to this node. If it does not
156 /// Get the verbatium tag for a given Node. This performs tag resoluto
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| quantize_training.cc | 43 // Node types to rewrite. Insert quantize_and_dequantize op for their inputs.
67 // Decide if a node is in backward pass by checking if its name is led by
70 // forward node will not be named with a leading "gradients".
71 inline bool IsGradientNode(const Graph* graph, const Node* node) {
73 return (node->name().compare(0, tag.size(), tag) == 0);
79 bool FindType(const Graph* graph, const Node* node, bool* signed_input,
81 const string& src_op = node->type_string();
111 for (const Edge* edge : node->in_edges())
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| DOM3Serializer.java | 27 import org.w3c.dom.Node;
117 * Serializes the Level 3 DOM node. Throws an exception only if an I/O
122 * @param node the Level 3 DOM node to serialize
125 public void serializeDOM3(Node node) throws IOException;
|
| /external/apache-xml/src/main/java/org/apache/xpath/axes/ |
| ContextNodeList.java | 23 import org.w3c.dom.Node;
28 * <a href="http://www.w3.org/TR/xslt#dt-current-node-list">current node list</a>,
29 * also refered to here as a <term>context node list</term>.
36 * Get the <a href="http://www.w3.org/TR/xslt#dt-current-node">current node</a>.
39 * @return The current node, or null.
41 public Node getCurrentNode();
50 * <a href="http://www.w3.org/TR/xslt#dt-current-node">current node</a
[all...] |
