/external/javaparser/javaparser-symbol-solver-testing/src/test/test_sourcecode/javaparser_new_src/javaparser-core/com/github/javaparser/ |
Position.java | 24 import com.github.javaparser.ast.Node; 35 public static final Position ABSOLUTE_START = new Position(Node.ABSOLUTE_BEGIN_LINE, -1); 36 public static final Position ABSOLUTE_END = new Position(Node.ABSOLUTE_END_LINE, -1); 45 if (line < Node.ABSOLUTE_END_LINE) { 90 if (position.line == Node.ABSOLUTE_BEGIN_LINE) return true; 102 if (position.line == Node.ABSOLUTE_END_LINE) return true;
|
/external/skia/src/core/ |
SkTLList.h | 34 struct Node { 36 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node); 39 typedef SkTInternalLList<Node> NodeList; 44 // Having fCount initialized to -1 indicates that the first time we attempt to grab a free node 52 Node* node = iter.init(fList, Iter::kHead_IterStart); local 53 while (node) { 54 reinterpret_cast<T*>(node->fObj.get())->~T(); 55 Block* block = node->fBlock; 56 node = iter.next() 71 Node* node = this->createNode(); local 80 Node* node = this->createNode(); local 90 Node* node = this->createNode(); local 100 Node* node = this->createNode(); local 117 Node* node = fList.head(); local 126 Node* node = fList.head(); local 135 Node* node = reinterpret_cast<Node*>(t); local 241 Node* node = fFreeList.head(); local [all...] |
/external/skqp/src/core/ |
SkTLList.h | 34 struct Node { 36 SK_DECLARE_INTERNAL_LLIST_INTERFACE(Node); 39 typedef SkTInternalLList<Node> NodeList; 44 // Having fCount initialized to -1 indicates that the first time we attempt to grab a free node 52 Node* node = iter.init(fList, Iter::kHead_IterStart); local 53 while (node) { 54 reinterpret_cast<T*>(node->fObj.get())->~T(); 55 Block* block = node->fBlock; 56 node = iter.next() 71 Node* node = this->createNode(); local 80 Node* node = this->createNode(); local 90 Node* node = this->createNode(); local 100 Node* node = this->createNode(); local 117 Node* node = fList.head(); local 126 Node* node = fList.head(); local 135 Node* node = reinterpret_cast<Node*>(t); local 241 Node* node = fFreeList.head(); local [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Analysis/ |
SyntheticCountsUtils.cpp | 35 for (auto &Node : SCC) 36 SCCNodes.insert(Node); 40 for (const auto &Node : SCCNodes) { 41 for (auto &E : children_edges<CallGraphType>(Node)) { 43 SCCEdges.emplace_back(Node, E); 45 NonSCCEdges.emplace_back(Node, E); 50 // 1. Compute the additional count for each node by propagating the counts 51 // along all incoming edges to the node that originate from within the same
|
/external/v8/src/builtins/ |
builtins-global-gen.cc | 14 Node* context = Parameter(Descriptor::kContext); 25 Node* num = var_num.value(); 38 Node* num_value = LoadHeapNumberValue(num); 60 Node* context = Parameter(Descriptor::kContext); 71 Node* num = var_num.value(); 84 Node* num_value = LoadHeapNumberValue(num);
|
/device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellLevel1CommandsLib/ |
For.c | 137 ALIAS_LIST *Node;
148 for ( Node = (ALIAS_LIST *)GetFirstNode(List), Found = FALSE
149 ; !IsNull(List, &Node->Link)
150 ; Node = (ALIAS_LIST *)GetNextNode(List, &Node->Link)
152 ASSERT(Node->CommandString != NULL);
153 ASSERT(Node->Alias != NULL);
154 if (StrCmp(Node->Alias, Alias)==0) {
155 FreePool(Node->CommandString);
156 Node->CommandString = NULL; [all...] |
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AArch64/ |
AArch64ISelDAGToDAG.cpp | 61 void Select(SDNode *Node) override; 210 /// isIntImmediate - This method tests to see if the node is a constant 226 // isOpcWithIntImmediate - This method tests to see if the node is a specific 323 /// getShiftTypeForNode - Translate a shift node to the corresponding 352 // Check if this particular node is reused in any non-memory related 353 // operation. If yes, do not try to fold this node into the address 355 const SDNode *Node = V.getNode(); 356 for (SDNode *UI : Node->uses()) 414 /// getExtendTypeForNode - Translate an extend node to the corresponding 607 MachineSDNode *Node = CurDAG->getMachineNode(TargetOpcode::EXTRACT_SUBREG [all...] |
/device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EfiCommonLib/ |
LinkedList.c | 89 Remove Node from the doubly linked list. It is the caller's responsibility
127 Insert a Node into the end of a doubly linked list. The list must have
164 Insert a Node into the start of a doubly linked list. The list must have
239 Return the first node pointed to by the list head. The list must
249 Pointer to the first node, if the list contains nodes. The list will
263 EFI_LIST_ENTRY *Node
269 Returns the node following Node in the list. The list must
276 Node - The node in the list. This value MUST NOT be the literal value NULL. [all...] |
/device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/ |
LinkedList.c | 18 Worker function that locates the Node in the List.
20 By searching the List, finds the location of the Node in List. At the same time,
26 If Node is NULL, then ASSERT().
27 If PcdVerifyNodeInList is TRUE and DoMembershipCheck is TRUE and Node
32 @param List A pointer to a node in a linked list.
33 @param Node A pointer to a node in a linked list.
34 @param VerifyNodeInList TRUE if a check should be made to see if Node is a
41 and Node is a member of List.
43 and Node is in not a member of List. [all...] |
/external/antlr/runtime/ObjC/Framework/ |
NodeMapElement.h | 37 id<BaseTree> node; variable 40 @property (retain, getter=getNode, setter=setNode:) id<BaseTree> node; variable 45 + (id) newNodeMapElementWithIndex:(id)anIndex Node:(id<BaseTree>)aNode; 47 - (id) initWithAnIndex:(id)anIndex Node:(id)aNode;
|
/external/google-fruit/include/fruit/impl/data_structures/ |
semistatic_graph.h | 44 * Also, nodes can either be normal nodes or terminal nodes. Terminal nodes can't have outgoing edges. Note that a node 54 * (and therefore removing all the outgoing edges from the node) after construction. 56 * NodeId and Node must be default constructible and trivially copyable. 58 template <typename NodeId, typename Node> 63 // The node data for nodeId is in nodes[node_index_map.at(nodeId)/sizeof(NodeData)]. 66 // another node. 75 // If edges_begin==0, this is a terminal node. 76 // If edges_begin==1, this node doesn't exist, it's just referenced by another node. 83 Node node member in struct:fruit::impl::SemistaticGraph::NodeData [all...] |
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/nodeTypes/ |
NodeWithName.java | 24 import com.github.javaparser.ast.Node; 31 * A node with a (qualified) name. 37 public interface NodeWithName<N extends Node> {
|
NodeWithOptionalLabel.java | 3 import com.github.javaparser.ast.Node; 11 * A node that has an optional label. 13 public interface NodeWithOptionalLabel<T extends Node> {
|
NodeWithSimpleName.java | 24 import com.github.javaparser.ast.Node; 31 * A node with a name. 35 public interface NodeWithSimpleName<N extends Node> {
|
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/ast/validator/ |
SimpleValidator.java | 3 import com.github.javaparser.ast.Node; 12 public class SimpleValidator<N extends Node> extends SingleNodeTypeValidator<N> { 14 super(type, (node, problemReporter) -> { 15 if (condition.test(node)) { 16 problemSupplier.accept(node, problemReporter);
|
TypedValidator.java | 4 import com.github.javaparser.ast.Node; 9 * A validator that validates a known node type. 11 public interface TypedValidator<N extends Node> extends BiConsumer<N, ProblemReporter> { 13 * @param node the node that wants to be validated 16 void accept(N node, ProblemReporter problemReporter); 21 result.getResult().ifPresent(node -> 22 accept((N) node, new ProblemReporter(problem -> result.getProblems().add(problem))));
|
/external/javaparser/javaparser-core/src/main/java/com/github/javaparser/metamodel/ |
AnnotationExprMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected AnnotationExprMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
BodyDeclarationMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected BodyDeclarationMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
CallableDeclarationMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected CallableDeclarationMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
CommentMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected CommentMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
ExpressionMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected ExpressionMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
LiteralExprMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected LiteralExprMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
LiteralStringValueExprMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected LiteralStringValueExprMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
ModuleStmtMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected ModuleStmtMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|
ReferenceTypeMetaModel.java | 4 import com.github.javaparser.ast.Node; 12 protected ReferenceTypeMetaModel(Optional<BaseNodeMetaModel> superNodeMetaModel, Class<? extends Node> type, String name, String packageName, boolean isAbstract, boolean hasWildcard) {
|