| /device/linaro/bootloader/edk2/BaseTools/Source/Python/UPT/Library/Xml/ |
| XmlRoutines.py | 47 Node = Doc.createElement(Key)
48 Node.appendChild(Doc.createTextNode(Value))
49 Element.appendChild(Node)
65 # @param Dom The root XML DOM node.
81 for Node in Nodes:
82 if Node.nodeType == Node.ELEMENT_NODE and Node.tagName == \
85 ChildNodes.extend(Node.childNodes)
87 ChildNodes.append(Node)
[all...] |
| /device/linaro/bootloader/edk2/OvmfPkg/XenBusDxe/ |
| XenStore.h | 45 @param Node The basename of the path to read.
59 IN CONST CHAR8 *Node,
69 @param Node The basename of the path to read.
79 IN CONST CHAR8 *Node
89 @param Node The basename of the file to read.
103 IN CONST CHAR8 *Node,
113 @param Node The basename of the file to write.
123 IN CONST CHAR8 *Node,
132 @param Node The basename of the directory to remove.
141 IN CONST CHAR8 *Node
[all...] |
| /external/gemmlowp/profiling/ |
| profiler.h | 113 // Each node shows the absolute percentage, among all the samples,
115 // The percentages are *NOT* relative to the parent node. In addition
117 // the remainder of samples under the parent node that didn't fall into
158 struct Node {
159 std::vector<Node*> children;
162 Node() : label(nullptr), weight(0) {}
163 ~Node() {
170 static bool CompareNodes(Node* n1, Node* n2) {
174 Node root_
[all...] |
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ |
| CommentsInserter.java | 25 import com.github.javaparser.ast.Node;
32 import static com.github.javaparser.ast.Node.NODE_BY_BEGIN_POSITION;
63 List<Node> children = cu.getChildrenNodes();
76 * This method try to attributes the nodes received to child of the node. It
77 * returns the node that were not attributed.
79 void insertComments(Node node, TreeSet<Comment> commentsToAttribute) {
83 if(node instanceof CompilationUnit){
84 insertComments((CompilationUnit)node, commentsToAttribute);
95 List<Node> children = node.getChildrenNodes()
[all...] |
| /external/clang/lib/AST/ |
| ASTDumper.cpp | 124 /// Dump a child of the current node.
144 // children of this node. For instance:
228 void dumpBareDeclRef(const Decl *Node);
229 void dumpDeclRef(const Decl *Node, const char *Label = nullptr);
497 void VisitStmt(const Stmt *Node);
498 void VisitDeclStmt(const DeclStmt *Node);
499 void VisitAttributedStmt(const AttributedStmt *Node);
500 void VisitLabelStmt(const LabelStmt *Node);
501 void VisitGotoStmt(const GotoStmt *Node);
502 void VisitCXXCatchStmt(const CXXCatchStmt *Node);
[all...] |
| /external/llvm/lib/Target/MSP430/ |
| MSP430ISelDAGToDAG.cpp | 131 /// MatchWrapper - Try to match MSP430ISD::Wrapper node into an addressing mode.
164 /// MatchAddressBase - Helper for MatchAddress. Add the specified node to the
379 void MSP430DAGToDAGISel::Select(SDNode *Node) {
380 SDLoc dl(Node);
382 // Dump information about the Node being selected
384 DEBUG(Node->dump(CurDAG));
387 // If we have a custom node, we already have selected!
388 if (Node->isMachineOpcode()) {
390 Node->dump(CurDAG);
392 Node->setNodeId(-1)
[all...] |
| /external/skia/src/xml/ |
| SkDOM.cpp | 15 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) {
16 const char* elemName = dom.getName(node);
22 SkDOM::AttrIter iter(dom, node);
31 if ((node = dom.getFirstChild(node)) != nullptr) {
33 if (!this->parse(dom, node)) {
36 } while ((node = dom.getNextSibling(node)) != nullptr);
74 const SkDOM::Node* SkDOM::getRootNode() const {
78 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const
206 SkDOM::Node* node = fAlloc->make<SkDOM::Node>(); local
[all...] |
| /external/skqp/src/xml/ |
| SkDOM.cpp | 15 bool SkXMLParser::parse(const SkDOM& dom, const SkDOMNode* node) {
16 const char* elemName = dom.getName(node);
22 SkDOM::AttrIter iter(dom, node);
31 if ((node = dom.getFirstChild(node)) != nullptr) {
33 if (!this->parse(dom, node)) {
36 } while ((node = dom.getNextSibling(node)) != nullptr);
74 const SkDOM::Node* SkDOM::getRootNode() const {
78 const SkDOM::Node* SkDOM::getFirstChild(const Node* node, const char name[]) const
206 SkDOM::Node* node = fAlloc->make<SkDOM::Node>(); local
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Target/MSP430/ |
| MSP430ISelDAGToDAG.cpp | 136 /// MatchWrapper - Try to match MSP430ISD::Wrapper node into an addressing mode.
169 /// MatchAddressBase - Helper for MatchAddress. Add the specified node to the
384 SDNode *MSP430DAGToDAGISel::Select(SDNode *Node) {
385 DebugLoc dl = Node->getDebugLoc();
387 // Dump information about the Node being selected
389 DEBUG(Node->dump(CurDAG));
392 // If we have a custom node, we already have selected!
393 if (Node->isMachineOpcode()) {
395 Node->dump(CurDAG);
401 switch (Node->getOpcode())
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| optimizer_cse.cc | 21 // std::unordered_map<size_t, Node*> available
22 // for each node n in forward topological order:
58 bool Optimize(const std::function<bool(const Node*)>& consider_fn);
61 static size_t NodeHash(const Node* n);
62 static bool Equivalent(const Node* a, const Node* b,
68 static void FillInputs(const Node* n,
69 gtl::InlinedVector<const Node*, 4>* control_edges,
70 gtl::InlinedVector<std::pair<const Node*, int>, 4>* in) {
82 // For commutative inputs, we sort the input by the input Node*
[all...] |
| quantize_training_test.cc | 50 Node* Constant(gtl::ArraySlice<T> values, TensorShape shape) {
55 Node** out) {
63 Status FindNode(Graph* g, const string& name, Node** out) {
64 for (Node* node : g->nodes()) {
65 if (node->name() == name) {
66 *out = node;
70 return errors::Unimplemented("Node ", name, " not found.");
88 Node* a = Constant<float>({1.0, 2.0, 3.0, 4.0}, {2, 2});
89 Node* b = Constant<float>({1.0, 2.0, 3.0, 4.0}, {2, 2})
[all...] |
| node_builder.h | 30 // This is a helper for creating a Node and adding it to a Graph.
35 // Node* node;
39 // .Finalize(&graph, &node);
41 // // Use node here.
44 // For specifying the output of a Node to provide to one of the Input()
46 // connecting to an existing Node*), and inputs from outside the graph
48 // you don't have a Node*). Both types can be mixed, e.g. in an
51 // For referencing an existing Node.
52 NodeOut(Node* n, int32 i = 0)
64 Node* node; member in struct:tensorflow::NodeBuilder::NodeOut
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Library/UefiDevicePathLibDevicePathProtocol/ |
| UefiDevicePathLib.c | 36 // Template for an end-of-device path node.
86 @retval FALSE The length of any node node in the DevicePath is less
90 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
111 // Validate the input size big enough to touch the first node.
129 // Validate next node before touch it.
144 // Only return TRUE when the End Device Path node is valid.
150 Returns the Type field of a device path node.
152 Returns the Type field of the device path node specified by Node.
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 147 // If the first operand is a FI, get the TargetFI Node
189 SDNode* MipsDAGToDAGISel::Select(SDNode *Node) {
190 unsigned Opcode = Node->getOpcode();
191 DebugLoc dl = Node->getDebugLoc();
193 // Dump information about the Node being selected
194 DEBUG(errs() << "Selecting: "; Node->dump(CurDAG); errs() << "\n");
196 // If we have a custom node, we already have selected!
197 if (Node->isMachineOpcode()) {
198 DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
211 SDValue InFlag = Node->getOperand(2), CmpLHS
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Target/PTX/ |
| PTXISelDAGToDAG.cpp | 36 SDNode *Select(SDNode *Node);
50 SDNode *SelectBRCOND(SDNode *Node);
52 SDNode *SelectREADPARAM(SDNode *Node);
53 SDNode *SelectWRITEPARAM(SDNode *Node);
54 SDNode *SelectFrameIndex(SDNode *Node);
74 SDNode *PTXDAGToDAGISel::Select(SDNode *Node) {
75 switch (Node->getOpcode()) {
77 return SelectBRCOND(Node);
79 return SelectREADPARAM(Node);
81 return SelectWRITEPARAM(Node);
342 SDNode *node = operand.getNode(); local
[all...] |
| /external/clang/include/clang/ASTMatchers/ |
| ASTMatchersInternal.h | 13 // Matches(...) which is a predicate on an AST node. The Matches method's
15 // or store the current node as bound to a specific string, so that it can be
97 /// \brief Unifies obtaining the underlying type of a regular node through
98 /// `getType` and a TypedefNameDecl node through `getUnderlyingType`.
99 inline QualType getUnderlyingType(const Expr &Node) { return Node.getType(); }
101 inline QualType getUnderlyingType(const ValueDecl &Node) {
102 return Node.getType();
105 inline QualType getUnderlyingType(const TypedefNameDecl &Node) {
106 return Node.getUnderlyingType()
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOM2Helper.java | 33 import org.w3c.dom.Node;
51 * Check node to see if it was created by a DOM implementation
56 * @param node The node to be tested.
58 * @throws TransformerException if the node is not one which this
60 * the node is compatable.
63 public void checkNode(Node node) throws TransformerException
66 // if(!(node instanceof org.apache.xerces.dom.NodeImpl))
67 // throw new TransformerException(XSLMessages.createXPATHMessage(XPATHErrorResources.ER_XERCES_CANNOT_HANDLE_NODES, new Object[]{((Object)node).getClass()})); //"DOM2Helper can not handle nodes of type
[all...] |
| /external/llvm/include/llvm/Support/ |
| YAMLParser.h | 29 // yaml::Node *n = di->getRoot();
57 class Node;
92 void printError(Node *N, const Twine &Msg);
102 class Node {
116 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor,
119 /// \brief Get the value of the anchor attached to this node. If it does not
127 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton
137 Node *parseBlockNode();
162 ~Node() = default;
175 class NullNode final : public Node {
[all...] |
| /external/perfetto/src/traced/probes/filesystem/ |
| prefix_finder.cc | 23 std::string PrefixFinder::Node::ToString() const {
29 PrefixFinder::Node* PrefixFinder::Node::AddChild(std::string name) {
33 PrefixFinder::Node* PrefixFinder::Node::MaybeChild(const std::string& name) {
40 Node* cur = &root_;
43 Node* next = cur->MaybeChild(it->first);
95 PrefixFinder::Node* PrefixFinder::GetPrefix(std::string path) {
100 Node* cur = &root_;
103 Node* next = cur->MaybeChild(token)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/MSP430/ |
| MSP430ISelDAGToDAG.cpp | 134 /// MatchWrapper - Try to match MSP430ISD::Wrapper node into an addressing mode.
167 /// MatchAddressBase - Helper for MatchAddress. Add the specified node to the
382 void MSP430DAGToDAGISel::Select(SDNode *Node) {
383 SDLoc dl(Node);
385 // If we have a custom node, we already have selected!
386 if (Node->isMachineOpcode()) {
387 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
388 Node->setNodeId(-1);
393 switch (Node->getOpcode()) {
396 assert(Node->getValueType(0) == MVT::i16)
[all...] |
| /external/swiftshader/third_party/llvm-subzero/include/llvm/Support/ |
| YAMLParser.h | 29 // yaml::Node *n = di->getRoot();
58 class Node;
95 void printError(Node *N, const Twine &Msg);
105 class Node {
119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor,
122 /// \brief Get the value of the anchor attached to this node. If it does not
130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton
140 Node *parseBlockNode();
165 ~Node() = default;
178 class NullNode final : public Node {
[all...] |
| /external/v8/src/compiler/ |
| escape-analysis-reducer.cc | 36 Reduction EscapeAnalysisReducer::ReplaceNode(Node* original,
37 Node* replacement) {
56 Node* effect = NodeProperties::GetEffectInput(original);
57 Node* control = NodeProperties::GetControlInput(original);
73 Node* SkipTypeGuards(Node* node) {
74 while (node->opcode() == IrOpcode::kTypeGuard) {
75 node = NodeProperties::GetValueInput(node, 0)
86 Node* node = jsgraph()->graph()->NewNode(jsgraph()->common()->ObjectId(id)); local
395 Node* node; local
[all...] |
| wasm-compiler.cc | 31 #include "src/compiler/node-matchers.h"
32 #include "src/compiler/node-origin-table.h"
93 void MergeControlToEnd(MachineGraph* mcgraph, Node* node) {
96 NodeProperties::MergeControlToEnd(g, mcgraph->common(), node);
98 g->SetEnd(g->NewNode(mcgraph->common()->End(1), node));
134 Node* WasmGraphBuilder::Error() { return mcgraph()->Dead(); }
136 Node* WasmGraphBuilder::Start(unsigned params) {
137 Node* start = graph()->NewNode(mcgraph()->common()->Start(params));
142 Node* WasmGraphBuilder::Param(unsigned index)
937 Node* node = SetControl(graph()->NewNode(mcgraph()->common()->TrapIf(trap_id), local
946 Node* node = SetControl(graph()->NewNode( local
3901 Node* node; local
[all...] |
| /external/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 53 PointerIntPair<NodeType*, 2, ItMode> Node;
58 // advanceRegionSucc - A region node has only one successor. It reaches end
61 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
62 Node.setInt(ItRgEnd);
65 NodeType* getNode() const{ return Node.getPointer(); }
68 bool isRegionMode() const { return Node.getInt() != ItBB; }
81 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
95 inline RNSuccIterator(NodeType* node)
96 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| RegionIterator.h | 64 PointerIntPair<NodeRef, 2, ItMode> Node;
69 // advanceRegionSucc - A region node has only one successor. It reaches end
72 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!");
73 Node.setInt(ItRgEnd);
76 NodeRef getNode() const { return Node.getPointer(); }
79 bool isRegionMode() const { return Node.getInt() != ItBB; }
92 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!");
106 inline RNSuccIterator(NodeRef node)
107 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB)
[all...] |
