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

  /external/chromium_org/third_party/tcmalloc/chromium/src/
packed-cache-inl.h 44 // kKeybits - kHashbits, and the values are bit strings of length kValuebits.
65 // for a cache entry is (kKeybits - kHashbits) + kValuebits. Suppose
66 // kKeybits + kValuebits is 43. Then it probably makes sense to
69 // On the other hand, suppose kKeybits = kValuebits = 64. Then
130 // 2^kKeybits and the values to be less than 2^kValuebits. The size of
146 static const int kValuebits = 7;
147 static const bool kUseWholeKeys = kKeybits + kValuebits <= 8 * sizeof(T);
151 COMPILE_ASSERT(kValuebits <= sizeof(V) * 8, value_size);
153 COMPILE_ASSERT(kKeybits - kHashbits + kValuebits <= kTbits,
198 // part of the key, and kValuebits determines where in the entry t
    [all...]
page_heap.cc 61 COMPILE_ASSERT(kNumClasses <= (1 << PageMapCache::kValuebits), valuebits);
  /external/chromium_org/third_party/tcmalloc/vendor/src/
packed-cache-inl.h 44 // kKeybits - kHashbits, and the values are bit strings of length kValuebits.
65 // for a cache entry is (kKeybits - kHashbits) + kValuebits. Suppose
66 // kKeybits + kValuebits is 43. Then it probably makes sense to
69 // On the other hand, suppose kKeybits = kValuebits = 64. Then
130 // 2^kKeybits and the values to be less than 2^kValuebits. The size of
144 static const int kValuebits = 7;
145 static const bool kUseWholeKeys = kKeybits + kValuebits <= 8 * sizeof(T);
149 COMPILE_ASSERT(kValuebits <= sizeof(V) * 8, value_size);
151 COMPILE_ASSERT(kKeybits - kHashbits + kValuebits <= kTbits,
196 // part of the key, and kValuebits determines where in the entry t
    [all...]
page_heap.cc 61 COMPILE_ASSERT(kNumClasses <= (1 << PageMapCache::kValuebits), valuebits);
  /external/chromium_org/third_party/WebKit/Source/wtf/
TCPackedCache.h 44 // kKeybits - kHashbits, and the values are bit strings of length kValuebits.
65 // for a cache entry is (kKeybits - kHashbits) + kValuebits. Suppose
66 // kKeybits + kValuebits is 43. Then it probably makes sense to
69 // On the other hand, suppose kKeybits = kValuebits = 64. Then
126 // 2^kKeybits and the values to be less than 2^kValuebits. The size of
135 static const size_t kValuebits = 8;
139 COMPILE_ASSERT(kValuebits <= sizeof(V) * 8, value_size);
141 COMPILE_ASSERT(kKeybits - kHashbits + kValuebits <= kTbits,
186 // part of the key, and kValuebits determines where in the entry to put
189 const int shift = kHashbits - kValuebits;
    [all...]
FastMalloc.cpp     [all...]

Completed in 3685 milliseconds