| /external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
| SDNodeOrdering.h | 36 void add(const SDNode *Node, unsigned O) {
37 OrderMap[Node] = O;
39 void remove(const SDNode *Node) {
40 DenseMap<const SDNode*, unsigned>::iterator Itr = OrderMap.find(Node);
47 unsigned getOrder(const SDNode *Node) {
48 return OrderMap[Node];
|
| ScheduleDAGSDNodes.h | 50 /// isPassiveNode - Return true if the node is a non-scheduled leaf.
52 static bool isPassiveNode(SDNode *Node) {
53 if (isa<ConstantSDNode>(Node)) return true;
54 if (isa<ConstantFPSDNode>(Node)) return true;
55 if (isa<RegisterSDNode>(Node)) return true;
56 if (isa<GlobalAddressSDNode>(Node)) return true;
57 if (isa<BasicBlockSDNode>(Node)) return true;
58 if (isa<FrameIndexSDNode>(Node)) return true;
59 if (isa<ConstantPoolSDNode>(Node)) return true;
60 if (isa<JumpTableSDNode>(Node)) return true
[all...] |
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| functionalize_control_flow_util.h | 27 // Check that the graph has no cycle containing the given node.
28 Status CheckNodeNotInCycle(const Node* node, const int num_nodes);
34 bool operator()(const Node* lhs, const Node* rhs) const;
37 // Returns the Node* created from the NodeDef in the Graph.
38 xla::StatusOr<Node*> AddNodeDefToGraph(const NodeDef& node_def, Graph* graph);
40 // Build a retval node of given type and index.
41 xla::StatusOr<Node*> BuildRetvalNode(Graph* graph, DataType type, int index);
48 [](string* output, const Node* node)
[all...] |
| /external/v8/src/builtins/ |
| builtins-handler-gen.cc | 16 Node* string = Parameter(Descriptor::kReceiver);
21 Node* value = Parameter(Descriptor::kReceiver);
22 Node* string = LoadJSValueValue(value);
27 Node* receiver = Parameter(Descriptor::kReceiver);
28 Node* name = Parameter(Descriptor::kName);
29 Node* context = Parameter(Descriptor::kContext);
45 Node* receiver = Parameter(Descriptor::kReceiver);
46 Node* name = Parameter(Descriptor::kName);
47 Node* value = Parameter(Descriptor::kValue);
48 Node* slot = Parameter(Descriptor::kSlot)
[all...] |
| builtins-array-gen.h | 20 typedef std::function<Node*(ArrayBuiltinsAssembler* masm, Node* k_value,
21 Node* k)>
30 Node* FindProcessor(Node* k_value, Node* k);
34 Node* FindIndexProcessor(Node* k_value, Node* k);
38 Node* ForEachProcessor(Node* k_value, Node* k)
[all...] |
| builtins-reflect-gen.cc | 14 Node* target = Parameter(Descriptor::kTarget);
15 Node* key = Parameter(Descriptor::kKey);
16 Node* context = Parameter(Descriptor::kContext);
|
| builtins-async-function-gen.cc | 21 void AsyncFunctionAwait(Node* const context, Node* const generator,
22 Node* const awaited, Node* const outer_promise,
24 void AsyncFunctionAwaitOptimized(Node* const context, Node* const generator,
25 Node* const awaited,
26 Node* const outer_promise,
30 Node* const context, Node* const sent_value
[all...] |
| /external/v8/src/compiler/ |
| redundancy-elimination.h | 21 Reduction Reduce(Node* node) final;
25 Check(Node* node, Check* next) : node(node), next(next) {}
26 Node* node; member in struct:v8::internal::compiler::final::Check
37 EffectPathChecks const* AddCheck(Zone* zone, Node* node) const
[all...] |
| state-values-utils.h | 26 Node* GetNodeForValues(Node** values, size_t count,
32 typedef std::array<Node*, kMaxInputCount> WorkingBuffer;
35 Node* node; member in struct:v8::internal::compiler::StateValuesCache::NodeKey
37 explicit NodeKey(Node* node) : node(node) {}
41 // ValueArray - array of nodes ({node} has to be nullptr)
87 Node* node; member in struct:v8::internal::compiler::StateValuesAccess::TypedNode
[all...] |
| machine-graph.h | 9 #include "src/compiler/common-node-cache.h"
29 // Creates a Int32Constant node, usually canonicalized.
30 Node* Int32Constant(int32_t value);
31 Node* Uint32Constant(uint32_t value) {
35 // Creates a Int64Constant node, usually canonicalized.
36 Node* Int64Constant(int64_t value);
37 Node* Uint64Constant(uint64_t value) {
41 // Creates a Int32Constant/Int64Constant node, depending on the word size of
45 Node* IntPtrConstant(intptr_t value);
47 Node* RelocatableInt32Constant(int32_t value, RelocInfo::Mode rmode)
[all...] |
| diamond.h | 10 #include "src/compiler/node.h"
20 Node* branch;
21 Node* if_true;
22 Node* if_false;
23 Node* merge;
25 Diamond(Graph* g, CommonOperatorBuilder* b, Node* cond,
39 void Chain(Node* that) { branch->ReplaceInput(1, that); }
52 Node* Phi(MachineRepresentation rep, Node* tv, Node* fv)
[all...] |
| /art/tools/ahat/src/main/com/android/ahat/dominators/ |
| DominatorsComputation.java | 25 * that implements the {@link DominatorsComputation.Node} interface and has
26 * some root node with no incoming edges.
38 * structures that implement this <code>Node</code> interface. To use the
42 * <li>Efficiently mapping from node to associated internal dominators
46 * <li>Iterating over all outgoing edges of an node using the
48 * <li>Setting the computed dominator for a node using the
52 public interface Node {
54 * Associates the given dominator state with this node. Subsequent calls to
56 * this node should return the state given here. At the conclusion of the
58 * each node with <code>state</code> set to null
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| DTMNodeListBase.java | 22 import org.w3c.dom.Node;
66 * @return The node at the <code>index</code>th position in the
70 public Node item(int index) {
75 * The number of nodes in the list. The range of valid child node indices
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| DOMSerializer.java | 25 import org.w3c.dom.Node;
65 * Serializes the DOM node. Throws an exception only if an I/O
70 * @param node the DOM node to serialize
73 public void serialize(Node node) throws IOException;
|
| TransformStateSetter.java | 25 import org.w3c.dom.Node;
43 * Set the current node.
45 * @param n The current node.
47 void setCurrentNode(Node n);
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/nodeTypes/modifiers/ |
| NodeWithAccessModifiers.java | 3 import com.github.javaparser.ast.Node;
6 * A node that can be public, protected, and/or private.
8 public interface NodeWithAccessModifiers<N extends Node> extends NodeWithPublicModifier<N>, NodeWithPrivateModifier<N>, NodeWithProtectedModifier<N> {
|
| /external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
| AbstractSimpleNode.java | 31 abstract class AbstractSimpleNode extends Node {
35 components = new ArrayList<Node>();
|
| /external/swiftshader/third_party/LLVM/unittests/ADT/ |
| ilistTest.cpp | 19 struct Node : ilist_node<Node> {
22 Node() {}
23 Node(int _Value) : Value(_Value) {}
27 ilist<Node> List;
28 List.push_back(Node(1));
33 List.push_back(Node(2));
38 const ilist<Node> &ConstList = List;
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/vectorization/ |
| wrapped_tensor.h | 26 Node* const node; member in struct:tensorflow::grappler::WrappedTensor
37 WrappedTensor(Node* node, int output_index, bool stacked)
38 : node(node), output_index(output_index), stacked(stacked) {}
|
| /external/testng/src/main/java/org/testng/xml/dom/ |
| ITagSetter.java | 3 import org.w3c.dom.Node;
6 void setProperty(String name, T parent, Node node);
|
| /external/clang/test/CodeGenCXX/ |
| constructor-template.cpp | 28 template <typename T> class Node {
31 Node(){ } // Node<BinomialNode<int>*>::Node() remains undefined.
32 ~Node() {}
36 template<typename T> class BinomialNode : Node<BinomialNode<T>*> {
44 BinomialNode<int> *node = new BinomialNode<int>(1); local
45 delete node;
|
| /device/linaro/bootloader/edk2/MdeModulePkg/Bus/Pci/PciBusDxe/ |
| PciDriverOverride.c | 57 PCI_DRIVER_OVERRIDE_LIST *Node;
65 Node = DRIVER_OVERRIDE_FROM_LINK (CurrentLink);
69 *DriverImageHandle = Node->DriverImageHandle;
73 if (*DriverImageHandle == Node->DriverImageHandle) {
81 // Get next node
83 Node = DRIVER_OVERRIDE_FROM_LINK (CurrentLink->ForwardLink);
84 *DriverImageHandle = Node->DriverImageHandle;
114 PCI_DRIVER_OVERRIDE_LIST *Node;
121 Node = AllocatePool (sizeof (PCI_DRIVER_OVERRIDE_LIST));
122 if (Node == NULL) {
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/visitor/ |
| TreeVisitor.java | 24 import com.github.javaparser.ast.Node;
31 * Iterate over all the nodes in (a part of) the AST. In contrast to the visit methods in Node, these methods are
37 public void visitLeavesFirst(Node node) {
38 for (Node child : node.getChildNodes()) {
41 process(node);
45 * Performs a pre-order node traversal starting with a given node. When each node is visited, {@link #process(Node)
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.h | 31 #define ITER_NODE(x) reinterpret_cast<Graph::Node *>((x).get())
38 class Node;
53 Edge(Node *dst, Node *src, Type kind);
56 inline Node *getOrigin() const { return origin; }
57 inline Node *getTarget() const { return target; }
63 Node *origin;
64 Node *target;
93 inline Node *getNode() const { assert(e); return d ?
105 class Node
[all...] |
| /device/linaro/bootloader/edk2/ShellPkg/Application/Shell/ |
| ShellEnvVar.c | 98 ENV_VAR_LIST *Node;
105 for ( Node = (ENV_VAR_LIST*)GetFirstNode(List)
107 ; Node = (ENV_VAR_LIST*)GetFirstNode(List)
109 ASSERT(Node != NULL);
110 RemoveEntryList(&Node->Link);
111 if (Node->Key != NULL) {
112 FreePool(Node->Key);
114 if (Node->Val != NULL) {
115 FreePool(Node->Val);
117 FreePool(Node);
[all...] |
