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 133 CaseRange& Pivot = *(Begin + Mid);
134 DEBUG(dbgs() << "Pivot ==> "
135 << cast<ConstantInt>(Pivot.Low)->getValue() << " -"
136 << cast<ConstantInt>(Pivot.High)->getValue() << "\n");
143 // Create a new node that checks if the value is < pivot. Go to the
151 Val, Pivot.Low, "Pivot");
  /external/qemu/distrib/sdl-1.2.15/src/stdlib/
SDL_qsort.c 133 * 3. We choose a pivot by looking at the first, last
136 * choosing the pivot, and it makes things a little
137 * easier in the partitioning step. Anyway, the pivot
148 * 4. We copy the pivot element to a separate place
151 * and don't have to wonder "did we move the pivot
198 #define Pivot(swapper,sz) \
225 while (compare(first,pivot)<0) first+=sz; \
226 while (compare(pivot,last)<0) last-=sz; \
261 memcpy(pivot,first,size); \
263 memcpy(test,pivot,size);
326 char *pivot=malloc(size); local
357 char *pivot=malloc(size); local
388 char *pivot=malloc(WORD_BYTES); local
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp     [all...]

Completed in 33 milliseconds