/external/tensorflow/tensorflow/core/graph/ |
graph.h | 23 // should be the only node that doesn't depend on anything, and the sink 24 // should be the only node that nothing depends on. 26 // Note: Node ids are intended to be relatively dense in the 61 class Node; 70 class Node { 80 // of this Node may have changed due to placement, optimization, etc. 109 // This gives the device the runtime has assigned this node to. If 113 // TODO(josh11b): Move assigned_device_name outside of Node into a 123 // Sets 'original_node_names' field of this node's DebugInfo proto to 133 // Get the neighboring nodes via edges either in or out of this node. Thi 316 Node* node; member in struct:tensorflow::InputTensor 337 Node* node; member in struct:tensorflow::OutputTensor [all...] |
/external/v8/src/compiler/ |
js-type-hint-lowering.cc | 52 const Operator* op, Node* left, Node* right, 53 Node* effect, Node* control, FeedbackSlot slot) 160 Node* BuildSpeculativeOperation(const Operator* op) { 171 Node* TryBuildNumberBinop() { 175 Node* node = BuildSpeculativeOperation(op); local 176 return node; 181 Node* TryBuildNumberCompare() 185 Node* node = BuildSpeculativeOperation(op); local 229 Node* node; local 395 Node* node = jsgraph()->graph()->NewNode( local [all...] |
js-call-reducer.cc | 18 #include "src/compiler/node-matchers.h" 34 Reduction JSCallReducer::ReduceMathUnary(Node* node, const Operator* op) { 35 CallParameters const& p = CallParametersOf(node->op()); 39 if (node->op()->ValueInputCount() < 3) { 40 Node* value = jsgraph()->NaNConstant(); 41 ReplaceWithValue(node, value); 45 Node* effect = NodeProperties::GetEffectInput(node); 46 Node* control = NodeProperties::GetControlInput(node) [all...] |
/external/clang/include/clang/ASTMatchers/ |
ASTMatchers.h | 34 // where "child" is bound to the RecordDecl node of the matching child 63 /// The bound nodes are generated by calling \c bind("id") on the node matchers 70 /// \brief Returns the AST node bound to \c ID. 72 /// Returns NULL if there was no node bound to \c ID or if there is a node but 111 /// \brief If the provided matcher matches a node, binds the node to \c ID. 131 /// \brief Matches any node. 213 SourceManager.getExpansionLoc(Node.getLocStart())); 233 auto ExpansionLoc = SourceManager.getExpansionLoc(Node.getLocStart()) [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
InstrEmitter.h | 39 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an 41 void EmitCopyFromReg(SDNode *Node, unsigned ResNo, 47 /// node is a CopyToReg, return its destination register. Return 0 otherwise. 48 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node, 51 void CreateVirtualRegisters(SDNode *Node, 58 /// of the specified node. 73 /// specifies the instruction information for the node, and IIOpNum is the 91 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap, 98 void EmitCopyToRegClassNode(SDNode *Node, 103 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/SelectionDAG/ |
InstrEmitter.h | 39 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an 41 void EmitCopyFromReg(SDNode *Node, unsigned ResNo, 47 /// node is a CopyToReg, return its destination register. Return 0 otherwise. 48 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node, 51 void CreateVirtualRegisters(SDNode *Node, 58 /// of the specified node. 73 /// specifies the instruction information for the node, and IIOpNum is the 91 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap, 98 void EmitCopyToRegClassNode(SDNode *Node, 103 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap [all...] |
/development/samples/IntentPlayground/src/com/example/android/intentplayground/ |
Node.java | 29 * This class represents a node in the tree of tasks. It can either represent a task 32 public class Node implements Parcelable, Comparable<Node> { 36 public List<Node> mChildren = new LinkedList<>(); 45 Node(ComponentName data) { 51 * Create a task Node. 54 Node(int taskId) { 60 * Creates a Node with the same data as the parameter (copy constructor). 61 * @param other Node to copy over. 63 Node(Node other) [all...] |
/external/tensorflow/tensorflow/core/framework/ |
model.h | 88 // Abstract representation of a TensorFlow input pipeline node. It collects 89 // information about inputs to this node, processing time spent executing the 90 // node logic, number of elements produced by the node, various other 107 class Node { 109 // Arguments for `Node` constructor. 113 std::shared_ptr<Node> output; 116 using Factory = std::function<std::shared_ptr<Node>(Args)>; 118 explicit Node(Args args) 128 void add_input(std::shared_ptr<Node> node) LOCKS_EXCLUDED(mu_) [all...] |
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EdkIIGlueLib/Library/DxePerformanceLib/ |
PerformanceLib.c | 295 Create a EFI_PERF_DATA_LIST data node.
305 Pointer to a data node created.
309 EFI_PERF_DATA_LIST *Node;
314 Node = AllocateZeroPool (sizeof (EFI_PERF_DATA_LIST));
315 if (Node != NULL) {
317 Node->Signature = EFI_PERFORMANCE_DATA_SIGNATURE;
319 Node->GaugeData.Handle = Handle;
322 StrCpy ((Node->GaugeData).Token, Token);
326 StrCpy ((Node->GaugeData).Host, Host);
330 GetNameFromHandle (Handle, Node->GaugeData.PdbFileName); [all...] |
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/ |
Node.java | 34 * Each Node can have one associated comment which describe it and 40 public abstract class Node implements Cloneable { 50 private Node parentNode; 52 private List<Node> childrenNodes = new LinkedList<Node>(); 62 public Node() { 65 public Node(final int beginLine, final int beginColumn, final int endLine, final int endColumn) { 100 * Return the begin column of this node. 102 * @return the begin column of this node 109 * Return the begin line of this node [all...] |
/external/apache-xml/src/main/java/org/apache/xpath/jaxp/ |
JAXPPrefixResolver.java | 22 import org.w3c.dom.Node; 77 * Given a prefix and a Context Node, get the corresponding namespace. 79 * is an attribute node. 81 * @param namespaceContext Node from which to start searching for a 87 org.w3c.dom.Node namespaceContext) { 88 Node parent = namespaceContext; 97 && (((type = parent.getNodeType()) == Node.ELEMENT_NODE) 98 || (type == Node.ENTITY_REFERENCE_NODE))) { 100 if (type == Node.ELEMENT_NODE) { 104 Node attr = nnm.item(i) [all...] |
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/ |
PhantomNodeLogic.java | 24 import com.github.javaparser.ast.Node; 41 private static final Map<Node, Boolean> isPhantomNodeCache = synchronizedMap(new IdentityHashMap<>()); 45 public void parentChange(Node observedNode, Node previousParent, Node newParent) { 50 static boolean isPhantomNode(Node node) { 51 if (isPhantomNodeCache.containsKey(node)) { 52 return isPhantomNodeCache.get(node); 54 if (node instanceof UnknownType) [all...] |
/external/llvm/lib/CodeGen/ |
ScheduleDAGPrinter.cpp | 41 static bool isNodeHidden(const SUnit *Node) { 42 return (Node->NumPreds > 10 || Node->NumSuccs > 10); 45 static std::string getNodeIdentifierLabel(const SUnit *Node, 49 OS << static_cast<const void *>(Node); 55 static std::string getEdgeAttributes(const SUnit *Node, 66 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
|
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/ |
AbstractConstructTest.java | 20 import org.yaml.snakeyaml.nodes.Node; 30 public Object construct(Node node) { 34 Node node = new SequenceNode(Tag.SEQ, true, new ArrayList<Node>(), null, null, false); local 36 abstractConstruct.construct2ndStep(node, ""); 39 assertEquals("Unexpected recursive structure for Node: <org.yaml.snakeyaml.nodes.SequenceNode (tag=tag:yaml.org,2002:seq, value=[])>", e.getMessage()); 46 public Object construct(Node node) { 50 Node node = new SequenceNode(Tag.SEQ, true, new ArrayList<Node>(), null, null, false); local [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/ |
IListSentinelTest.cpp | 23 class Node : public ilist_node<Node> {}; 24 class TrackingNode : public ilist_node<Node, ilist_sentinel_tracking<true>> {}; 25 typedef PickSentinel<Node>::type Sentinel; 26 typedef PickSentinel<Node, ilist_sentinel_tracking<true>>::type 28 typedef PickSentinel<Node, ilist_sentinel_tracking<false>>::type 54 Node N;
|
/device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
BaseOrderedCollectionRedBlackTreeLib.c | 60 Retrieve the user structure linked by the specified tree node.
64 @param[in] Node Pointer to the tree node whose associated user structure we
68 @return Pointer to user structure linked by Node.
73 IN CONST RED_BLACK_TREE_NODE *Node
76 return Node->UserStruct;
185 Look up the tree node that links the user structure that matches the
198 @return The tree node that links to the user structure matching
208 RED_BLACK_TREE_NODE *Node;
210 Node = Tree->Root; [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/Analysis/ |
LazyCallGraph.h | 114 class Node; 132 /// edges. The edges are stored in the source node and point at the target 133 /// node. This allows the edge structure itself to be a very compact data 141 explicit Edge(Node &N, Kind K); 157 /// Get the call graph node referenced by this edge. 160 Node &getNode() const; 171 PointerIntPair<Node *, 1, Kind> Value; 178 /// This typically exists entirely within the node but is exposed as 179 /// a separate type because a node doesn't initially have edges. An explicit 181 /// then cached in the node. It is also used to represent edges entering th [all...] |
/device/linaro/bootloader/edk2/MdePkg/Library/UefiDevicePathLib/ |
DevicePathUtilities.c | 3 nodes. The device path is terminated by an end node that is length
25 // Template for an end-of-device path node.
44 @retval FALSE The length of any node node in the DevicePath is less
48 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
69 // Validate the input size big enough to touch the first node.
87 // Validate next node before touch it.
102 // Only return TRUE when the End Device Path node is valid.
109 Returns the Type field of a device path node.
111 Returns the Type field of the device path node specified by Node. [all...] |
/external/llvm/include/llvm/CodeGen/ |
MachinePassRegistry.h | 47 /// MachinePassRegistryNode - Machine pass node stored in registration list. 107 void Add(MachinePassRegistryNode *Node); 111 void Remove(MachinePassRegistryNode *Node); 133 for (RegistryClass *Node = RegistryClass::getList(); 134 Node; Node = Node->getNext()) { 135 this->addLiteralOption(Node->getName(), 136 (typename RegistryClass::FunctionPassCtor)Node->getCtor(), 137 Node->getDescription()) [all...] |
/external/llvm/include/llvm/Support/ |
GraphWriter.h | 37 /// \brief Get a color string for this node number. Simply round-robin selects 67 // Writes the edge labels of the node to O and returns true if there are any 69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { 70 child_iterator EI = GTraits::child_begin(Node); 71 child_iterator EE = GTraits::child_end(Node); 75 std::string label = DTraits.getEdgeSourceLabel(Node, EI); 147 bool isNodeHidden(NodeType &Node) { 148 return isNodeHidden(&Node); 151 bool isNodeHidden(NodeType *const *Node) { 152 return isNodeHidden(*Node); [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
MachinePassRegistry.h | 46 /// MachinePassRegistryNode - Machine pass node stored in registration list. 105 void Add(MachinePassRegistryNode *Node); 109 void Remove(MachinePassRegistryNode *Node); 130 for (RegistryClass *Node = RegistryClass::getList(); 131 Node; Node = Node->getNext()) { 132 this->addLiteralOption(Node->getName(), 133 (typename RegistryClass::FunctionPassCtor)Node->getCtor(), 134 Node->getDescription()) [all...] |
/external/swiftshader/third_party/LLVM/include/llvm/Support/ |
GraphWriter.h | 63 // Writes the edge labels of the node to O and returns true if there are any 65 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) { 66 child_iterator EI = GTraits::child_begin(Node); 67 child_iterator EE = GTraits::child_end(Node); 71 std::string label = DTraits.getEdgeSourceLabel(Node, EI); 143 bool isNodeHidden(NodeType &Node) { 144 return isNodeHidden(&Node); 147 bool isNodeHidden(NodeType *const *Node) { 148 return isNodeHidden(*Node); 151 bool isNodeHidden(NodeType *Node) { [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
MachinePassRegistry.h | 48 /// MachinePassRegistryNode - Machine pass node stored in registration list. 96 void Add(MachinePassRegistryNode *Node); 100 void Remove(MachinePassRegistryNode *Node); 120 for (RegistryClass *Node = RegistryClass::getList(); 121 Node; Node = Node->getNext()) { 122 this->addLiteralOption(Node->getName(), 123 (typename RegistryClass::FunctionPassCtor)Node->getCtor(), 124 Node->getDescription()) [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/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/validator/ |
SingleNodeTypeValidator.java | 3 import com.github.javaparser.ast.Node; 8 public class SingleNodeTypeValidator<N extends Node> implements Validator { 18 public void accept(Node node, ProblemReporter problemReporter) { 19 if (type.isInstance(node)) { 20 validator.accept(type.cast(node), problemReporter); 22 node.findAll(type).forEach(n -> validator.accept(n, problemReporter));
|