| /external/swiftshader/third_party/subzero/src/ |
| IceLiveness.h | 14 /// The node-specific information tracked for each Variable includes whether it
72 Variable *getVariable(SizeT LiveIndex, const CfgNode *Node) const;
79 SizeT getNumVarsInNode(const CfgNode *Node) const {
80 return NumGlobals + Nodes[Node->getIndex()].NumLocals;
82 SizeT &getNumNonDeadPhis(const CfgNode *Node) {
83 return Nodes[Node->getIndex()].NumNonDeadPhis;
85 LivenessBV &getLiveIn(const CfgNode *Node) {
86 SizeT Index = Node->getIndex();
90 LivenessBV &getLiveOut(const CfgNode *Node) {
91 SizeT Index = Node->getIndex()
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| accumulate_n_optimizer.cc | 63 gtl::InlinedVector<Node*, 2> matches;
64 for (Node* n : g->op_nodes()) {
69 for (Node* n : matches) {
75 Status rewriteNode(Node* n, Graph* g) {
81 // The pieces of AccumulateNV2 should all be on the same node.
109 Node* create_accumulator = nullptr; // TemporaryVariable op
110 Node* initial_val = nullptr; // Const op
111 Node* initialize_accumulator = nullptr; // Assign op
112 std::vector<Node*> add_values_to_accumulator; // AssignAdd ops
113 Node* clean_up_accumulator = nullptr; // DestroyTemporaryVariabl
[all...] |
| /external/v8/src/ |
| splay-tree.h | 58 // true if a node was inserted, otherwise false. If found the locator
63 // otherwise false. If the node is found the locator is enabled and
81 // Move the node from one key to another.
84 // Remove the node with the given key from the tree.
92 // Perform the splay operation for the given key. Moves the node with
93 // the given key to the top of the tree. If no node has the given
94 // key, the last node on the search path is moved to the top of the
98 class Node {
100 Node(const Key& key, const Value& value)
117 Node* left() { return left_;
[all...] |
| splay-tree-inl.h | 27 // If the tree is empty, insert the new node.
28 root_ = new(allocator_) Node(key, Config::NoValue());
30 // Splay on the key to move the last node on the search path
39 // Insert the new node.
40 Node* node = new(allocator_) Node(key, Config::NoValue()); local
41 InsertInternal(cmp, node);
49 void SplayTree<Config, Allocator>::InsertInternal(int cmp, Node* node) {
281 Node* node = nodes_to_visit[pos++]; local
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Include/Library/ |
| DevicePathLib.h | 31 @retval FALSE The length of any node node in the DevicePath is less
35 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
46 Returns the Type field of a device path node.
48 Returns the Type field of the device path node specified by Node.
50 If Node is NULL, then ASSERT().
52 @param Node A pointer to a device path node data structure.
54 @return The Type field of the device path node specified by Node.
[all...] |
| /external/tensorflow/tensorflow/core/graph/ |
| graph_def_builder.h | 32 // Node* Identity(NodeOut input, const GraphDefBuilder::Options& opts) {
44 // Node* Identity(NodeOut input, const GraphDefBuilder::Options& opts) {
53 // Node* na = Const(7, b.opts());
55 // Node* nb = Const(5, b.opts().WithName("control-input"));
56 // Node* nc = Identity(na, b.opts().WithControlInput(nb));
68 // Options for adding a Node to a Graph.
81 Options WithControlInput(Node* control_input) const;
82 Options WithControlInputs(gtl::ArraySlice<Node*> control_inputs) const;
96 // Methods for using options from a function that creates a Node.
106 // Given the Op type name, return a name for a node of that type
[all...] |
| graph.cc | 52 // Node
57 const std::unordered_map<string, Node::NodeClass>& Node::kNodeClassTable =
58 *new std::unordered_map<string, Node::NodeClass>({
101 Node::NodeClass Node::GetNodeClassForOp(const string& ts) {
110 string Node::DebugString() const {
124 Node::Node()
132 void Node::Initialize(int id, int cost_id
419 Node* node = AllocateNode( local
644 const Node* node = FindNodeId(id); local
746 Node* node = nullptr; local
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeDAG.cpp | 64 /// reference to it in order to update as necessary on node deletion.
84 void LegalizeOp(SDNode *Node);
89 void LegalizeLoadOps(SDNode *Node);
90 void LegalizeStoreOps(SDNode *Node);
112 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
117 SDNode *Node, bool isSigned);
118 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
122 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
128 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
129 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results)
[all...] |
| /device/linaro/bootloader/edk2/ArmVirtPkg/FdtClientDxe/ |
| FdtClientDxe.c | 34 IN INT32 Node,
45 *Prop = fdt_getprop (mDeviceTreeBase, Node, PropertyName, &Len);
60 IN INT32 Node,
70 Ret = fdt_setprop (mDeviceTreeBase, Node, PropertyName, Prop, PropSize);
85 OUT INT32 *Node
93 ASSERT (Node != NULL);
107 // A 'compatible' node may contain a sequence of NUL terminated
113 *Node = Next;
127 OUT INT32 *Node
130 return FindNextCompatibleNode (This, CompatibleString, 0, Node);
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| DOMLocatorImpl.java | 25 import org.w3c.dom.Node;
57 /** related data node*/
58 private final Node fRelatedNode;
113 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri ){
121 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
123 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri, int utf16Offset ){
130 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
158 public Node getRelatedNode(){
|
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/changes/ |
| ListAdditionChange.java | 3 import com.github.javaparser.ast.Node;
13 private final Node nodeAdded;
15 public ListAdditionChange(ObservableProperty observableProperty, int index, Node nodeAdded) {
22 public Object getValue(ObservableProperty property, Node node) {
24 NodeList<Node> nodeList = new NodeList<>();
25 Object currentRawValue = new NoChange().getValue(property, node);
34 return new NoChange().getValue(property, node);
|
| /external/oj-libjdwp/make/src/classes/build/tools/jdwpgen/ |
| AbstractNamedNode.java | 31 abstract class AbstractNamedNode extends Node {
41 Iterator<Node> it = components.iterator();
44 Node nameNode = it.next();
67 for (Node node : components) {
68 node.document(writer);
93 for (Node node : components) {
94 node.genJava(writer, depth+1);
|
| /external/python/cpython3/Lib/lib2to3/fixes/ |
| fix_filter.py | 18 from ..pytree import Node
58 def transform(self, node, results):
59 if self.should_skip(node):
72 new = Node(syms.power, [new] + trailers, prefix="")
79 new = Node(syms.power, [new] + trailers, prefix="")
82 if in_special_context(node):
86 new = Node(syms.power, [Name("filter"), args], prefix="")
87 new = Node(syms.power, [Name("list"), ArgList([new])] + trailers)
89 new.prefix = node.prefix
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/ADT/ |
| AllocatorList.h | 36 struct Node : ilist_node<Node> {
37 Node(Node &&) = delete;
38 Node(const Node &) = delete;
39 Node &operator=(Node &&) = delete;
40 Node &operator=(const Node &) = delete
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
| CFG.h | 143 for (NodeT Node : RPOTraversal) {
144 Visited.insert(Node);
145 for (NodeT Succ : make_range(GT::child_begin(Node), GT::child_end(Node))) {
149 // We already visited Succ, thus Node->Succ must be a backedge. Check that
152 if (!isProperBackedge(Node, Succ))
|
| /external/v8/src/compiler/ |
| memory-optimizer.cc | 9 #include "src/compiler/node-matchers.h"
10 #include "src/compiler/node-properties.h"
11 #include "src/compiler/node.h"
35 VisitNode(token.node, token.state);
41 MemoryOptimizer::AllocationGroup::AllocationGroup(Node* node,
45 node_ids_.insert(node->id());
48 MemoryOptimizer::AllocationGroup::AllocationGroup(Node* node,
50 Node* size, Zone* zone
[all...] |
| js-native-context-specialization.cc | 17 #include "src/compiler/node-matchers.h"
78 Reduction JSNativeContextSpecialization::Reduce(Node* node) {
79 switch (node->opcode()) {
81 return ReduceJSAdd(node);
83 return ReduceJSGetSuperConstructor(node);
85 return ReduceJSInstanceOf(node);
87 return ReduceJSHasInPrototypeChain(node);
89 return ReduceJSOrdinaryHasInstance(node);
91 return ReduceJSPromiseResolve(node);
[all...] |
| code-assembler.h | 112 // Value type of a Turbofan node with two results.
291 class Node;
401 operator compiler::Node*() const { return node_; }
403 static TNode UncheckedCast(compiler::Node* node) { return TNode(node); }
406 explicit TNode(compiler::Node* node) : node_(node) {}
409 compiler::Node* node_
646 Node* node() const { return node_; } function in class:v8::internal::compiler::CodeAssembler::CheckedNode
[all...] |
| /external/cldr/tools/java/org/unicode/cldr/util/ |
| DiscreteComparator.java | 113 private Map<T, Node<T>> all;
124 all = order == Ordering.CHRONOLOGICAL ? new LinkedHashMap<T, Node<T>>()
125 : order == Ordering.NATURAL ? new TreeMap<T, Node<T>>()
126 : new HashMap<T, Node<T>>();
211 Node<T> aNode = all.get(a);
215 Node<T> bNode = all.get(b);
241 for (Node<T> subNode : all.values()) {
266 Collection<Node<T>> lesser = all.values();
268 for (Node<T> item : lesser) {
287 private void addLink(Node<T> aNode, Node<T> bNode)
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
| SimpleIListTest.cpp | 17 struct Node : ilist_node<Node> {};
18 bool operator<(const Node &L, const Node &R) { return &L < &R; }
19 bool makeFalse(const Node &, const Node &) { return false; }
21 struct deleteNode : std::default_delete<Node> {};
22 void doNothing(Node *) {}
25 simple_ilist<Node> L;
32 simple_ilist<Node> L
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
| nv50_ir_graph.cpp | 41 reinterpret_cast<Node *>(it->get())->cut();
44 void Graph::insert(Node *node)
47 root = node;
49 node->graph = this;
87 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind
354 Node *node = reinterpret_cast<Node *>(it->get()); local
367 Graph::Node *node; local
[all...] |
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/Dxe/EfiDriverLib/ |
| Perf.c | 284 Create a EFI_PERF_DATA_LIST data node.
294 Pointer to a data node created.
298 EFI_PERF_DATA_LIST *Node;
303 Node = EfiLibAllocateZeroPool (sizeof (EFI_PERF_DATA_LIST));
304 if (Node != NULL) {
306 Node->Signature = EFI_PERFORMANCE_DATA_SIGNATURE;
308 Node->GaugeData.Handle = Handle;
311 EfiStrCpy ((Node->GaugeData).Token, Token);
315 EfiStrCpy ((Node->GaugeData).Host, Host);
319 GetNameFromHandle (Handle, Node->GaugeData.PdbFileName);
[all...] |
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/BPF/ |
| BPFISelDAGToDAG.cpp | 79 // Node preprocessing cases
80 void PreprocessLoad(SDNode *Node, SelectionDAG::allnodes_iterator &I);
81 void PreprocessCopyToReg(SDNode *Node);
82 void PreprocessTrunc(SDNode *Node, SelectionDAG::allnodes_iterator &I);
94 bool getConstantFieldValue(const GlobalAddressSDNode *Node, uint64_t Offset,
126 // If the first operand is a FI, get the TargetFI Node
155 // If the first operand is a FI, get the TargetFI Node
188 void BPFDAGToDAGISel::Select(SDNode *Node) {
189 unsigned Opcode = Node->getOpcode();
191 // If we have a custom node, we already have selected
[all...] |
| /external/v8/src/builtins/ |
| builtins-internal-gen.cc | 38 Node* object = Parameter(Descriptor::kObject);
41 Node* source = LoadObjectField(object, JSObject::kElementsOffset);
42 Node* target = CloneFixedArray(source, ExtractFixedArrayFlag::kFixedArrays);
48 Node* object = Parameter(Descriptor::kObject);
49 Node* key = Parameter(Descriptor::kKey);
50 Node* context = Parameter(Descriptor::kContext);
53 Node* elements = LoadElements(object);
63 Node* object = Parameter(Descriptor::kObject);
64 Node* key = Parameter(Descriptor::kKey);
65 Node* context = Parameter(Descriptor::kContext)
[all...] |
| builtins-string-gen.cc | 17 typedef compiler::Node Node;
21 Node* StringBuiltinsAssembler::DirectStringData(Node* string,
22 Node* string_instance_type) {
57 Node* const lhs_instance_type, Node* const rhs_instance_type,
66 Node* const encoding_mask = Int32Constant(kStringEncodingMask);
67 Node* const lhs_encoding = Word32And(lhs_instance_type, encoding_mask);
68 Node* const rhs_encoding = Word32And(rhs_instance_type, encoding_mask)
[all...] |
