| /external/chromium_org/third_party/openssl/openssl/crypto/bn/ |
| bn_gf2m.c | 232 const BIGNUM *at, *bt; local
237 if (a->top < b->top) { at = b; bt = a; }
238 else { at = a; bt = b; }
240 if(bn_wexpand(r, at->top) == NULL)
245 r->d[i] = at->d[i] ^ bt->d[i];
247 for (; i < at->top; i++)
249 r->d[i] = at->d[i];
252 r->top = at->top;
|
| /external/chromium_org/url/ |
| url_canon.h | 42 // Accessor for returning a character at a given position. The input offset
44 inline char at(int offset) const { function in class:url_canon::CanonOutputT
48 // Sets the character at the given position. The given position MUST be less
62 // write many characters at once, it can make sure there is enough capacity,
99 // Grow the buffer to hold at least one more item. Hopefully we won't have
121 // Grows the given buffer so that it can fit at least |min_additional|
244 // the output is empty. The beginning of the host will be at offset 0, and
[all...] |
| /external/chromium_org/v8/src/ |
| hydrogen-bch.cc | 83 block()->dominated_blocks()->at(current_dominated_block_) : NULL;
107 Element* at(int index) { return &(elements_.at(index)); } function in class:v8::internal::BASE_EMBEDDED
108 Element* at(HBasicBlock* block) { return at(block->block_id()); } function in class:v8::internal::BASE_EMBEDDED
111 at(block->block_id())->set_has_check();
120 at(i)->InitializeLoop(data);
137 * semantics as performing it at every loop iteration, which could cause
145 at(i)->ResetCurrentDominatedBlock();
153 if (at(current)->has_check() || !at(current)->is_in_loop())
[all...] |
| mksnapshot.cc | 115 fprintf(fp, "%u", static_cast<unsigned char>(at(j)));
118 char at(int i) { return data_[i]; } function in class:PartialSnapshotSink
302 fprintf(stderr, "%s at line %d\n", *message_string, message->GetLineNumber());
397 // If we don't do this then we end up with a stray root pointing at the
|
| /external/clang/include/clang/AST/ |
| CanonicalType.h | 101 /// // look at Ptr's pointee type
158 /// \brief Determines whether this canonical type is at least as qualified as
704 ArrayType_cannot_be_used_with_getAs<U> at; local
705 (void)at;
719 ArrayType_cannot_be_used_with_getAs<U> at; local
720 (void)at;
|
| /external/dexmaker/src/dx/java/com/android/dx/dex/file/ |
| ValueEncoder.java | 6 * You may obtain a copy of the License at
331 int at = 0; local
338 out.annotate(0, " elements[" + at + "]:");
339 at++;
|
| /external/guava/guava/src/com/google/common/collect/ |
| ArrayTable.java | 6 * You may obtain a copy of the License at
65 * lists of allowed keys and values. See the {@link #at}, {@link #set}, {@link
224 public V at(int rowIndex, int columnIndex) { method in class:ArrayTable
|
| /external/iptables/libiptc/ |
| linux_list.h | 20 * Check at compile time that something is of a particular type.
288 struct list_head *at = head->next; local
293 last->next = at;
294 at->prev = last;
313 * The list at @list is reinitialised
|
| /external/javassist/src/main/javassist/compiler/ |
| MemberResolver.java | 261 int at = argTypes[n]; local
262 if (t != at)
264 && (at == SHORT || at == BYTE || at == CHAR))
|
| /external/kernel-headers/original/linux/ |
| list.h | 311 struct list_head *at = head->next; local
316 last->next = at;
317 at->prev = last;
336 * The list at @list is reinitialised
|
| /external/openssl/crypto/bn/ |
| bn_gf2m.c | 232 const BIGNUM *at, *bt; local
237 if (a->top < b->top) { at = b; bt = a; }
238 else { at = a; bt = b; }
240 if(bn_wexpand(r, at->top) == NULL)
245 r->d[i] = at->d[i] ^ bt->d[i];
247 for (; i < at->top; i++)
249 r->d[i] = at->d[i];
252 r->top = at->top;
|
| /external/stlport/stlport/stl/ |
| _string_sum.h | 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
|
| /external/stlport/stlport/stl/pointers/ |
| _deque.h | 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
|
| /libcore/luni/src/main/native/ |
| cbigint.cpp | 7 * the License. You may obtain a copy of the License at
26 #define at(i) (i) macro
28 #define at(i) ((i)^1) macro
232 HIGH_IN_U64 (product) + result[at (resultIndex)] +
234 result[at (resultIndex)] = LOW_U32_FROM_VAR (product);
237 HIGH_IN_U64 (product) + result[at (resultIndex)] +
239 result[at (resultIndex)] = LOW_U32_FROM_VAR (product);
244 result[at (resultIndex)] += HIGH_U32_FROM_VAR (product);
245 if (result[at (resultIndex)] < HIGH_U32_FROM_VAR (product))
249 while (++result[at (resultIndex)] == 0
[all...] |
| /libcore/luni/src/test/java/libcore/java/io/ |
| OldInputStreamReaderTest.java | 7 * the License. You may obtain a copy of the License at
266 int at = 0; local
276 if (at < prefixLength) {
279 (int) c + " at " + at);
282 char decoded = decodedSuffix[at - prefixLength];
285 (int) c + " at " + at);
288 at++;
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _string_sum.h | 6 * or implied. Any use is at your own risk.
119 const_reference at(size_type __n) const function in class:__bstr_sum
120 { return _M_get_storage().at(__n); }
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
| _deque.h | 6 * or implied. Any use is at your own risk.
144 reference at(size_type __n) function in class:deque
145 { return cast_traits::to_value_type_ref(_M_impl.at(__n)); }
146 const_reference at(size_type __n) const function in class:deque
147 { return cast_traits::to_value_type_cref(_M_impl.at(__n)); }
|
| /ndk/sources/host-tools/ndk-stack/regex/ |
| engine.c | 53 #define at sat macro
65 #define at lat macro
107 static void at(struct match *, char *, char *, char *, sopno, sopno);
115 #define AT(t, p1, p2, s1, s2) at(m, t, p1, p2, s1, s2)
120 #define AT(t, p1, p2, s1, s2) /* nothing */
306 AT("diss", start, stop, startst, stopst);
490 AT("back", start, stop, startst, stopst);
571 AT("hard", sp, stop, ss, stopst);
671 - fast - step through the string at top spee
979 at(struct match *m, char *title, char *start, char *stop, sopno startst, function
1021 #undef at macro
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_vector.h | 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
[all...] |
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/tr1_impl/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
483 // The only tricky part is that we're caching the element count at
551 // DR 761. unordered_map needs an at() member function.
553 at(const _Key& __k);
556 at(const _Key& __k) const;
584 at(const _Key& __k) function in class:std::__detail::_Map_base
594 __throw_out_of_range(__N("_Map_base::at"));
602 at(const _Key& __k) const function in class:std::__detail::_Map_base
612 __throw_out_of_range(__N("_Map_base::at"));
|
| /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/i686-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
456 // The only tricky part is that we're caching the element count at
526 // DR 761. unordered_map needs an at() member function.
528 at(const _Key& __k);
531 at(const _Key& __k) const;
577 at(const _Key& __k) function in class:__detail::_Map_base
587 __throw_out_of_range(__N("_Map_base::at"));
595 at(const _Key& __k) const function in class:__detail::_Map_base
605 __throw_out_of_range(__N("_Map_base::at"));
|
| stl_vector.h | 9 // Free Software Foundation; either version 3, or (at your option)
340 * used, then this will do at most 2N calls to the copy
737 * see at().)
760 * see at().)
775 /// Safety check used only from at().
796 at(size_type __n) function in class:vector
814 at(size_type __n) const function in class:vector
821 * Returns a read/write reference to the data at the first
829 * Returns a read-only (constant) reference to the data at the first
837 * Returns a read/write reference to the data at the las
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/x86_64-linux/include/c++/4.6.x-google/bits/ |
| hashtable_policy.h | 8 // Free Software Foundation; either version 3, or (at your option)
456 // The only tricky part is that we're caching the element count at
526 // DR 761. unordered_map needs an at() member function.
528 at(const _Key& __k);
531 at(const _Key& __k) const;
577 at(const _Key& __k) function in class:__detail::_Map_base
587 __throw_out_of_range(__N("_Map_base::at"));
595 at(const _Key& __k) const function in class:__detail::_Map_base
605 __throw_out_of_range(__N("_Map_base::at"));
|
| stl_vector.h | 9 // Free Software Foundation; either version 3, or (at your option)
340 * used, then this will do at most 2N calls to the copy
737 * see at().)
760 * see at().)
775 /// Safety check used only from at().
796 at(size_type __n) function in class:vector
814 at(size_type __n) const function in class:vector
821 * Returns a read/write reference to the data at the first
829 * Returns a read-only (constant) reference to the data at the first
837 * Returns a read/write reference to the data at the las
[all...] |
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_vector.h | 9 // Free Software Foundation; either version 3, or (at your option)
293 * used, then this will do at most 2N calls to the copy
607 * see at().)
630 * see at().)
645 /// Safety check used only from at().
666 at(size_type __n) function in class:vector
684 at(size_type __n) const function in class:vector
691 * Returns a read/write reference to the data at the first
699 * Returns a read-only (constant) reference to the data at the first
707 * Returns a read/write reference to the data at the las
[all...] |
