| /device/linaro/bootloader/edk2/MdeModulePkg/Core/PiSmmCore/ |
| Page.c | 22 Internal Function. Allocate n pages from given free page node.
24 @param Pages The free page node.
40 FREE_PAGE_LIST *Node;
49 Node = (FREE_PAGE_LIST*)((UINTN)Pages + EFI_PAGES_TO_SIZE (Top));
50 Node->NumberOfPages = Pages->NumberOfPages - Top;
51 InsertHeadList (&Pages->Link, &Node->Link);
66 @param FreePageList The free page node.
80 LIST_ENTRY *Node;
83 for (Node = FreePageList->BackLink; Node != FreePageList; Node = Node->BackLink) {
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| TransformState.java | 29 import org.w3c.dom.Node;
68 * This method retrieves the current context node
71 * @return the current context node in the source tree.
73 Node getCurrentNode();
104 * Retrieves the node in the source tree that matched
107 * @return the node in the source tree that matched
110 Node getMatchedNode();
113 * Get the current context node list.
115 * @return the current context node list.
|
| /external/jsilver/src/com/google/clearsilver/jsilver/syntax/node/ |
| ANoopCommand.java | 3 package com.google.clearsilver.jsilver.syntax.node;
34 void removeChild(@SuppressWarnings("unused") Node child)
41 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| ANoopExpression.java | 3 package com.google.clearsilver.jsilver.syntax.node;
34 void removeChild(@SuppressWarnings("unused") Node child)
41 void replaceChild(@SuppressWarnings("unused") Node oldChild, @SuppressWarnings("unused") Node newChild)
|
| /external/swiftshader/third_party/subzero/src/ |
| IceLoopAnalyzer.cpp | 28 /// loops can be found. This assumes that the head node is not shared between
98 /// Process the node as part as part of Tarjan's algorithm and return either a
99 /// node to recurse into or nullptr when the node has been fully processed.
100 LoopNode *processNode(LoopNode &Node);
105 /// means the node's index will also be valid in this list.
109 /// Track which loop a node belongs to.
111 /// The index to assign to the next visited node.
154 for (CfgNode *Node : Nodes)
155 AllNodes.emplace_back(Node);
[all...] |
| /external/v8/src/builtins/ |
| builtins-wasm.cc | 13 typedef compiler::Node Node;
16 Node* context = SmiConstant(Smi::kZero);
|
| builtins-string.cc | 30 Node* DirectStringData(Node* string, Node* string_instance_type) {
64 Node* LoadOneByteChar(Node* string, Node* index) {
68 Node* OneByteCharAddress(Node* string, Node* index) {
69 Node* offset = OneByteCharOffset(index)
[all...] |
| /external/v8/src/compiler/ |
| graph-reducer.cc | 10 #include "src/compiler/node.h"
11 #include "src/compiler/node-properties.h"
28 GraphReducer::GraphReducer(Zone* zone, Graph* graph, Node* dead)
48 void GraphReducer::ReduceNode(Node* node) {
51 Push(node);
54 // Process the node on the top of the stack, potentially pushing more or
55 // popping the node off the stack.
59 Node* const node = revisit_.top() local
113 Node* node = entry.node; local
[all...] |
| loop-peeling.cc | 8 #include "src/compiler/node-marker.h"
9 #include "src/compiler/node-properties.h"
10 #include "src/compiler/node.h"
105 // Maps a node to its index in the {pairs} vector.
113 Node* map(Node* node) {
114 if (node_map.Get(node) == 0) return node;
115 return pairs->at(node_map.Get(node));
367 Node* node = queue.front(); local
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/ |
| DOMLocatorImpl.java | 15 import org.w3c.dom.Node;
27 private final Node relatedNode;
70 /* Related node
73 public Node getRelatedNode() {
|
| UserDataMonitor.java | 17 import org.w3c.dom.Node;
54 Node src,
55 Node dst) {
|
| /external/pdfium/xfa/fxfa/parser/ |
| xfa_basic_data.cpp | 14 XFA_ObjectType::Node},
18 XFA_XDPPACKET_Template | XFA_XDPPACKET_Form, XFA_ObjectType::Node},
20 XFA_ObjectType::Node},
29 XFA_ObjectType::Node},
31 XFA_XDPPACKET_Template | XFA_XDPPACKET_Form, XFA_ObjectType::Node},
33 XFA_ObjectType::Node},
41 XFA_XDPPACKET_Template | XFA_XDPPACKET_Form, XFA_ObjectType::Node},
43 XFA_XDPPACKET_LocaleSet, XFA_ObjectType::Node},
49 XFA_XDPPACKET_Template | XFA_XDPPACKET_Form, XFA_ObjectType::Node},
57 XFA_ObjectType::Node},
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /external/libchrome/sandbox/linux/bpf_dsl/ |
| codegen_unittest.cc | 114 CodeGen::Node MakeInstruction(uint16_t code,
116 CodeGen::Node jt = CodeGen::kNullNode,
117 CodeGen::Node jf = CodeGen::kNullNode) {
118 CodeGen::Node res = gen_.MakeInstruction(code, k, jt, jf);
131 void RunTest(CodeGen::Node head) {
160 const Hash& Lookup(CodeGen::Node next) const {
166 ADD_FAILURE() << "No hash found for node " << next;
173 std::map<CodeGen::Node, Hash> node_hashes_;
181 CodeGen::Node head = MakeInstruction(BPF_RET + BPF_K, 0);
190 CodeGen::Node head = MakeInstruction(BPF_JMP + BPF_JEQ + BPF_K, 42
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.cpp | 42 unsigned InstrEmitter::CountResults(SDNode *Node) {
43 unsigned N = Node->getNumValues();
44 while (N && Node->getValueType(N - 1) == MVT::Glue)
46 if (N && Node->getValueType(N - 1) == MVT::Other)
55 unsigned InstrEmitter::CountOperands(SDNode *Node) {
56 unsigned N = Node->getNumOperands();
57 while (N && Node->getOperand(N - 1).getValueType() == MVT::Glue)
59 if (N && Node->getOperand(N - 1).getValueType() == MVT::Other)
64 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an
67 EmitCopyFromReg(SDNode *Node, unsigned ResNo, bool IsClone, bool IsCloned
[all...] |
| /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...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/ |
| ExplodedRenderingHelper.java | 28 import org.w3c.dom.Node;
62 * @param root the root node (ie the top layout).
65 public ExplodedRenderingHelper(Node root, IProject iProject) {
84 * @param root the root node (ie the top layout).
87 public ExplodedRenderingHelper(Node root, Set<String> layoutNames) {
115 private void computePadding(Node view, int[] padding) {
123 Map<Node, int[]> childrenPadding = new HashMap<Node, int[]>(count);
125 Node child = children.item(i);
127 if (type == Node.ELEMENT_NODE) { // ignore TEXT/CDATA nodes
232 Node node = entry.getKey(); local
359 map.put(cleanUpIdReference(viewId), node); local
[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...] |
