| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/ |
| AbstractConstruct.java | 19 import org.yaml.snakeyaml.nodes.Node;
31 * @see org.yaml.snakeyaml.constructor.Construct#construct2ndStep(org.yaml.snakeyaml.nodes.Node,
34 public void construct2ndStep(Node node, Object data) {
35 if (node.isTwoStepsConstruction()) {
38 throw new YAMLException("Unexpected recursive structure for Node: " + node);
|
| /external/tensorflow/tensorflow/core/graph/ |
| control_flow.h | 26 // Control flow info for a graph node.
28 const Node* frame = nullptr; // frame of a node
29 const Node* parent_frame = nullptr; // parent frame of a node
30 string frame_name; // frame name of a node
33 // Clear and populate `info` with each node's frame and the level it belongs to.
35 // 1) All inputs to a node must come from the same frame and have the same
37 // 2) Each frame has at most one LoopCond node.
40 // source node. We cannot build ControlFlowInfo for such nodes. They might b
[all...] |
| /external/v8/src/compiler/ |
| checkpoint-elimination.h | 25 Reduction Reduce(Node* node) final;
28 Reduction ReduceCheckpoint(Node* node);
|
| js-context-specialization.h | 50 Reduction Reduce(Node* node) final;
53 Reduction ReduceParameter(Node* node);
54 Reduction ReduceJSLoadContext(Node* node);
55 Reduction ReduceJSStoreContext(Node* node);
57 Reduction SimplifyJSStoreContext(Node* node, Node* new_context
[all...] |
| js-graph.h | 12 #include "src/compiler/node-properties.h"
38 Node* CEntryStubConstant(int result_size,
44 Node* PaddingConstant() { return TheHoleConstant(); }
47 Node* NoContextConstant() { return ZeroConstant(); }
49 // Creates a HeapConstant node, possibly canonicalized, and may access the
51 Node* HeapConstant(Handle<HeapObject> value);
53 // Creates a Constant node of the appropriate type for the given object.
56 Node* Constant(Handle<Object> value);
59 Node* Constant(const ObjectRef& value);
61 // Creates a NumberConstant node, usually canonicalized
[all...] |
| js-generic-lowering.h | 31 Reduction Reduce(Node* node) final;
34 #define DECLARE_LOWER(x) void Lower##x(Node* node);
40 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags);
41 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags,
43 void ReplaceWithRuntimeCall(Node* node, Runtime::FunctionId f, int args = -1)
[all...] |
| js-intrinsic-lowering.cc | 13 #include "src/compiler/node-matchers.h"
14 #include "src/compiler/node-properties.h"
27 Reduction JSIntrinsicLowering::Reduce(Node* node) {
28 if (node->opcode() != IrOpcode::kJSCallRuntime) return NoChange();
30 Runtime::FunctionForId(CallRuntimeParametersOf(node->op()).id());
34 return ReduceCreateIterResultObject(node);
36 return ReduceDebugIsActive(node);
38 return ReduceDeoptimizeNow(node);
40 return ReduceGeneratorClose(node);
[all...] |
| branch-elimination.cc | 8 #include "src/compiler/node-properties.h"
27 Reduction BranchElimination::Reduce(Node* node) {
28 switch (node->opcode()) {
33 return ReduceDeoptimizeConditional(node);
35 return ReduceMerge(node);
37 return ReduceLoop(node);
39 return ReduceBranch(node);
41 return ReduceIf(node, false);
43 return ReduceIf(node, true)
[all...] |
| instruction-selector.h | 15 #include "src/compiler/node.h"
60 Node* frame_state) {
68 VectorSlotPair const& feedback, Node* frame_state) {
74 static FlagsContinuation ForSet(FlagsCondition condition, Node* result) {
80 Node* result) {
113 Node* frame_state() const {
117 Node* result() const {
195 VectorSlotPair const& feedback, Node* frame_state)
206 FlagsContinuation(FlagsCondition condition, Node* result)
213 FlagsContinuation(FlagsCondition condition, TrapId trap_id, Node* result
240 Node* node; member in struct:v8::internal::compiler::PushParameter
[all...] |
| /device/linaro/bootloader/edk2/StdLib/LibC/Uefi/Devices/Utility/ |
| DevGenisis.c | 110 DeviceNode *Node;
121 Node = (DeviceNode *)AllocateZeroPool(sizeof(DeviceNode));
122 if(Node == NULL) {
127 Node->DevName = DevName;
128 Node->DevProto = DevProto;
129 Node->InstanceList = InstanceList;
130 Node->OpenFunc = OpenFunc;
131 Node->InstanceSize = InstanceSize;
132 Node->NumInstances = NumInstance;
133 Node->OpModes = Modes;
[all...] |
| /external/swiftshader/third_party/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, MachineInstr *MI,
57 /// of the specified node.
71 /// specifies the instruction information for the node, and IIOpNum is the
88 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap,
95 void EmitCopyToRegClassNode(SDNode *Node,
100 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap
[all...] |
| /external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ |
| HasParentNode.java | 24 import com.github.javaparser.ast.Node;
30 * An object that has a parent node.
35 * Return the parent node or null, if no parent is set.
37 Optional<Node> getParentNode();
40 * Set the parent node.
42 * @param parentNode the parent node or null, to set no parent
45 T setParentNode(Node parentNode);
50 Node getParentNodeForChildren();
53 * Get the ancestor of the node having the given type, or null if no ancestor of the given type is found.
56 Node parent = getParentNode().orElse(null)
[all...] |
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/comments/ |
| Comment.java | 25 import com.github.javaparser.ast.Node;
35 public abstract class Comment extends Node {
38 private Node commentedNode;
85 public Node getCommentedNode()
90 public Comment setCommentedNode(Node commentedNode)
|
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ast/comments/ |
| Comment.java | 24 import com.github.javaparser.ast.Node;
34 public abstract class Comment extends Node {
37 private Node commentedNode;
85 public Node getCommentedNode()
90 public void setCommentedNode(Node commentedNode)
|
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| SequenceNode.java | 29 final private List<Node> value;
31 public SequenceNode(Tag tag, boolean resolved, List<Node> value, Mark startMark, Mark endMark,
35 throw new NullPointerException("value in a Node is required.");
41 public SequenceNode(Tag tag, List<Node> value, Boolean flowStyle) {
55 public List<Node> getValue() {
60 for (Node node : value) {
61 node.setType(listType);
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Nios2/ |
| Nios2ISelDAGToDAG.cpp | 60 void Nios2DAGToDAGISel::Select(SDNode *Node) {
62 // If we have a custom node, we already have selected!
63 if (Node->isMachineOpcode()) {
64 LLVM_DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
65 Node->setNodeId(-1);
70 SelectCode(Node);
|
| /external/tensorflow/tensorflow/core/kernels/hexagon/ |
| graph_transferer.h | 108 void CacheNode(const Node& node);
110 bool AreAllInputsCached(const Node& node) const;
112 // Transform a remote fused graph to add an aggregated input node which takes
120 const ShapeRefiner& shape_refiner, const Node& node,
125 const Node& node);
134 bool HasPaddingAndStrides(const Node& node)
[all...] |
| /external/v8/src/builtins/ |
| builtins-async-generator-gen.cc | 16 using compiler::Node;
32 inline Node* TaggedIsAsyncGenerator(Node* tagged_object) {
41 inline Node* LoadGeneratorState(Node* const generator) {
48 inline TNode<BoolT> IsGeneratorClosed(Node* const generator) {
56 inline TNode<BoolT> IsGeneratorSuspended(Node* const generator) {
70 inline TNode<BoolT> IsGeneratorNotExecuting(Node* const generator) {
74 inline TNode<BoolT> IsGeneratorAwaiting(Node* const generator) {
80 inline void SetGeneratorAwaiting(Node* const generator)
[all...] |
| builtins-generator-gen.cc | 22 void GeneratorPrototypeResume(CodeStubArguments* args, Node* receiver,
23 Node* value, Node* context,
29 CodeStubArguments* args, Node* receiver, Node* value, Node* context,
53 Node* result = CallStub(CodeFactory::ResumeGenerator(isolate()), context,
85 Node* result = nullptr;
118 Node* argc =
122 Node* receiver = args.GetReceiver()
[all...] |
| /external/google-fruit/include/fruit/impl/meta/ |
| graph.h | 29 // A Graph is a Map from each node to a set containing its neighbors.
44 // DfsVisit(VisitedSet, VisitingSet, Node) does a DFS visit starting at Node and returns a
46 // of the loop starting at Node (if any loop was found) or Null otherwise.
48 template <typename VisitedSet, typename VisitingSet, typename Node>
50 using NewVisitingSet = AddToSetUnchecked(VisitingSet, Node);
60 // Found a loop in another neighbor of the same node, we don't need to
66 using NewVisitedSet = AddToSet(VisitedSet, Node);
67 using Neighbors = GraphFindNeighbors(ImmutableG, Node);
72 If(IsInSet(Node, VisitingSet)
[all...] |
| /external/libchrome/base/sampling_heap_profiler/ |
| lock_free_address_hash_set.cc | 21 Node* node = reinterpret_cast<Node*>(bucket); local
22 while (node) {
23 Node* next = reinterpret_cast<Node*>(node->next);
24 delete node;
25 node = next;
37 Node* node = reinterpret_cast<Node*>(subtle::NoBarrier_Load(bucket_ptr)) local
[all...] |
| /external/v8/src/compiler/ppc/ |
| instruction-selector-ppc.cc | 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
32 InstructionOperand UseOperand(Node* node, ImmediateMode mode) {
33 if (CanBeImmediate(node, mode)) {
34 return UseImmediate(node);
36 return UseRegister(node);
39 bool CanBeImmediate(Node* node, ImmediateMode mode) {
41 if (node->opcode() == IrOpcode::kInt32Constant
1632 Node* const node = value->InputAt(0); local
[all...] |
| /external/v8/src/ic/ |
| binary-op-assembler.cc | 12 using compiler::Node;
14 Node* BinaryOpAssembler::Generate_AddWithFeedback(Node* context, Node* lhs,
15 Node* rhs, Node* slot_id,
16 Node* feedback_vector,
117 Node* value = Float64Add(var_fadd_lhs.value(), var_fadd_rhs.value());
118 Node* result = AllocateHeapNumberWithValue(value);
127 Node* lhs_instance_type = LoadInstanceType(lhs)
[all...] |
| /external/zopfli/src/zopfli/ |
| katajainen.c | 30 typedef struct Node Node;
35 struct Node {
37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */
46 Node* nodes; /* The pool. */
47 Node* next; /* Pointer to a possibly free node in the pool. */
52 Initializes a chain node with the given values and marks it as in use.
54 static void InitNode(size_t weight, int count, Node* tail, Node* node)
77 Node* node; local
164 Node* node; local
[all...] |
| /external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/ |
| PositionUtils.java | 24 import com.github.javaparser.ast.Node;
45 public static <T extends Node> void sortByBeginPosition(List<T> nodes){
49 public static <T extends Node> void sortByBeginPosition(List<T> nodes, final boolean ignoringAnnotations){
50 Collections.sort(nodes, new Comparator<Node>() {
52 public int compare(Node o1, Node o2) {
58 public static boolean areInOrder(Node a, Node b){
62 public static boolean areInOrder(Node a, Node b, boolean ignoringAnnotations)
[all...] |
