| /external/okhttp/okhttp-android-support/src/test/java/com/squareup/okhttp/android/ |
| HttpResponseCacheTest.java | 75 HttpResponseCache first = HttpResponseCache.install(cacheDir, 10 * 1024 * 1024); local
77 assertSame(first, another);
81 HttpResponseCache first = HttpResponseCache.install(cacheDir, 10 * 1024 * 1024); local
82 initializeCache(first);
87 assertNotSame(first, another);
89 first.flush();
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/text/ |
| AttributedStringTest.java | 37 buf.append(it.first());
114 public char first() { method in class:AttributedStringTest.testAttributedCharacterIterator
|
| /external/icu/android_icu4j/src/main/java/android/icu/text/ |
| RuleBasedBreakIterator.java | 321 public int first() { method in class:RuleBasedBreakIterator
330 fText.first();
384 * @return The position of the first boundary after this one.
418 // Reset the old break cache first.
429 // looking for the first dictionary character (which may be the one
529 // If we found breaks, build a new break cache. The first and last entries must
666 * Sets the iterator to refer to the first boundary position following
669 * @return The position of the first break after the current position.
685 // cache, then just search the cache for the first break position
708 return first();
896 first(); \/\/ For side effects on current position, tag values. method
938 first(); method
[all...] |
| /art/compiler/optimizing/ |
| block_builder.cc | 39 // Create the first block for the dex instructions, single successor of the entry block.
222 const Instruction& first = GetDexInstructionAt(code_item_, catch_block->GetDexPc()); local
223 if (first.Opcode() == Instruction::MOVE_EXCEPTION) {
314 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
331 HBasicBlock* try_block = graph_->GetBlocks()[entry.first];
|
| /art/runtime/ |
| reference_table.cc | 119 // Compare GC roots, first by class, then size, then address.
159 int first = count - kLast; local
160 if (first < 0) {
161 first = 0;
163 os << " Last " << (count - first) << " entries (of " << count << "):\n";
165 for (int idx = count - 1; idx >= first; --idx) {
|
| utf.cc | 185 const uint16_t first = GetLeadingUtf16Char(pair); local
186 hash = hash * 31 + first;
217 // First compare the leading utf16 char.
225 // Then compare the trailing utf16 char. First check if there
|
| /art/test/098-ddmc/src/ |
| Main.java | 72 Allocations first = new Allocations(DdmVmInternal.getRecentAllocations()); local
76 System.out.println("second > first =" + (second.numberOfEntries > first.numberOfEntries));
|
| /cts/tests/tests/text/src/android/text/style/cts/ |
| LeadingMarginSpan_StandardTest.java | 45 int first = 4; local
48 Standard standard = new LeadingMarginSpan.Standard(first, rest);
49 assertEquals(first, standard.getLeadingMargin(true));
|
| /dalvik/dexgen/src/com/android/dexgen/dex/code/form/ |
| Form3rc.java | 128 int first = regs.get(0).getReg(); local
129 int next = first;
131 if (!unsignedFitsInShort(first)) {
143 return unsignedFitsInByte(next - first);
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| PhiTypeResolver.java | 131 // Start by finding the first non-void operand
132 RegisterSpec first = null; local
140 first = rs;
145 if (first == null) {
150 LocalItem firstLocal = first.getLocalItem();
151 TypeBearer mergedType = first.getType();
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/events/ |
| CombinedEventsManager.java | 44 /** First active event. */
45 private EventState first; field in class:CombinedEventsManager
55 first = null;
128 first = null;
151 if (first == null) {
152 first = state;
155 if (state.getEventTime() < first.getEventTime()) {
156 first = state;
159 if (state.getEventTime() > first.getEventTime()) {
160 first = state
[all...] |
| /external/avahi/avahi-core/ |
| cache.c | 293 AvahiCacheEntry *e = NULL, *first; local
300 if ((first = lookup_key(c, r->key))) {
305 for (e = first; e; e = e->by_key_next) {
316 for (e = first; e; e = e->by_key_next)
354 AVAHI_LLIST_PREPEND(AvahiCacheEntry, by_key, first, e);
355 avahi_hashmap_replace(c->hashmap, e->record->key, first);
|
| /external/blktrace/btt/ |
| list.h | 171 * list_first - Returns first entry on list, or NULL if empty
194 struct list_head *first = list->next; local
198 first->prev = head;
199 head->next = first;
208 * * @head: the place to add it in the first list.
|
| /external/boringssl/src/crypto/asn1/ |
| a_object.c | 88 int i,first,len=0,c, use_bn; local
105 first= c-'0';
161 if ((first < 2) && (l >= 40))
168 if (!BN_add_word(bl, first * 40))
172 l+=(long)first*40;
|
| /external/boringssl/src/crypto/x509v3/ |
| v3_crld.c | 249 int first = 1; local
256 if (first)
257 first = 0;
263 if (first)
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/asn1/ |
| ASN1OutputStream.java | 174 private boolean first = true; field in class:ASN1OutputStream.ImplicitOutputStream
184 if (first)
186 first = false;
|
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_symbolizer_libbacktrace.cc | 89 SymbolizedStack *first; member in struct:__sanitizer::__anon9309::SymbolizeCodeCallbackArg
98 info->FillModuleInfo(first->info.module, first->info.module_offset);
102 CHECK_EQ(addr, first->info.address);
160 data.first = stack;
|
| /external/deqp/framework/referencerenderer/ |
| rrPrimitiveAssembler.hpp | 150 VertexPacket* const first = vertices[0]; local
153 *(outputIterator++) = Triangle(first, vertices[ndx], vertices[ndx+1], provokingOffset);
475 // first
|
| /external/deqp/modules/gles31/stress/ |
| es31sDrawTests.cpp | 77 deUint32 first; member in struct:deqp::gles31::Stress::__anon10726::DrawArraysCommand
240 drawCommand.first = (m_op == INVALID_DATA_FIRST) ? (overBoundDrawCount) : (0);
248 << "\n\tfirst\t" << drawCommand.first
464 spec.first = random.chooseWeighted<int, const int*, const float*> (DE_ARRAY_BEGIN(firsts), DE_ARRAY_END(firsts), firstWeights);
|
| /external/dexmaker/src/dx/java/com/android/dx/ssa/ |
| PhiTypeResolver.java | 132 // Start by finding the first non-void operand
133 RegisterSpec first = null; local
141 first = rs;
146 if (first == null) {
151 LocalItem firstLocal = first.getLocalItem();
152 TypeBearer mergedType = first.getType();
|
| /external/e2fsprogs/e2fsck/ |
| mtrace.h | 131 size_t first; /* First free fragment of the block. */ member in struct:__anon10878::__anon10879::__anon10880::__anon10881
138 (that may be the first of a free cluster). */
147 /* Pointer to first block of the heap. */
|
| /external/eigen/Eigen/src/SparseCore/ |
| SparseColEtree.h | 57 * \param firstRowElt The column index of the first element in each row
72 //Compute first nonzero column in each row
91 centered at its first vertex, which has the same fill. */
127 * Depth-first search from vertex n. No recursion.
133 Index current = n, first, next; local
137 first = first_kid(current);
140 if (first == -1)
165 current = first;
197 // Depth-first search from dummy root vertex #n
|
| /external/eigen/unsupported/Eigen/src/BVH/ |
| KdBVH.h | 24 vector_int_pair(const VectorType &v, int i) : first(v), second(i) {}
26 VectorType first; member in struct:Eigen::internal::vector_int_pair
155 } else { //if the first child is a volume and the second is an object
176 inline bool operator()(const VIPair &v1, const VIPair &v2) const { return v1.first[dim] < v2.first[dim]; }
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| IterationController.h | 98 bool first() { return m_nit == 0; } function in class:Eigen::IterationController
|
| /external/elfutils/libdwfl/ |
| dwfl_report_elf.c | 69 bool first = true; local
84 unless we just layed out the first section at 0 when
90 /* This is the first section assigned a location.
137 if (first || end < shdr->sh_addr + shdr->sh_size)
139 if (first || bias > shdr->sh_addr)
151 first = false;
|
