HomeSort by relevance Sort by last modified time
    Searched full:prev (Results 2551 - 2575 of 3406) sorted by null

<<101102103104105106107108109110>>

  /external/chromium_org/third_party/libvpx/source/libvpx/third_party/libwebm/
mkvparser.cpp     [all...]
  /external/libvpx/libvpx/third_party/libwebm/
mkvparser.cpp     [all...]
  /external/libvpx/libwebm/
mkvparser.cpp     [all...]
  /external/tinyxml/docs/
tinyxml_8h-source.html     [all...]
  /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/third_party/libwebm/
mkvparser.cpp     [all...]
  /external/chromium_org/components/policy/core/common/
policy_loader_win_unittest.cc 736 GROUP_POLICY_OBJECT* prev) {
741 gpo->pPrev = prev;
    [all...]
  /external/chromium_org/third_party/WebKit/Source/devtools/front_end/profiler/
CanvasProfileView.js 73 this._createControlButton(controlsContainer, "canvas-replay-prev-step", WebInspector.UIString("Previous call."), this._onReplayStepClick.bind(this, false));
75 this._createControlButton(controlsContainer, "canvas-replay-prev-draw", WebInspector.UIString("Previous drawing call."), this._onReplayDrawingCallClick.bind(this, false));
    [all...]
  /external/chromium_org/third_party/icu/patches/
segmentation.patch 243 + // prev[i] is the index of the last CJK character in the previous word in
245 + AutoBuffer<int, defaultInputLength> prev(numChars + 1);
247 + prev[i] = -1;
284 + prev[lengths[j] + i] = i;
309 + prev[j] = i;
317 + // prev[numChars] is guaranteed to be meaningful.
327 + for (int i = numChars; i > 0; i = prev[i]){
331 + U_ASSERT(prev[t_boundary[numBreaks-1]] == 0);
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/drivers/r300/compiler/
radeon_optimize.c 801 for (inst = inst_mul->Prev; inst != var->Inst;
802 inst = inst->Prev) {
  /external/chromium_org/third_party/mesa/src/src/mesa/drivers/dri/r200/
r200_sanity.c     [all...]
  /external/chromium_org/v8/src/
deoptimizer.cc 250 JSFunction* prev = NULL; local
261 if (prev != NULL) {
262 prev->set_next_function_link(next);
275 prev = function;
371 Code* prev = NULL; local
381 if (prev != NULL) {
383 prev->set_next_code_link(next);
394 prev = code;
    [all...]
  /external/clang/lib/Analysis/
ThreadSafetyCommon.cpp 178 return translate(Ctx->FunArgs[I], Ctx->Prev);
194 return translate(Ctx->SelfArg, Ctx->Prev);
  /external/dexmaker/javadoc/com/google/dexmaker/
BinaryOp.html 57 &nbsp;PREV CLASS&nbsp;
470 &nbsp;PREV CLASS&nbsp;
Comparison.html 57 &nbsp;<A HREF="../../../com/google/dexmaker/Code.html" title="class in com.google.dexmaker"><B>PREV CLASS</B></A>&nbsp;
368 &nbsp;<A HREF="../../../com/google/dexmaker/Code.html" title="class in com.google.dexmaker"><B>PREV CLASS</B></A>&nbsp;
  /external/icu/icu4c/source/test/cintltst/
cucdtst.c 3359 UChar32 prev, prevSimple; member in struct:CaseFoldingData
3373 UChar32 c, prev, simple; local
    [all...]
  /external/jdiff/src/jdiff/
Diff.java 362 diffFile.println(" <A HREF=\"" + prevPkgName + "\"><B>PREV PACKAGE</B></A> &nbsp;");
364 diffFile.println(" <B>PREV PACKAGE</B> &nbsp;");
    [all...]
  /external/jpeg/
jquant1.c 617 LOCFSERROR bpreverr; /* error for below/prev col */
710 errorptr[0] = (FSERROR) bpreverr; /* unload prev err into array */
  /external/jsr305/javadoc/
index-all.html 53 &nbsp;PREV&nbsp;
264 &nbsp;PREV&nbsp;
  /external/libxml2/
entities.c 330 ret->prev = dtd->last;
379 ret->prev = dtd->last;
  /external/llvm/lib/CodeGen/
EarlyIfConversion.cpp 465 DEBUG(dbgs() << " --> " << *std::prev(FirstTerm));
486 DEBUG(dbgs() << " --> " << *std::prev(FirstTerm));
MachineFunction.cpp 149 BlockNo = std::prev(MBBI)->getNumber() + 1;
187 /// has no parent, prev, or next.
    [all...]
MachineScheduler.cpp 420 isSchedBoundary(std::prev(RegionEnd), MBB, MF, TII, IsPostRA)) {
431 if (isSchedBoundary(std::prev(I), MBB, MF, TII, IsPostRA))
439 if (I == RegionEnd || I == std::prev(RegionEnd)) {
792 std::pair<MachineInstr *, MachineInstr *> P = *std::prev(DI);
798 if (OrigPrevMI == std::prev(RegionEnd))
    [all...]
TailDuplication.cpp 800 RS->forward(std::prev(PredBB->end()));
859 MachineBasicBlock *PrevBB = std::prev(MachineFunction::iterator(TailBB));
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
ScheduleDAGSDNodes.cpp 747 std::prev(Emitter.getInsertPos())->isPHI()) {
753 Orders.push_back(std::make_pair(Order, std::prev(Emitter.getInsertPos())));
    [all...]
  /external/mesa3d/src/gallium/drivers/r300/compiler/
radeon_optimize.c 801 for (inst = inst_mul->Prev; inst != var->Inst;
802 inst = inst->Prev) {

Completed in 2235 milliseconds

<<101102103104105106107108109110>>