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

  /external/chromium_org/third_party/skia/bench/
HairlinePathBench.cpp 94 int hSize = size / 2;
101 int base1 = 2 * rand.nextULessThan(hSize);
102 int base2 = 2 * rand.nextULessThan(hSize);
103 int base3 = 2 * rand.nextULessThan(hSize);
126 int hSize = size / 2;
133 int base1 = 2 * rand.nextULessThan(hSize);
134 int base2 = 2 * rand.nextULessThan(hSize);
135 int base3 = 2 * rand.nextULessThan(hSize);
159 int hSize = size / 2;
166 int base1 = 2 * rand.nextULessThan(hSize);
    [all...]
  /external/skia/bench/
HairlinePathBench.cpp 94 int hSize = size / 2;
101 int base1 = 2 * rand.nextULessThan(hSize);
102 int base2 = 2 * rand.nextULessThan(hSize);
103 int base3 = 2 * rand.nextULessThan(hSize);
126 int hSize = size / 2;
133 int base1 = 2 * rand.nextULessThan(hSize);
134 int base2 = 2 * rand.nextULessThan(hSize);
135 int base3 = 2 * rand.nextULessThan(hSize);
159 int hSize = size / 2;
166 int base1 = 2 * rand.nextULessThan(hSize);
    [all...]
  /external/chromium_org/third_party/skia/experimental/nanomsg/
picture_demo.cpp 57 static const size_t hSize = sizeof(*header); // It's easy to slip up and use sizeof(header).
64 memcpy(header, msg, hSize);
65 SkMemoryStream stream((uint8_t*)msg + hSize, size - hSize);
  /external/skia/experimental/nanomsg/
picture_demo.cpp 57 static const size_t hSize = sizeof(*header); // It's easy to slip up and use sizeof(header).
64 memcpy(header, msg, hSize);
65 SkMemoryStream stream((uint8_t*)msg + hSize, size - hSize);
  /external/mdnsresponder/mDNSShared/
DebugServices.c     [all...]
  /external/mdnsresponder/mDNSCore/
DNSCommon.c     [all...]

Completed in 103 milliseconds