| /external/apache-xml/src/main/java/org/apache/xml/serializer/utils/ |
| DOM2Helper.java | 23 import org.w3c.dom.Node;
34 * dropped method isNodeAfter(Node node1, Node node2)
38 * dropped method checkNode(Node)
41 * dropped method getParentOfNode(Node node)
59 * Returns the local name of the given node, as defined by the
62 * parsing the node name.
64 * @param n Node to be examined
66 * @return String containing the local name, or null if the node
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| PrefixResolverDefault.java | 24 import org.w3c.dom.Node;
39 Node m_context;
46 * is an attribute node.
48 public PrefixResolverDefault(Node xpathExpressionContext)
69 * is an attribute node.
71 * @param namespaceContext Node from which to start searching for a
77 org.w3c.dom.Node namespaceContext)
80 Node parent = namespaceContext;
92 && (((type = parent.getNodeType()) == Node.ELEMENT_NODE)
93 || (type == Node.ENTITY_REFERENCE_NODE))
[all...] |
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| Token.java | 3 package com.google.clearsilver.jsilver.syntax.node;
6 public abstract class Token extends Node
49 void removeChild(@SuppressWarnings("unused") Node child)
55 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| /external/libcxx/test/libcxx/containers/associative/ |
| tree_left_rotate.pass.cpp | 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node* __parent_unsafe() const { return __parent_; }
27 void __set_parent(Node* x) { __parent_ = x;}
29 Node() : __left_(), __right_(), __parent_() {}
35 Node root;
36 Node x;
37 Node y
[all...] |
| tree_right_rotate.pass.cpp | 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node* __parent_unsafe() const { return __parent_; }
27 void __set_parent(Node* x) { __parent_ = x;}
29 Node() : __left_(), __right_(), __parent_() {}
35 Node root;
36 Node x;
37 Node y
[all...] |
| /external/llvm/lib/Target/WebAssembly/ |
| WebAssemblyISelDAGToDAG.cpp | 57 void Select(SDNode *Node) override;
70 void WebAssemblyDAGToDAGISel::Select(SDNode *Node) {
71 // Dump information about the Node being selected.
73 DEBUG(Node->dump(CurDAG));
76 // If we have a custom node, we already have selected!
77 if (Node->isMachineOpcode()) {
78 DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
79 Node->setNodeId(-1);
84 EVT VT = Node->getValueType(0);
86 switch (Node->getOpcode())
[all...] |
| /external/skia/src/core/ |
| SkArenaAllocList.h | 21 struct Node;
42 explicit Iter(Node* node) : fCurr(node) {}
43 Node* fCurr = nullptr;
51 struct Node {
53 Node(Args... args) : fT(std::forward<Args>(args)...) {}
55 Node* fNext = nullptr;
57 Node* fHead = nullptr;
58 Node* fTail = nullptr
[all...] |
| /external/skqp/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/skqp/src/core/ |
| SkArenaAllocList.h | 21 struct Node;
42 explicit Iter(Node* node) : fCurr(node) {}
43 Node* fCurr = nullptr;
51 struct Node {
53 Node(Args... args) : fT(std::forward<Args>(args)...) {}
55 Node* fNext = nullptr;
57 Node* fHead = nullptr;
58 Node* fTail = nullptr
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| colocation_graph.h | 31 // Represents a node in the disjoint node forest and the
32 // accumulated constraints on the device used by that node.
37 Status SetParentAndSupportedDevices(const Node& node,
46 Status SetRequestedDeviceName(const Node& node);
49 const Node& src, const Member& src_root,
50 const Node& dst, /*dst_root is this*/
74 Status AssignDevice(const Node& node, bool allow_soft_placement)
[all...] |
| lower_if_op.h | 24 // Replaces If node `n` with its lowered form that uses Switch and Merge nodes.
25 Status RewriteIfNode(Node* n, Graph* g, const FunctionLibraryDefinition& flib);
|
| lower_while_op.h | 24 // Replaces While node `n` with its lowered form that uses Enter, Exit, Switch,
26 Status RewriteWhileNode(Node* n, Graph* g,
|
| /external/tensorflow/tensorflow/core/graph/ |
| optimizer_cse.h | 28 // consider_fn(node) returns true will be considered for combining
33 const std::function<bool(const Node*)>& consider_fn);
|
| costmodel.h | 40 // * The total number of times a node has executed.
41 // * The accumulated execution time (in microseconds) of a node.
42 // * The accumulated size (in bytes) of each node's output.
47 // If "global" is true, maintains costs based on Node::cost_id, otherwise
48 // maintains costs based on Node::id.
53 // Assigns min_count_ as a function of the median count for a Node.
61 inline int Id(const Node* n) const {
82 // Sets the number of outputs of "node".
83 void SetNumOutputs(const Node* node, int num_outputs)
[all...] |
| /external/v8/src/compiler/ |
| all-nodes.h | 8 #include "src/compiler/node.h"
22 AllNodes(Zone* local_zone, Node* end, const Graph* graph,
25 // reachable from the End node.
28 bool IsLive(const Node* node) const {
30 return IsReachable(node);
33 bool IsReachable(const Node* node) const {
34 if (!node) return false;
35 size_t id = node->id()
[all...] |
| value-numbering-reducer.h | 24 Reduction Reduce(Node* node) override;
29 Reduction ReplaceIfTypesMatch(Node* node, Node* replacement);
34 Node** entries_;
|
| raw-machine-assembler.cc | 7 #include "src/compiler/node-properties.h"
32 // Add an extra input for the JSFunction parameter to the start node.
45 Node* RawMachineAssembler::NullConstant() {
49 Node* RawMachineAssembler::UndefinedConstant() {
53 Node* RawMachineAssembler::RelocatableIntPtrConstant(intptr_t value,
80 Node* RawMachineAssembler::TargetParameter() {
85 Node* RawMachineAssembler::Parameter(size_t index) {
98 void RawMachineAssembler::Branch(Node* condition, RawMachineLabel* true_val,
101 Node* branch = MakeNode(
108 void RawMachineAssembler::Continuations(Node* call, RawMachineLabel* if_success
514 Node* node = MakeNode(op, input_count, inputs); local
515 schedule()->AddNode(CurrentBlock(), node); local
[all...] |
| node.cc | 5 #include "src/compiler/node.h"
11 Node::OutOfLineInputs* Node::OutOfLineInputs::New(Zone* zone, int capacity) {
13 sizeof(OutOfLineInputs) + capacity * (sizeof(Node*) + sizeof(Use));
15 Node::OutOfLineInputs* outline =
23 void Node::OutOfLineInputs::ExtractFrom(Use* old_use_ptr, Node** old_input_ptr,
28 Node** new_input_ptr = inputs_;
34 Node* old_to = *old_input_ptr;
52 Node* Node::New(Zone* zone, NodeId id, const Operator* op, int input_count
56 Node* node; local
[all...] |
| node-properties.cc | 5 #include "src/compiler/node-properties.h"
10 #include "src/compiler/node-matchers.h"
23 int NodeProperties::PastValueIndex(Node* node) {
24 return FirstValueIndex(node) + node->op()->ValueInputCount();
29 int NodeProperties::PastContextIndex(Node* node) {
30 return FirstContextIndex(node) +
31 OperatorProperties::GetContextInputCount(node->op())
91 Node* const node = edge.from(); local
99 Node* const node = edge.from(); local
107 Node* const node = edge.from(); local
115 Node* const node = edge.from(); local
123 Node* const node = edge.from(); local
[all...] |
| effect-control-linearizer.cc | 12 #include "src/compiler/node-matchers.h"
13 #include "src/compiler/node-origin-table.h"
14 #include "src/compiler/node-properties.h"
15 #include "src/compiler/node.h"
50 Node* current_effect = nullptr; // New effect.
51 Node* current_control = nullptr; // New control.
52 Node* current_frame_state = nullptr; // New frame state.
76 Node* effect_phi;
79 PendingEffectPhi(Node* effect_phi, BasicBlock* block)
83 void ConnectUnreachableToEnd(Node* effect, Node* control, JSGraph* jsgraph)
356 Node* node = block->NodeAt(instr); local
470 Node* node = block->NodeAt(instr); local
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| IListTest.cpp | 20 struct Node : ilist_node<Node> {
23 Node() {}
24 Node(int Value) : Value(Value) {}
25 Node(const Node&) = default;
26 ~Node() { Value = -1; }
30 ilist<Node> List;
31 List.push_back(new Node(1));
36 List.push_back(new Node(2))
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/dom2dtm/ |
| DOM2DTMdefaultNamespaceDeclarationNode.java | 30 import org.w3c.dom.Node;
37 * DOM2DTM model. Basically, it creates a proxy node in DOM space to
49 * %REVIEW% An alternative solution would be to create the node _only_
80 public Node getParentNode() {return null;}
81 public Node getFirstChild() {return null;}
82 public Node getLastChild() {return null;}
83 public Node getPreviousSibling() {return null;}
84 public Node getNextSibling() {return null;}
89 public short getNodeType() {return Node.ATTRIBUTE_NODE;}
93 public Node insertBefore(Node a, Node b) {throw new DTMException(NOT_SUPPORTED_ERR);
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| RegionIterator.h | 50 PointerIntPair<NodeType*, 2, enum ItMode> Node;
55 // advanceRegionSucc - A region node has only one successor. It reaches end
58 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
59 Node.setInt(ItRgEnd);
62 NodeType* getNode() const{ return Node.getPointer(); }
65 bool isRegionMode() const { return Node.getInt() != ItBB; }
78 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
92 inline RNSuccIterator(NodeType* node)
93 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /external/llvm/lib/Target/BPF/ |
| BPFISelDAGToDAG.cpp | 76 // If the first operand is a FI, get the TargetFI Node
104 // If the first operand is a FI, get the TargetFI Node
118 void BPFDAGToDAGISel::Select(SDNode *Node) {
119 unsigned Opcode = Node->getOpcode();
121 // Dump information about the Node being selected
122 DEBUG(dbgs() << "Selecting: "; Node->dump(CurDAG); dbgs() << '\n');
124 // If we have a custom node, we already have selected!
125 if (Node->isMachineOpcode()) {
126 DEBUG(dbgs() << "== "; Node->dump(CurDAG); dbgs() << '\n');
135 const DebugLoc &DL = Node->getDebugLoc()
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/ |
| Node.java | 49 import static com.github.javaparser.ast.Node.Parsedness.PARSED;
50 import static com.github.javaparser.ast.Node.TreeTraversal.PREORDER;
54 import com.github.javaparser.ast.Node;
71 * ... and use the various methods on the node to initialize it further, if needed.
73 * <p>The parent node field is managed automatically and can be seen as read only.
75 * and trying to use the same node in two places will lead to unexpected behaviour.
76 * It is advised to clone() a node before moving it around.
78 * <p>Each Node can have one associated comment which describes it and
95 * A visitor can be "run" by calling accept on a node:
96 * <pre>node.accept(visitor, argument);</pre
[all...] |
