| /system/bt/osi/test/ |
| allocation_tracker_test.cpp | 32 // Ensure uninitialized state (previous tests may have called init)
|
| /system/core/libutils/ |
| primes.py | 22 # the previous prime in the table. This makes it easier to choose a new
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64A53Fix835769.cpp | 124 // Get the previous machine basic block in the function.
143 // Iterate through fallen through blocks trying to find a previous non-pseudo if
145 // previous blocks, not the current block, since we only use this to look at
146 // previous blocks.
152 // the previous block (if there is one).
160 // There was no previous non-pseudo in the fallen through blocks
167 // the previous fallthrough block
|
| /external/mesa3d/src/glx/apple/ |
| apple_glx_drawable.c | 150 if (d->previous) {
151 d->previous->next = d->next;
156 * has no previous pointer.
162 d->next->previous = d->previous;
296 d->previous = NULL;
309 drawables_list->previous = agd;
|
| /art/compiler/dex/ |
| dataflow_iterator.h | 60 * @param had_change did the user of the iteration change the previous BasicBlock.
132 * @param had_change did the user of the iteration change the previous BasicBlock.
163 * @param had_change did the user of the iteration change the previous BasicBlock.
194 * @param had_change did the user of the iteration change the previous BasicBlock.
224 * @param had_change did the user of the iteration change the previous BasicBlock.
255 * @param had_change did the user of the iteration change the previous BasicBlock.
285 * @param had_change did the user of the iteration change the previous BasicBlock.
319 * @param had_change did the user of the iteration change the previous BasicBlock.
346 * @param had_change did the user of the iteration change the previous BasicBlock.
393 * @param had_change did the user of the iteration change the previous BasicBlock
[all...] |
| /art/compiler/optimizing/ |
| gvn.cc | 207 Node* previous = nullptr; local
219 // Clone the bucket, make sure 'previous' and 'node' point to
221 previous = CloneBucket(i, previous);
222 node = (previous == nullptr) ? buckets_[i] : previous->GetNext();
225 previous = node;
239 if (previous == nullptr) {
242 previous->SetNext(next);
245 previous = node
[all...] |
| /external/apache-http/android/src/android/net/http/ |
| AndroidHttpClientConnection.java | 314 CharArrayBuffer previous = null; local
332 if ((first == ' ' || first == '\t') && previous != null) {
345 previous.length() + 1 + current.length() - start >
349 previous.append(' ');
350 previous.append(current, start, current.length() - start);
352 if (previous != null) {
353 headers.parseHeader(previous);
356 previous = current;
364 if (previous != null) {
365 headers.parseHeader(previous);
[all...] |
| /external/icu/icu4j/main/classes/core/src/com/ibm/icu/text/ |
| UCharacterIterator.java | 157 previous(); method
217 previous(); method
224 * Decrement to the position of the previous code unit in the
228 * @return the previous code unit in the text, or DONE if the new
232 public abstract int previous(); method in class:UCharacterIterator
236 * Retreat to the start of the previous code point in the text,
239 * as <code>previous()</code>. Otherwise the iterator is
242 * @return the previous code point in the text, or DONE if the new
247 int ch1 = previous();
249 int ch2 = previous();
[all...] |
| /external/libedit/doc/ |
| editrc.5.roff | 300 Vi paste previous deletion to the right of the cursor.
302 Vi paste previous deletion to the left of the cursor.
304 Vi move to the previous space delimited word.
306 Vi move to the previous word.
346 Vi move to previous character (backspace).
352 Vi search history previous.
362 Vi move to the character specified previous.
366 Vi move up to the character specified previous.
466 Move to the previous history line.
470 Search previous in history for a line matching the current
[all...] |
| /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/ |
| mp4lib_int.h | 266 Int prev_QP; /* quantization level for previous frame */
267 Int prev_prev_QP; /* quantization level for previous frame before last*/
284 Int framePos; /* specific position in previous multiple frames*/
285 Int frameRange; /* number of overall previous multiple frames */
297 float target_bits_per_frame_prev; /* previous C */
299 float aver_mad_prev; /* previous average mad */
301 Int encoded_frames_prev; /* previous encoded_frames */
328 Vop *prevBaseVop; /* Previous reference Base Vop */
330 Vop *prevEnhanceVop;/* Previous Enhancement Layer Vop */
397 UInt prevFrameNum[4]; /* previous frame number starting from modTimeRef *
[all...] |
| /prebuilts/libs/libedit/share/man/man5/ |
| editrc.5 | 300 Vi paste previous deletion to the right of the cursor.
302 Vi paste previous deletion to the left of the cursor.
304 Vi move to the previous space delimited word.
306 Vi move to the previous word.
346 Vi move to previous character (backspace).
352 Vi search history previous.
362 Vi move to the character specified previous.
366 Vi move up to the character specified previous.
466 Move to the previous history line.
470 Search previous in history for a line matching the current
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| ElemContext.java | 108 /** The previous element "stack frame". */
136 * @param previous The "stack frame" corresponding to the new
139 private ElemContext(final ElemContext previous)
141 m_prev = previous;
142 m_currentElemDepth = previous.m_currentElemDepth + 1;
|
| /external/clang/lib/Format/ |
| UnwrappedLineFormatter.h | 50 /// \brief An edge in the solution space from \c Previous->State to \c State,
53 StateNode(const LineState &State, bool NewLine, StateNode *Previous)
54 : State(State), NewLine(NewLine), Previous(Previous) {}
57 StateNode *Previous;
|
| /external/clang/test/CXX/temp/temp.spec/temp.expl.spec/ |
| examples.cpp | 284 template class BasicStringPiece<int>; // expected-note {{explicit instantiation definition is here}} expected-note {{previous definition is here}}
308 template class BasicStringPiece<int>; // expected-note {{previous explicit instantiation is here}}
314 template <> class BasicStringPiece<int> { }; // expected-note {{previous definition is here}}
321 template <> class BasicStringPiece<int> { }; // expected-note {{previous definition is here}}
328 template <> class BasicStringPiece<int> { }; // expected-note {{previous definition is here}}
|
| /external/clang/test/Sema/ |
| dllexport.c | 41 extern int GlobalRedecl3; // expected-note{{previous declaration is here}}
45 extern int GlobalRedecl4; // expected-note{{previous declaration is here}}
96 void redecl4(); // expected-note{{previous declaration is here}}
100 void redecl5(); // expected-note{{previous declaration is here}}
105 void redecl6(); // expected-note{{previous declaration is here}}
|
| /external/icu/icu4c/source/test/intltest/ |
| ucaconf.cpp | 233 "previous vs. current (%d) / current vs. previous (%d)",
256 errln("Line %i is not greater or equal than previous line", line);
261 errln(" Previous data line %s", oldLineB);
267 errln(" Previous key: "+oldS);
|
| /external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/ |
| UCAConformanceTest.java | 229 "previous vs. current (%d) / current vs. previous (%d)",
251 errln("Line " + lineNo + " is not greater or equal than previous line");
256 errln(" Previous data line " + oldLine);
259 errln(" Previous key: " + CollationTest.prettify(oldSk));
|
| /external/lz4/lib/ |
| lz4hc.h | 140 These functions compress data in successive blocks of any size, using previous blocks as dictionary.
141 One key assumption is that each previous block will remain read-accessible while compressing next block.
147 They work like usual LZ4_compressHC() or LZ4_compressHC_limitedOutput(), but use previous memory blocks to improve compression.
148 Previous memory blocks (including initial dictionary when present) must remain accessible and unmodified during compression.
150 If, for any reason, previous data block can't be preserved in memory during next compression block,
|
| /external/speex/libspeex/ |
| nb_celp.h | 62 int bounded_pitch; /**< Next frame should not rely on previous frames for pitch */
85 spx_lsp_t *old_lsp; /**< LSPs for previous frame */
86 spx_lsp_t *old_qlsp; /**< Quantized LSPs for previous frame */
135 spx_word16_t last_ol_gain; /**< Open-loop gain for previous frame */
140 spx_lsp_t *old_qlsp; /**< Quantized LSPs for previous frame */
|
| /frameworks/base/cmds/media/src/com/android/commands/media/ |
| Media.java | 69 " stop, next, previous, rewind, record, fast-forword.\n" +
154 } else if ("previous".equals(cmd)) {
228 + "... available commands: play, pause, next, previous");
266 } else if ("previous".equals(line)) {
267 mController.previous();
|
| /frameworks/base/libs/hwui/ |
| PatchCache.cpp | 205 BufferBlock* previous = nullptr; local
212 previous = block;
221 previous = nullptr;
232 if (previous) {
233 previous->next = block->next;
|
| /libcore/dex/src/main/java/com/android/dex/ |
| TableOfContents.java | 117 Section previous = null; local
133 if (previous != null && previous.off > section.off) {
134 throw new DexException("Map is unsorted at " + previous + ", " + section);
137 previous = section;
|
| /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/ |
| HermiteInterpolator.java | 90 // p1 has previous valid point p0.
95 // p1 has no previous valid point, but p2 has next valid point p3.
107 // p1 and p2 have no previous valid point. (Interval has only point p1 and p2)
119 // p2 has no next valid point, but p1 has previous valid point p0.
131 // p1 and p2 has no previous valid point. (Interval has only point p1 and p2)
|
| /prebuilts/misc/common/swig/include/2.0.11/r/ |
| rrun.swg | 49 struct RCallbackFunctionData *previous; /* Stack */
66 p = p->previous;
70 for(p = callbackFunctionDataStack, i = 0; i < n; p = p->previous, i++)
87 el->previous = callbackFunctionDataStack;
121 callbackFunctionDataStack = callbackFunctionDataStack->previous;
|
| /external/libnfc-nxp/src/ |
| phFriNfc_NdefReg.c | 133 NdefCb->Previous =NULL;
142 NdefCb->Previous = NULL;
143 NdefReg->NdefTypeList->Previous = NdefCb;
144 NdefReg->NdefTypeList = NdefReg->NdefTypeList->Previous;
191 if(tempNode->Previous==NULL && tempNode->Next!=NULL)
194 NdefReg->NdefTypeList->Previous = NULL;
198 if(tempNode->Next==NULL && tempNode->Previous==NULL)
203 if (tempNode->Previous != NULL)
205 tempNode->Previous->Next = tempNode->Next;
209 tempNode->Next->Previous = tempNode->Previous
[all...] |
