Searched refs:Node (Results 651 - 675 of 1945) sorted by relevance

<<21222324252627282930>>

/external/v8/src/builtins/
H A Dbuiltins-function.cc277 using compiler::Node;
284 Node* argc = assembler.Parameter(BuiltinDescriptor::kArgumentsCount);
285 Node* context = assembler.Parameter(BuiltinDescriptor::kContext);
286 Node* new_target = assembler.Parameter(BuiltinDescriptor::kNewTarget);
291 Node* receiver = args.GetReceiver();
294 Node* receiver_map = assembler.LoadMap(receiver);
295 Node* instance_type = assembler.LoadMapInstanceType(receiver_map);
310 Node* descriptors = assembler.LoadMapDescriptors(receiver_map);
311 Node* descriptors_length = assembler.LoadFixedArrayBaseLength(descriptors);
321 Node* maybe_lengt
[all...]
/external/v8/src/compiler/
H A Dloop-analysis.cc23 Node* node;
30 Node* header;
108 Node* end_;
125 bool PropagateBackwardMarks(Node* from, Node* to, int loop_filter) {
141 bool SetBackwardMark(Node* to, int loop_num) {
150 bool SetForwardMark(Node* to, int loop_num) {
159 bool PropagateForwardMarks(Node* from, Node* to) {
174 bool IsInLoop(Node* nod
[all...]
/external/doclava/src/com/google/doclava/
H A DSampleCode.java75 * @return A root Node for the project containing its metadata and tree structure.
77 public Node setSamplesTOC(boolean offlineMode) {
78 List<Node> filelist = new ArrayList<Node>();
91 Node rootNode = writeSampleIndexCs(hdf, f,
92 new Node.Builder().setLabel(mProjectDir).setLink(link).setChildren(filelist).build(),false);
105 List<Node> filelist = new ArrayList<Node>();
126 //Write root _index.jd to out and add metadata to Node.
128 new Node
586 public static class Node { class in class:SampleCode
593 private Node(Builder builder) { method in class:SampleCode.Node
[all...]
/external/v8/src/compiler/arm64/
H A Dinstruction-selector-arm64.cc33 InstructionOperand UseOperand(Node* node, ImmediateMode mode) {
42 InstructionOperand UseRegisterOrImmediateZero(Node* node) {
53 InstructionOperand UseImmediateOrTemp(Node* node, int32_t value) {
60 bool IsIntegerConstant(Node* node) {
65 int64_t GetIntegerConstantValue(Node* node) {
73 bool IsFloatConstant(Node* node) {
78 double GetFloatConstantValue(Node* node) {
86 bool CanBeImmediate(Node* node, ImmediateMode mode) {
124 bool CanBeLoadStoreShiftImmediate(Node* node, MachineRepresentation rep) {
141 void VisitRR(InstructionSelector* selector, ArchOpcode opcode, Node* nod
[all...]
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_src/proper_source/com/github/javaparser/
H A DJavaParser.java31 import com.github.javaparser.ast.Node;
314 List<Node> children = cu.getChildrenNodes();
325 private static boolean attributeLineCommentToNodeOrChild(Node node, LineComment lineComment)
336 List<Node> children = new LinkedList<Node>();
341 for (Node child : children)
357 private static void insertCommentsInNode(Node node, List<Comment> commentsToAttribute){
365 List<Node> children = node.getChildrenNodes();
368 for (Node child : children){
386 for (Node chil
[all...]
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/expr/
H A DSimpleName.java24 import com.github.javaparser.ast.Node;
43 public final class SimpleName extends Node implements NodeWithIdentifier<SimpleName> {
97 public boolean remove(Node node) {
121 public boolean replace(Node node, Node replacementNode) {
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/modules/
H A DModuleStmt.java4 import com.github.javaparser.ast.Node;
14 public abstract class ModuleStmt extends Node {
32 public boolean remove(Node node) {
52 public boolean replace(Node node, Node replacementNode) {
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/validator/chunks/
H A DVarValidator.java3 import com.github.javaparser.ast.Node;
35 .flatMap(Node::getParentNode)
36 .map((Node p) -> p instanceof LambdaExpr).orElse(false);
45 Optional<Node> variableDeclarationExpr = vd.getParentNode();
59 Optional<Node> container = vdeNode.getParentNode();
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/metamodel/
H A DBaseNodeMetaModel.java3 import com.github.javaparser.ast.Node;
19 private final Class<? extends Node> type;
25 public BaseNodeMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
37 public boolean is(Class<? extends Node> c) {
50 * defined in superclasses of a Node.
103 public Class<? extends Node> getType() {
129 * @return whether this AST node is the root node, meaning that it is the meta model for "Node": "NodeMetaModel".
/external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/javaparsermodel/declarations/
H A DJavaParserSymbolDeclaration.java19 import com.github.javaparser.ast.Node;
43 private Node wrappedNode;
49 private JavaParserSymbolDeclaration(Node wrappedNode, String name, TypeSolver typeSolver, boolean field, boolean parameter, boolean variable) {
72 for (Node node : requireParentNode(parameter).getChildNodes()) {
82 public static int getParamPos(Node node) {
166 public Node getWrappedNode() {
/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ast/nodeTypes/
H A DNodeWithParameters.java5 import com.github.javaparser.ast.Node;
21 ((Node) this).tryAddImportToParentCompilationUnit(paramClass);
38 parameter.setParentNode((Node) this);
47 ((Node) this).tryAddImportToParentCompilationUnit(paramClass);
64 parameter.setParentNode((Node) this);
/external/llvm/lib/Target/SystemZ/
H A DSystemZLDCleanup.cpp44 bool VisitNode(MachineDomTreeNode *Node, unsigned TLSBaseAddrReg);
83 // Visit the dominator subtree rooted at Node in pre-order.
88 bool SystemZLDCleanup::VisitNode(MachineDomTreeNode *Node, argument
90 MachineBasicBlock *BB = Node->getBlock();
109 for (auto I = Node->begin(), E = Node->end(); I != E; ++I)
/external/python/cpython2/Lib/compiler/
H A Dast.py19 return [n for n in flatten(seq) if isinstance(n, Node)]
23 class Node: class in inherits:
35 class EmptyNode(Node):
38 class Expression(Node):
53 class Add(Node):
68 class And(Node):
84 class AssAttr(Node):
100 class AssList(Node):
116 class AssName(Node):
131 class AssTuple(Node)
[all...]
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/immutable/
H A DImmutablesRepresenter.java24 import org.yaml.snakeyaml.nodes.Node;
41 public Node representData(Object data) {
53 public Node representData(Object data) {
63 public Node representData(Object data) {
73 public Node representData(Object data) {
/external/swiftshader/third_party/subzero/src/
H A DIcePhiLoweringImpl.h33 void prelowerPhis32Bit(TargetT *Target, CfgNode *Node, Cfg *Func) { argument
34 for (Inst &I : Node->getPhis()) {
52 Node->getPhis().push_back(PhiLo);
53 Node->getPhis().push_back(PhiHi);
69 Node->getPhis().push_back(PhiElem);
/external/v8/src/
H A Dglobal-handles.cc28 class GlobalHandles::Node { class in class:v8::internal::GlobalHandles
42 static Node* FromLocation(Object** location) {
43 DCHECK(offsetof(Node, object_) == 0);
44 return reinterpret_cast<Node*>(location);
47 Node() { function in class:v8::internal::GlobalHandles::Node
48 DCHECK(offsetof(Node, class_id_) == Internals::kNodeClassIdOffset);
49 DCHECK(offsetof(Node, flags_) == Internals::kNodeFlagsOffset);
62 ~Node() {
76 void Initialize(int index, Node** first_free) {
222 Node* next_fre
[all...]
/external/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h177 /// \brief Calls the registered callbacks on all matches on the given \p Node.
183 template <typename T> void match(const T &Node, ASTContext &Context) { argument
184 match(clang::ast_type_traits::DynTypedNode::create(Node), Context);
186 void match(const clang::ast_type_traits::DynTypedNode &Node,
224 /// \brief Returns the results of matching \p Matcher on \p Node.
227 /// \p Matcher on \p Node and returns the collected results.
236 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context);
240 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node,
257 /// Node, Context));
263 if (const NodeT *Node
281 match(MatcherT Matcher, const ast_type_traits::DynTypedNode &Node, ASTContext &Context) argument
292 match(MatcherT Matcher, const NodeT &Node, ASTContext &Context) argument
[all...]
/external/clang/lib/Analysis/
H A DCallGraph.cpp134 CallGraphNode *Node = getOrInsertNode(D); local
137 CGBuilder builder(this, Node);
152 CallGraphNode *&Node = FunctionMap[F]; local
153 if (Node)
154 return Node;
156 Node = new CallGraphNode(F);
159 Root->addCallee(Node, this);
160 return Node;
216 static std::string getNodeLabel(const CallGraphNode *Node, argument
218 if (CG->getRoot() == Node) {
[all...]
/external/protobuf/src/google/protobuf/util/internal/
H A Ddefault_value_objectwriter.h133 // "Node" represents a node in the tree that holds the input of
135 class LIBPROTOBUF_EXPORT Node { class in class:google::protobuf::util::converter::DefaultValueObjectWriter
137 Node(const string& name, const google::protobuf::Type* type, NodeKind kind,
140 virtual ~Node() {
147 void AddChild(Node* child) { children_.push_back(child); }
150 Node* FindChild(StringPiece name);
152 // Populates children of this Node based on its type. If there are already
205 std::vector<Node*> children_;
219 GOOGLE_DISALLOW_EVIL_CONSTRUCTORS(Node);
222 // Populates children of "node" if it is an "any" Node an
[all...]
/external/swiftshader/third_party/LLVM/lib/Support/
H A DFoldingSet.cpp190 static FoldingSetImpl::Node *GetNextPtr(void *NextInBucketPtr) {
195 return static_cast<FoldingSetImpl::Node*>(NextInBucketPtr);
262 while (Node *NodeInBucket = GetNextPtr(Probe)) {
281 FoldingSetImpl::Node
291 while (Node *NodeInBucket = GetNextPtr(Probe)) {
307 void FoldingSetImpl::InsertNode(Node *N, void *InsertPos) {
336 bool FoldingSetImpl::RemoveNode(Node *N) {
350 if (Node *NodeInBucket = GetNextPtr(Ptr)) {
374 /// GetOrInsertNode - If there is an existing simple Node exactly
377 FoldingSetImpl::Node *FoldingSetImp
[all...]
/external/tensorflow/tensorflow/core/common_runtime/
H A Dshape_refiner.h38 std::unique_ptr<shape_inference::InferenceContext> ic, const Node* node)
86 // Node in the Graph, and providing/storing the 'input_tensor' Tensors
108 Status AddNode(const Node* node);
115 Status SetShape(const Node* node, int output_port,
126 Status UpdateNode(const Node* node, bool relax, bool* refined);
129 shape_inference::InferenceContext* GetContext(const Node* node) const {
138 ExtendedInferenceContext* GetExtendedContext(const Node* node) const {
229 Node* node, Graph* out_graph, bool* is_constant_graph,
232 Status EvaluateConstantTensorForEdge(const Node* node, int dst_idx,
257 const Node* nod
[all...]
/external/llvm/unittests/Analysis/
H A DLazyCallGraphTest.cpp132 LazyCallGraph::Node &A1 = (I++)->getNode(CG);
134 LazyCallGraph::Node &A2 = (I++)->getNode(CG);
136 LazyCallGraph::Node &A3 = (I++)->getNode(CG);
138 LazyCallGraph::Node &B1 = (I++)->getNode(CG);
140 LazyCallGraph::Node &B2 = (I++)->getNode(CG);
142 LazyCallGraph::Node &B3 = (I++)->getNode(CG);
144 LazyCallGraph::Node &C1 = (I++)->getNode(CG);
146 LazyCallGraph::Node &C2 = (I++)->getNode(CG);
148 LazyCallGraph::Node &C3 = (I++)->getNode(CG);
150 LazyCallGraph::Node
[all...]
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/printer/lexicalpreservation/
H A DNodeText.java24 import com.github.javaparser.ast.Node;
77 void addChild(Node child) {
81 void addChild(int index, Node child) {
122 int findChild(Node child) {
126 int findChild(Node child, int from) {
130 int tryToFindChild(Node child) {
134 int tryToFindChild(Node child, int from) {
/external/ksoap2/ksoap2-base/src/main/java/org/ksoap2/
H A DSoapEnvelope.java75 * The body object received with this envelope. Will be an KDom Node for
81 * The body object to be sent with this envelope. Must be a KDom Node
163 Node headers = new Node();
198 Node node = (bodyIn instanceof Node) ? (Node) bodyIn : new Node();
246 ((Node) bodyOut).write(writer);
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/constructor/
H A DSafeConstructor.java37 import org.yaml.snakeyaml.nodes.Node;
99 final Node keyNode = nodeTuple.getKeyNode();
100 final Node valueNode = nodeTuple.getValueNode();
110 List<Node> vals = sn.getValue();
111 for (Node subnode : vals) {
157 public Object construct(Node node) {
174 public Object construct(Node node) {
181 public Object construct(Node node) {
237 public Object construct(Node node) {
269 public Object construct(Node nod
[all...]

Completed in 2795 milliseconds

<<21222324252627282930>>