HomeSort by relevance Sort by last modified time
    Searched refs:Pivot (Results 1 - 3 of 3) sorted by null

  /external/llvm/lib/Transforms/Utils/
LowerSwitch.cpp 145 CaseRange& Pivot = *(Begin + Mid);
146 DEBUG(dbgs() << "Pivot ==> "
147 << cast<ConstantInt>(Pivot.Low)->getValue() << " -"
148 << cast<ConstantInt>(Pivot.High)->getValue() << "\n");
155 // Create a new node that checks if the value is < pivot. Go to the
163 Val, Pivot.Low, "Pivot");
  /external/qemu/distrib/sdl-1.2.12/src/stdlib/
SDL_qsort.c 115 * 3. We choose a pivot by looking at the first, last
118 * choosing the pivot, and it makes things a little
119 * easier in the partitioning step. Anyway, the pivot
130 * 4. We copy the pivot element to a separate place
133 * and don't have to wonder "did we move the pivot
180 #define Pivot(swapper,sz) \
207 while (compare(first,pivot)<0) first+=sz; \
208 while (compare(pivot,last)<0) last-=sz; \
243 memcpy(pivot,first,size); \
245 memcpy(test,pivot,size);
308 char *pivot=malloc(size); local
339 char *pivot=malloc(size); local
370 char *pivot=malloc(WORD_BYTES); local
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp     [all...]

Completed in 977 milliseconds