/external/llvm/test/MC/MachO/ |
H A D | previous.s | 9 .previous 12 .previous
|
/external/llvm/test/MC/ELF/ |
H A D | elf_directive_previous.s | 9 .previous 12 .previous
|
H A D | subsection.s | 27 .previous
|
/external/elfutils/lib/ |
H A D | list.h | 58 assert (_newp->previous == NULL); \ 60 (first) = _newp->next = _newp->previous = _newp; \ 64 _newp->previous = (first)->previous; \ 65 _newp->previous->next = _newp->next->previous = _newp; \ 87 _elem->next->previous = _elem->previous; \ 88 _elem->previous->next = _elem->next; \ 92 assert ((_elem->next = _elem->previous [all...] |
/external/chromium_org/third_party/WebKit/Source/core/html/ |
H A D | HTMLTableRowsCollection.cpp | 55 HTMLTableRowElement* HTMLTableRowsCollection::rowAfter(HTMLTableElement* table, HTMLTableRowElement* previous) argument 61 if (previous && previous->parentNode() != table) { 62 for (child = previous->nextSibling(); child; child = child->nextSibling()) { 69 if (!previous) 71 else if (isInHead(previous)) 72 child = previous->parentNode()->nextSibling(); 83 if (!previous || isInHead(previous)) 85 else if (previous [all...] |
H A D | HTMLNameCollection.cpp | 51 Element* HTMLNameCollection::virtualItemAfter(unsigned& offsetInArray, Element* previous) const 54 ASSERT(previous != ownerNode()); 57 if (!previous) 60 current = ElementTraversal::next(previous, ownerNode());
|
/external/chromium_org/chrome/browser/chromeos/ |
H A D | preferences_unittest.cc | 20 MyMockInputMethodManager(StringPrefMember* previous, argument 22 : previous_(previous), 68 StringPrefMember previous; local 69 previous.Init(prefs::kLanguagePreviousInputMethod, &prefs); 70 previous.SetValue("KeyboardA"); 75 MyMockInputMethodManager mock_manager(&previous, ¤t); 81 EXPECT_EQ("KeyboardA", previous.GetValue());
|
/external/chromium/chrome/common/net/ |
H A D | raw_host_resolver_proc.cc | 13 net::HostResolverProc* previous) 14 : HostResolverProc(previous), dns_server_(dns_server) {} 12 RawHostResolverProc(const net::IPAddressNumber& dns_server, net::HostResolverProc* previous) argument
|
H A D | raw_host_resolver_proc.h | 25 net::HostResolverProc* previous);
|
/external/chromium/net/base/ |
H A D | directory_lister_unittest.cc | 36 for (size_t previous = 0, current = 1; 38 previous++, current++) { 40 paths_[previous], paths_[current])); 47 for (size_t previous = 0, current = 1; 49 previous++, current++) { 51 if (file_util::FileEnumerator::IsDirectory(file_list_[previous]) && 57 EXPECT_EQ(file_util::FileEnumerator::IsDirectory(file_list_[previous]), 60 file_util::FileEnumerator::GetFilename(file_list_[previous]),
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingListIterator.java | 57 public E previous() { method in class:ForwardingListIterator 58 return delegate().previous();
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | AbstractLinkedIteratorTest.java | 61 protected Integer computeNext(Integer previous) { 62 return (previous == 1 << 30) ? null : previous * 2; 107 protected Integer computeNext(Integer previous) { 108 return (previous == last) ? null : previous * 2; 116 protected T computeNext(T previous) { 125 protected Object computeNext(Object previous) {
|
/external/chromium_org/third_party/WebKit/Source/core/dom/ |
H A D | NodeTraversal.cpp | 37 if (Node* previous = current->pseudoAwarePreviousSibling()) { 38 while (previous->pseudoAwareLastChild()) 39 previous = previous->pseudoAwareLastChild(); 40 return previous; 100 Node* previous(const Node* current, const Node* stayWithin) function in namespace:WebCore::NodeTraversal 105 Node* previous = current->previousSibling(); local 106 while (previous->lastChild()) 107 previous = previous [all...] |
/external/ceres-solver/internal/ceres/ |
H A D | line_search_direction.cc | 45 bool NextDirection(const LineSearchMinimizer::State& previous, argument 61 bool NextDirection(const LineSearchMinimizer::State& previous, argument 68 beta = current.gradient_squared_norm / previous.gradient_squared_norm; 71 gradient_change = current.gradient - previous.gradient; 73 previous.gradient_squared_norm); 76 gradient_change = current.gradient - previous.gradient; 78 previous.search_direction.dot(gradient_change)); 84 *search_direction = -current.gradient + beta * previous.search_direction; 113 bool NextDirection(const LineSearchMinimizer::State& previous, argument 122 previous 167 NextDirection(const LineSearchMinimizer::State& previous, const LineSearchMinimizer::State& current, Vector* search_direction) argument [all...] |
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/common/ |
H A D | tokens.py | 42 previous: The token before this one. 70 self.previous = None 87 return not self.previous or self.previous.line_number != self.line_number 139 node = node.previous
|
/external/chromium-trace/trace-viewer/third_party/closure_linter/closure_linter/ |
H A D | tokenutil.py | 42 token = token.previous 47 """Returns the first token in the previous line as token. 53 The first token in the previous line as token, or None if token is on the 57 if first_in_line.previous: 58 return GetFirstTokenInSameLine(first_in_line.previous) 120 previous = token.previous 121 if previous: 122 if func(previous): 123 return previous [all...] |
/external/chromium_org/third_party/closure_linter/closure_linter/common/ |
H A D | tokens.py | 42 previous: The token before this one. 70 self.previous = None 87 return not self.previous or self.previous.line_number != self.line_number 139 node = node.previous
|
/external/chromium_org/third_party/closure_linter/closure_linter/ |
H A D | tokenutil.py | 42 token = token.previous 47 """Returns the first token in the previous line as token. 53 The first token in the previous line as token, or None if token is on the 57 if first_in_line.previous: 58 return GetFirstTokenInSameLine(first_in_line.previous) 120 previous = token.previous 121 if previous: 122 if func(previous): 123 return previous [all...] |
/external/smack/src/org/xbill/DNS/ |
H A D | SIG0.java | 32 * @param previous If this message is a response, the SIG(0) from the query 36 SIGRecord previous) throws DNSSEC.DNSSECException 47 SIGRecord sig = DNSSEC.signMessage(message, previous, key, privkey, 60 * @param previous If this message is a response, the SIG(0) from the query 63 verifyMessage(Message message, byte [] b, KEYRecord key, SIGRecord previous) argument 76 DNSSEC.verifyMessage(message, b, sig, previous, key); 35 signMessage(Message message, KEYRecord key, PrivateKey privkey, SIGRecord previous) argument
|
/external/smack/src/org/jivesoftware/smack/util/ |
H A D | Cache.java | 508 head.next = head.previous = head; 530 LinkedListNode node = head.previous; 545 node.previous = head; 546 node.previous.next = node; 547 node.next.previous = node; 560 node.previous.next = node; 561 node.next.previous = node; 573 LinkedListNode node = new LinkedListNode(object, head, head.previous); 574 node.previous.next = node; 575 node.next.previous 628 public LinkedListNode previous; field in class:Cache.LinkedListNode 652 LinkedListNode(Object object, LinkedListNode next, LinkedListNode previous) argument [all...] |
/external/smali/dexlib/src/main/java/org/jf/dexlib/Util/ |
H A D | TryListBuilder.java | 51 lastTryRange.previous = firstTryRange; 56 public TryRange previous = null; field in class:TryListBuilder.TryRange 69 this.previous = null; 77 this.next.previous = tryRange; 81 tryRange.previous = this; 85 /*we use a dummy first item, so this.previous will always 87 this.previous.next = tryRange; 88 tryRange.previous = this.previous; 90 this.previous [all...] |
/external/chromium/base/ |
H A D | linked_list.h | 13 // list, as extending LinkNode (this gives it next/previous pointers). 47 // node = node->previous()) { 73 // "previous" pointers that reference other nodes in the list. 76 // space for the "next" and "previous" pointers (base::LinkNode<T>*). 78 // needs to glue on the "next" and "previous" pointers using 87 LinkNode(LinkNode<T>* previous, LinkNode<T>* next) argument 88 : previous_(previous), next_(next) {} 112 LinkNode<T>* previous() const { function in class:base::LinkNode 146 // and root_->previous() wraps around to the end of the list). 159 return root_.previous(); [all...] |
/external/chromium_org/base/containers/ |
H A D | linked_list.h | 12 // list, as extending LinkNode (this gives it next/previous pointers). 46 // node = node->previous()) { 72 // "previous" pointers that reference other nodes in the list. 75 // space for the "next" and "previous" pointers (base::LinkNode<T>*). 77 // needs to glue on the "next" and "previous" pointers using 86 LinkNode(LinkNode<T>* previous, LinkNode<T>* next) argument 87 : previous_(previous), next_(next) {} 111 LinkNode<T>* previous() const { function in class:base::LinkNode 138 // and root_->previous() wraps around to the end of the list). 151 return root_.previous(); [all...] |
/external/apache-xml/src/main/java/org/apache/xml/serializer/ |
H A D | ElemContext.java | 108 /** The previous element "stack frame". */ 136 * @param previous The "stack frame" corresponding to the new 139 private ElemContext(final ElemContext previous) argument 141 m_prev = previous; 142 m_currentElemDepth = previous.m_currentElemDepth + 1;
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | OrderIterator.cpp | 100 int previous = orderValues[0]; local 104 if (current == previous) 108 previous = current;
|