| /external/aac/libSBRdec/src/ |
| sbrdec_drc.cpp | 160 /* swap previous data */
378 /* save previous factors */
420 /* save previous factors */
425 tmpBottom = 0; /* band starts in previous short window */
436 bottomQmf = 0; /* band starts in previous short window */
|
| /external/compiler-rt/lib/profile/ |
| GCDAProfiling.c | 398 fprintf(stderr, "profiling: %s: cannot merge previous GCDA file: "
406 fprintf(stderr, "profiling: %s: cannot merge previous GCDA file: "
450 fprintf(stderr, "profiling: %s: cannot merge previous run count: "
458 fprintf(stderr, "profiling: %s: cannot merge previous run count: "
466 runs += read_32bit_value(); /* Add previous run count to new counter. */
|
| /external/icu/icu4c/source/common/ |
| normlzr.cpp | 272 * Return the previous character in the normalized text and decrement
276 UChar32 Normalizer::previous() { function in class:Normalizer
315 return previous();
325 * {@link #next} and {@link #previous} iterate through characters in the
328 * <tt>previous</tt> and the indices passed to and returned from
|
| /external/icu/icu4c/source/i18n/ |
| basictz.cpp | 214 // Try previous transition
217 // Check if the previous transition is either DST->STD or STD->DST.
249 // The initial rule should represent the rule before the previous transition
257 // Try the previous one
401 // Get the previous raw offset and DST savings before the very first start time
|
| /external/libdrm/ |
| xf86drmSL.c | 368 unsigned long previous; local
384 previous = 0;
387 if (key <= previous) {
388 printf( "%lu !< %lu\n", previous, key);
390 previous = key;
|
| /external/ltrace/ |
| ltrace.conf.5 | 204 the previous \fIVALUE\fR is taken instead. If the first \fIVALUE\fR
272 that was expanded in the previous layer. Simple "recurse" would mean
275 to the previous element is of course the one that has been just
276 expanded in the previous round, and therefore all of them are either
277 recurse^, or nil. If the next and previous pointers are swapped, the
|
| /external/pdfium/core/src/fxcodec/fx_zlib/zlib_v128/ |
| deflate.h | 108 int last_flush; /* value of flush param for previous deflate call */
157 IPos prev_match; /* previous match */
158 int match_available; /* set if previous match exists */
164 /* Length of the best match at previous step. Matches not greater than this
189 /* Use a faster search when the previous match is longer than this */
|
| /external/pdfium/samples/fx_lpng/lpng_v163/ |
| pngstruct.h | 222 png_bytep prev_row; /* buffer to save previous (unfiltered) row.
352 png_byte num_prev_filters; /* number of weights for previous rows */
353 png_bytep prev_filters; /* filter type(s) of previous row(s) */
354 png_uint_16p filter_weights; /* weight(s) for previous line(s) */
355 png_uint_16p inv_filter_weights; /* 1/weight(s) for previous line(s) */
|
| /external/protobuf/src/google/protobuf/io/ |
| zero_copy_stream_impl_lite.cc | 235 // Already failed on a previous read.
242 // We have data left over from a previous BackUp(), so just return that.
283 // Already failed on a previous read.
287 // First skip any bytes left over from a previous BackUp().
373 // Already failed on a previous write.
|
| /external/valgrind/docs/internals/ |
| tracking-fn-entry-exit.txt | 51 the runtime linker). Do a POP, setting previous BB address to call
54 - when jmpkind is a CALL, push new function call from previous BB to current
125 > Action at BB start -- depends on jmp_kind from previous BB:
151 > linker). Pop the shadow call stack, setting the previous BB address to
173 > from previous BB to current BB on shadow call stack.
|
| /external/webrtc/src/modules/audio_coding/codecs/isac/main/source/ |
| filterbanks.c | 55 and lookahead samples from the previous encoding
148 placed there in the encoding of the previous frame. The output samples
197 forward channel filters. Each channel's forward filtering state from the previous
202 new state that is added to the previous 2x1 input state */
280 states from the previous decoding iteration.
|
| /external/zlib/src/ |
| deflate.h | 108 int last_flush; /* value of flush param for previous deflate call */
157 IPos prev_match; /* previous match */
158 int match_available; /* set if previous match exists */
164 /* Length of the best match at previous step. Matches not greater than this
189 /* Use a faster search when the previous match is longer than this */
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/nio/channels/ |
| SelectorTest.java | 409 // but selectedKeys remains the same as previous
484 // but selectedKeys remains the same as previous
518 // but selectedKeys remains the same as previous
568 // but selectedKeys remains the same as previous
630 // but selectedKeys remains the same as previous
|
| /packages/inputmethods/OpenWnn/src/jp/co/omronsoft/openwnn/ |
| WnnDictionary.java | 229 * Search words from dictionaries with specified conditions and previous word.
231 * For using link search function, specify the {@code wnnWord} as previous word and
235 * If the prediction dictionary for reading is set to use, the previous word must contain
237 * for part of speech is set to use, the previous word must contain the {@code partOfSpeech} information.
239 * @param wnnWord The previous word
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/common/layout/ |
| RelativeLayoutRule.java | 200 INode previous = null;
216 if (previous == null) {
218 previous = newChild;
232 state.attachPrevious(previous, newChild);
233 previous = newChild;
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| LayoutMetadata.java | 120 Node previous = commentNode.getPreviousSibling(); local
121 if (previous != null && previous.getNodeType() == Node.TEXT_NODE) {
122 if (previous.getNodeValue().trim().length() == 0) {
123 node.removeChild(previous);
|
| /external/clang/test/CXX/drs/ |
| dr1xx.cpp | 198 template<int N> void f(A<N>) {} // expected-note {{previous}}
200 template<typename T> void f(A<sizeof(T)>) {} // expected-note {{previous}}
368 void f(int, int, int = 0); // expected-note {{previous declaration is here}}
369 void g(int, int, int); // expected-note {{previous declaration is here}}
374 friend void i(int, int, int = 0) {} // expected-note {{previous declaration is here}}
382 extern "C" void k(int, int, int, int); // expected-note {{previous declaration is here}}
386 // expected-note {{previous declaration is here}}
395 void f(int); // expected-note {{previous declaration is here}}
423 typedef int f; // expected-note {{previous}}
442 void f(int *const) {} // expected-note {{previous}}
[all...] |
| /external/libedit/src/ |
| vi.c | 90 * Paste previous deletion before or after the cursor
120 * Vi paste previous deletion to the right of the cursor
133 * Vi paste previous deletion to the left of the cursor
146 * Vi move to the previous space delimited word
171 * Vi move to the previous word
583 * Vi move to previous character (backspace)
659 * Vi search history previous
731 * Vi move to the character specified previous
755 * Vi move up to the character specified previous
1079 * Vi append word from previous input lin
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| EHStreamer.cpp | 116 PrevAction = Actions[PrevAction].Previous;
139 } // else identical - re-use previous FirstAction
221 // The end label of the previous invoke or nounwind try-range.
225 // an ordinary call) between the end of the previous try-range and now.
242 // End of the previous try-range?
259 // instruction between the previous try-range and this one may throw,
283 // Try to merge with the previous call-site. SJLJ doesn't do this
287 // Extend the range of the previous entry.
309 // If some instruction between the previous try-range and the end of the
565 // Offset of the call site relative to the previous call site, counted i
[all...] |
| /external/protobuf/src/google/protobuf/stubs/ |
| map_util.h | 575 // present, then the key-value pair are inserted and "previous" is unchanged. If
576 // the key was already present, the value is updated and "*previous" will
585 typename Collection::value_type::second_type* previous) {
590 if (previous) {
591 *previous = ret.first->second;
603 typename Collection::value_type::second_type* previous) {
607 if (previous) {
608 *previous = ret.first->second;
622 // undefined previous* in case new data was inserted.
629 return NULL; // Inserted, no existing previous value
[all...] |
| /external/bison/tests/ |
| input.at | 333 input.y:1.13-29: previous declaration
335 input.y:2.10-24: previous declaration
337 input.y:1.13-29: previous declaration
339 input.y:2.10-24: previous declaration
341 input.y:7.13-29: previous declaration
343 input.y:8.10-24: previous declaration
345 input.y:7.13-29: previous declaration
347 input.y:8.10-24: previous declaration
349 input.y:4.13-29: previous declaration
351 input.y:5.10-24: previous declaratio
[all...] |
| /external/valgrind/helgrind/tests/ |
| tc19_shadowmem.stderr.exp | 35 This conflicts with a previous write of size 1 by thread #x
70 This conflicts with a previous write of size 1 by thread #x
105 This conflicts with a previous write of size 1 by thread #x
140 This conflicts with a previous write of size 1 by thread #x
175 This conflicts with a previous write of size 1 by thread #x
210 This conflicts with a previous write of size 1 by thread #x
245 This conflicts with a previous write of size 1 by thread #x
280 This conflicts with a previous write of size 1 by thread #x
315 This conflicts with a previous write of size 1 by thread #x
350 This conflicts with a previous write of size 1 by thread #
[all...] |
| /art/compiler/optimizing/ |
| register_allocator.cc | 1319 HInstruction* previous = user->GetPrevious(); local
1393 HInstruction* previous = at->GetPrevious(); local
1428 HInstruction* previous = last->GetPrevious(); local
[all...] |
| /external/icu/icu4c/source/test/intltest/ |
| collationtest.cpp | 382 UChar32 previous() { return (pos > 0) ? cp[--pos] : U_SENTINEL; } function in class:CodePointIterator
410 UChar32 c2 = cpi.previous();
433 UChar32 c2 = cpi.previous();
515 uint32_t previous = lowerLimit; local
525 if(!(previous < w && w < upperLimit)) {
529 (long)(i + 1), (long)w, (long)previous, (long)upperLimit);
[all...] |
| rbbiapts.cpp | 355 pos = wordIter1->previous();
357 pos = wordIter1->previous();
359 pos = wordIter1->previous();
361 pos = wordIter1->previous();
436 // Previous
439 i = bi->previous();
446 i = bi->previous();
448 errln("Incorrect value from bi->previous() at line %d. Expected DONE, got %d", __LINE__, i);
473 errln("Incorrect value from bi->previous() at line %d. Expected 0, got %d", __LINE__, i);
479 errln("Incorrect value from bi->previous() at line %d. Expected 1, got %d", __LINE__, i)
[all...] |
