/external/freetype/include/freetype/ |
H A D | ftlist.h | 84 /* Find the list node for a given listed object. */ 91 /* List node. NULL if it wasn't found. */ 108 /* node :: The node to append. */ 112 FT_ListNode node ); 125 /* node :: The node to insert. */ 129 FT_ListNode node ); 138 /* Remove a node from a list. This function doesn't check whether */ 139 /* the node i [all...] |
/external/libchrome/crypto/ |
H A D | scoped_test_nss_db.cc | 35 for (CERTCertListNode* node = CERT_LIST_HEAD(cert_list); 36 !CERT_LIST_END(node, cert_list); 37 node = CERT_LIST_NEXT(node)) { 39 if (CERT_ChangeCertTrust(CERT_GetDefaultCertDB(), node->cert, &trust) !=
|
/external/pdfium/third_party/freetype/include/freetype/ |
H A D | ftlist.h | 84 /* Find the list node for a given listed object. */ 91 /* List node. NULL if it wasn't found. */ 108 /* node :: The node to append. */ 112 FT_ListNode node ); 125 /* node :: The node to insert. */ 129 FT_ListNode node ); 138 /* Remove a node from a list. This function doesn't check whether */ 139 /* the node i [all...] |
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/nodes/ |
H A D | NodeTest.java | 35 ScalarNode node = new ScalarNode(new Tag("!foo"), "Value1", null, null, '"'); 36 node.setTag((Tag) null); 46 Node node = new ScalarNode(new Tag("!foo"), "bla-bla", mark1, mark2, '"'); 47 assertEquals(mark1, node.getStartMark()); 48 assertEquals(mark2, node.getEndMark());
|
/external/v8/src/compiler/ |
H A D | all-nodes.h | 8 #include "src/compiler/node.h" 25 // reachable from the End node. 28 bool IsLive(Node* node) { argument 30 return IsReachable(node); 33 bool IsReachable(Node* node) { argument 34 if (!node) return false; 35 size_t id = node->id();
|
H A D | control-flow-optimizer.h | 8 #include "src/compiler/node-marker.h" 30 void Enqueue(Node* node); 31 void VisitNode(Node* node); 32 void VisitBranch(Node* node); 34 bool TryBuildSwitch(Node* node); 35 bool TryCloneBranch(Node* node);
|
H A D | value-numbering-reducer.cc | 10 #include "src/compiler/node-properties.h" 11 #include "src/compiler/node.h" 19 size_t HashCode(Node* node) { argument 20 size_t h = base::hash_combine(node->op()->HashCode(), node->InputCount()); 21 for (int j = 0; j < node->InputCount(); ++j) { 22 h = base::hash_combine(h, node->InputAt(j)->id()); 55 Reduction ValueNumberingReducer::Reduce(Node* node) { argument 56 if (!node->op()->HasProperty(Operator::kIdempotent)) return NoChange(); 58 const size_t hash = HashCode(node); 155 ReplaceIfTypesMatch(Node* node, Node* replacement) argument [all...] |
H A D | memory-optimizer.cc | 9 #include "src/compiler/node-matchers.h" 10 #include "src/compiler/node-properties.h" 11 #include "src/compiler/node.h" 30 VisitNode(token.node, token.state); 36 MemoryOptimizer::AllocationGroup::AllocationGroup(Node* node, argument 40 node_ids_.insert(node->id()); 43 MemoryOptimizer::AllocationGroup::AllocationGroup(Node* node, argument 47 node_ids_.insert(node->id()); 50 void MemoryOptimizer::AllocationGroup::Add(Node* node) { argument 51 node_ids_.insert(node 72 VisitNode(Node* node, AllocationState const* state) argument 104 VisitAllocate(Node* node, AllocationState const* state) argument 343 VisitCall(Node* node, AllocationState const* state) argument 352 VisitLoadElement(Node* node, AllocationState const* state) argument 362 VisitLoadField(Node* node, AllocationState const* state) argument 371 VisitStoreElement(Node* node, AllocationState const* state) argument 386 VisitStoreField(Node* node, AllocationState const* state) argument 401 VisitOtherEffect(Node* node, AllocationState const* state) argument 468 EnqueueMerge(Node* node, int index, AllocationState const* state) argument 500 EnqueueUses(Node* node, AllocationState const* state) argument 508 EnqueueUse(Node* node, int index, AllocationState const* state) argument [all...] |
H A D | escape-analysis.cc | 15 #include "src/compiler/node-matchers.h" 16 #include "src/compiler/node-properties.h" 17 #include "src/compiler/node.h" 47 // A node is dangling, if it is a load of some kind, and does not have 51 // A node is is an effect branch point, if it has more than 2 non-dangling 61 bool IsVirtual(Node* node); 62 bool IsEscaped(Node* node); 63 bool IsAllocation(Node* node); 72 void EnqueueForStatusAnalysis(Node* node); 73 bool SetEscaped(Node* node); 96 CheckUsesForEscape(Node* node, bool phi_escaping = false) argument 169 SetField(size_t offset, Node* node, bool created_phi = false) argument 205 SetObjectState(Node* node) argument 567 HasEntry(Node* node) argument 571 IsVirtual(Node* node) argument 579 IsEscaped(Node* node) argument 583 IsAllocation(Node* node) argument 588 SetEscaped(Node* node) argument 617 Node* node = status_stack_.back(); local 625 EnqueueForStatusAnalysis(Node* node) argument 633 RevisitInputs(Node* node) argument 643 RevisitUses(Node* node) argument 653 Process(Node* node) argument 693 IsAllocationPhi(Node* node) argument 703 ProcessStoreField(Node* node) argument 715 ProcessStoreElement(Node* node) argument 727 ProcessAllocate(Node* node) argument 837 ProcessFinishRegion(Node* node) argument 896 Node* node = stack_.back(); local 941 IsNotReachable(Node* node) argument 954 Node* node = queue.back(); local 997 IsDanglingEffectNode(Node* node) argument 1023 IsEffectBranchPoint(Node* node) argument 1047 Process(Node* node) argument 1086 ProcessAllocationUsers(Node* node) argument 1120 CopyForModificationAt(VirtualState* state, Node* node) argument 1133 CopyForModificationAt(VirtualObject* obj, VirtualState* state, Node* node) argument 1153 ForwardVirtualState(Node* node) argument 1186 ProcessStart(Node* node) argument 1192 ProcessEffectPhi(Node* node) argument 1243 ProcessAllocation(Node* node) argument 1273 ProcessFinishRegion(Node* node) argument 1286 replacement(Node* node) argument 1291 SetReplacement(Node* node, Node* rep) argument 1297 UpdateReplacement(VirtualState* state, Node* node, Node* rep) argument 1311 ResolveReplacement(Node* node) argument 1318 GetReplacement(Node* node) argument 1326 IsVirtual(Node* node) argument 1333 IsEscaped(Node* node) argument 1362 OffsetForFieldAccess(Node* node) argument 1368 OffsetForElementAccess(Node* node, int index) argument 1414 ProcessLoadField(Node* node) argument 1452 ProcessLoadElement(Node* node) argument 1492 ProcessStoreField(Node* node) argument 1531 ProcessStoreElement(Node* node) argument 1574 GetOrCreateObjectState(Node* effect, Node* node) argument 1616 IsCyclicObjectState(Node* effect, Node* node) argument 1667 GetVirtualObject(VirtualState* state, Node* node) argument [all...] |
/external/apache-xml/src/main/java/org/apache/xml/dtm/ref/sax2dtm/ |
H A D | SAX2DTM2.java | 69 * Iterator that returns all immediate children of a given node 80 * or set current node to END, to indicate request-not-honored? 82 * @param node Sets the root of the iteration. 86 public DTMAxisIterator setStartNode(int node) argument 89 if (node == DTMDefaultBase.ROOTNODE) 90 node = getDocument(); 93 _startNode = node; 94 _currentNode = (node == DTM.NULL) ? DTM.NULL 95 : _firstch2(makeNodeIdentity(node)); 104 * Get the next node i 140 setStartNode(int node) argument 243 setStartNode(int node) argument 416 setStartNode(int node) argument 512 setStartNode(int node) argument 577 setStartNode(int node) argument 638 setStartNode(int node) argument 859 setStartNode(int node) argument 1063 setStartNode(int node) argument 1287 setStartNode(int node) argument 1414 setStartNode(int node) argument 1522 setStartNode(int node) argument [all...] |
/external/mesa3d/src/gallium/auxiliary/cso_cache/ |
H A D | cso_hash.c | 102 static void cso_free_node(struct cso_node *node) argument 104 FREE(node); 112 struct cso_node *node = cso_data_allocate_node(hash->data.d); local 114 if (!node) 117 node->key = akey; 118 node->value = avalue; 120 node->next = (struct cso_node*)(*anextNode); 121 *anextNode = node; 123 return node; 205 struct cso_node **node; local 225 struct cso_node *node = cso_hash_create_node(hash, key, data, nextNode); local 301 cso_hash_data_next(struct cso_node *node) argument 332 cso_hash_data_prev(struct cso_node *node) argument 385 struct cso_node **node = cso_hash_find_node(hash, akey); local 419 struct cso_node *node = iter.node; local 437 struct cso_node **node = cso_hash_find_node(hash, key); local [all...] |
/external/kmod/libkmod/ |
H A D | libkmod-index.c | 102 * + Normal node 103 * * Marked node, representing a key and it's values. 120 * each node with only one child is merged with its child" 135 * each node has a maximum of two children, which increases space efficiency. 141 /* Format of node offsets within index file */ 238 struct index_node_f *node; local 261 node = NOFAIL(malloc(sizeof(struct index_node_f) + 264 node->first = first; 265 node->last = last; 268 node 300 index_close(struct index_node_f *node) argument 365 index_dump_node(struct index_node_f *node, struct strbuf *buf, int fd) argument 410 index_search__node(struct index_node_f *node, const char *key, int i) argument 469 index_searchwild__allvalues(struct index_node_f *node, struct index_value **out) argument 484 index_searchwild__all(struct index_node_f *node, int j, struct strbuf *buf, const char *subkey, struct index_value **out) argument 524 index_searchwild__node(struct index_node_f *node, struct strbuf *buf, const char *key, int i, struct index_value **out) argument 671 struct index_mm_node *node; local 737 index_mm_free_node(struct index_mm_node *node) argument 837 index_mm_dump_node(struct index_mm_node *node, struct strbuf *buf, int fd) argument 884 index_mm_search_node(struct index_mm_node *node, const char *key, int i) argument 942 index_mm_searchwild_allvalues(struct index_mm_node *node, struct index_value **out) argument 959 index_mm_searchwild_all(struct index_mm_node *node, int j, struct strbuf *buf, const char *subkey, struct index_value **out) argument 999 index_mm_searchwild_node(struct index_mm_node *node, struct strbuf *buf, const char *key, int i, struct index_value **out) argument [all...] |
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/ |
H A D | BinaryTreeTraverser.java | 36 * Returns the left child of the specified node, or {@link Optional#absent()} if the specified 37 * node has no left child. 42 * Returns the right child of the specified node, or {@link Optional#absent()} if the specified 43 * node has no right child. 48 * Returns the children of this node, in left-to-right order. 96 final T node; field in class:BinaryTreeTraverser.InOrderNode 99 InOrderNode(T node) { argument 100 this.node = checkNotNull(node); 119 pushIfPresent(rightChild(inOrderNode.node)); 129 pushIfPresent(Optional<T> node) argument [all...] |
/external/jacoco/org.jacoco.report.test/src/org/jacoco/report/internal/html/page/ |
H A D | MethodItemTest.java | 30 private MethodCoverageImpl node; field in class:MethodItemTest 34 node = new MethodCoverageImpl("test", "()V", null); 39 final MethodItem item = new MethodItem(node, "test()", null); 40 assertSame(node, item.getNode()); 45 final MethodItem item = new MethodItem(node, "test()", null); 51 final MethodItem item = new MethodItem(node, "test()", null); 57 final MethodItem item = new MethodItem(node, "test()", null); 63 final MethodItem item = new MethodItem(node, "test()", new SourceLink()); 69 node.increment(CounterImpl.COUNTER_1_0, CounterImpl.COUNTER_0_0, 15); 70 final MethodItem item = new MethodItem(node, "tes [all...] |
/external/mesa3d/src/mesa/main/ |
H A D | APIspec.py | 43 node = self.spec_node.children 44 while node: 45 if node.type == "element": 46 if node.name == "template": 47 self.tmpl_nodes[node.prop("name")] = node 48 elif node.name == "api": 49 self.api_nodes[node.prop("name")] = node 51 raise SpecError("unexpected node [all...] |
/external/icu/android_icu4j/src/main/java/android/icu/impl/coll/ |
H A D | CollationBuilder.java | 133 long node = nodes.elementAti(index); 134 // If the index is for a "weaker" node, 136 while(strengthFromNode(node) > strength) { 137 index = previousIndexFromNode(node); 138 node = nodes.elementAti(index); 141 // Find or insert a node whose index we will put into a temporary CE. 142 if(strengthFromNode(node) == strength && isTailoredNode(node)) { 143 // Reset to just before this same-strength tailored node. 144 index = previousIndexFromNode(node); 241 getWeight16Before(int index, long node, int level) argument 728 insertNodeBetween(int index, int nextIndex, long node) argument 1459 weight32FromNode(long node) argument 1462 weight16FromNode(long node) argument 1465 previousIndexFromNode(long node) argument 1468 nextIndexFromNode(long node) argument 1471 strengthFromNode(long node) argument 1475 nodeHasBefore2(long node) argument 1478 nodeHasBefore3(long node) argument 1481 nodeHasAnyBefore(long node) argument 1484 isTailoredNode(long node) argument 1488 changeNodePreviousIndex(long node, int previous) argument 1491 changeNodeNextIndex(long node, int next) argument [all...] |
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/impl/coll/ |
H A D | CollationBuilder.java | 129 long node = nodes.elementAti(index); 130 // If the index is for a "weaker" node, 132 while(strengthFromNode(node) > strength) { 133 index = previousIndexFromNode(node); 134 node = nodes.elementAti(index); 137 // Find or insert a node whose index we will put into a temporary CE. 138 if(strengthFromNode(node) == strength && isTailoredNode(node)) { 139 // Reset to just before this same-strength tailored node. 140 index = previousIndexFromNode(node); 237 getWeight16Before(int index, long node, int level) argument 724 insertNodeBetween(int index, int nextIndex, long node) argument 1455 weight32FromNode(long node) argument 1458 weight16FromNode(long node) argument 1461 previousIndexFromNode(long node) argument 1464 nextIndexFromNode(long node) argument 1467 strengthFromNode(long node) argument 1471 nodeHasBefore2(long node) argument 1474 nodeHasBefore3(long node) argument 1477 nodeHasAnyBefore(long node) argument 1480 isTailoredNode(long node) argument 1484 changeNodePreviousIndex(long node, int previous) argument 1487 changeNodeNextIndex(long node, int next) argument [all...] |
/external/libxml2/ |
H A D | check-xsddata-test-suite.py | 56 def handle_valid(node, schema): 61 instance = node.prop("dtd") 64 child = node.children 84 print "instance line %d" % (node.lineNo()) 96 nb_instances_tests, node.lineNo()) 109 def handle_invalid(node, schema): 114 instance = node.prop("dtd") 117 child = node.children 137 print "instance line %d" % (node.lineNo()) 150 # nb_instances_tests, node [all...] |
/external/okhttp/okio/okio/src/main/java/okio/ |
H A D | AsyncTimeout.java | 47 * element is the next node to time out, or null if the queue is empty. The 52 /** True if this node is currently in the queue. */ 55 /** The next node in the linked list. */ 73 AsyncTimeout node, long timeoutNanos, boolean hasDeadline) { 74 // Start the watchdog thread and create the head node when the first timeout is scheduled. 84 node.timeoutAt = now + Math.min(timeoutNanos, node.deadlineNanoTime() - now); 86 node.timeoutAt = now + timeoutNanos; 88 node.timeoutAt = node 72 scheduleTimeout( AsyncTimeout node, long timeoutNanos, boolean hasDeadline) argument 115 cancelScheduledTimeout(AsyncTimeout node) argument [all...] |
/external/antlr/antlr-3.4/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Debug/ |
H A D | DebugTreeNodeStream.cs | 39 * Debug any tree node stream. The constructor accepts the stream 40 * and a debug listener. As node stream calls come in, debug events 91 * It is normally this object that instructs the node stream to 109 object node = input.LT(1); 111 dbg.ConsumeNode(node); 121 object node = input.LT(i); 122 int ID = adaptor.GetUniqueID(node); 123 string text = adaptor.GetText(node); 124 int type = adaptor.GetType(node); 125 dbg.LT(i, node); [all...] |
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Debug/ |
H A D | DebugTreeNodeStream.cs | 40 * Debug any tree node stream. The constructor accepts the stream 41 * and a debug listener. As node stream calls come in, debug events 105 * It is normally this object that instructs the node stream to 127 object node = input.LT( 1 ); 129 dbg.ConsumeNode( node ); 142 object node = input.LT( i ); 143 int ID = adaptor.GetUniqueID( node ); 144 string text = adaptor.GetText( node ); 145 int type = adaptor.GetType( node ); 146 dbg.LT( i, node ); [all...] |
/external/antlr/antlr-3.4/runtime/Java/src/main/java/org/antlr/runtime/debug/ |
H A D | DebugTreeNodeStream.java | 34 /** Debug any tree node stream. The constructor accepts the stream 35 * and a debug listener. As node stream calls come in, debug events 65 Object node = input.LT(1); 67 dbg.consumeNode(node); 75 Object node = input.LT(i); 76 int ID = adaptor.getUniqueID(node); 77 String text = adaptor.getText(node); 78 int type = adaptor.getType(node); 79 dbg.LT(i, node); 80 return node; [all...] |
/external/skia/src/core/ |
H A D | SkSinglyLinkedList.h | 22 Node* node = fHead; local 23 while (node) { 24 Node* next = node->fNext; 25 SkASSERT(next != nullptr || node == fTail); 26 delete node; 27 node = next; 38 for (Node* node = fHead; node; node = node [all...] |
/external/swiftshader/src/OpenGL/compiler/ |
H A D | AnalyzeCallDepth.cpp | 17 AnalyzeCallDepth::FunctionNode::FunctionNode(TIntermAggregate *node) : node(node) argument 25 return node->getName(); 84 node->setOp(EOpPrototype); 85 node->getSequence().resize(1); // Remove function body 104 bool AnalyzeCallDepth::visitAggregate(Visit visit, TIntermAggregate *node) argument 106 switch(node->getOp()) 112 currentFunction = findFunctionByName(node->getName()); 116 currentFunction = new FunctionNode(node); [all...] |
/external/fio/lib/ |
H A D | prio_tree.c | 43 static void get_index(const struct prio_tree_node *node, argument 46 *radix = node->start; 47 *heap = node->last; 70 * Extend a priority search tree so that it can store a node with heap_index 76 struct prio_tree_node *node, unsigned long max_heap_index) 104 INIT_PRIO_TREE_NODE(node); 107 node->left = first; 108 first->parent = node; 110 last = node; 117 root->prio_tree_node = node; 75 prio_tree_expand(struct prio_tree_root *root, struct prio_tree_node *node, unsigned long max_heap_index) argument 124 prio_tree_replace(struct prio_tree_root *root, struct prio_tree_node *old, struct prio_tree_node *node) argument 168 prio_tree_insert(struct prio_tree_root *root, struct prio_tree_node *node) argument 245 prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node) argument [all...] |