/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | BorderData.h | 102 const BorderValue& left() const { return m_left; } function in class:WebCore::BorderData
|
/external/chromium_org/third_party/WebKit/Source/platform/ |
H A D | PODIntervalTree.h | 163 // Because the intervals are sorted by left endpoint, inorder 166 // See whether we need to traverse the left subtree. 167 IntervalNode* left = node->left(); 168 if (left 171 && !(left->data().maxHigh() < adapter.lowValue())) 172 searchForOverlapsFrom<AdapterType>(left, adapter); 189 IntervalNode* left = node->left(); local 190 if (left) { 213 IntervalNode* left = node->left(); local [all...] |
H A D | PODIntervalTreeTest.cpp | 228 int left = nextRandom(maximumValue); local 230 PODInterval<int> interval(left, left + length);
|
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | IntRect.cpp | 65 int left = std::max(x(), other.x()); local 71 if (left >= right || top >= bottom) { 72 left = 0; 78 m_location.setX(left); 80 m_size.setWidth(right - left); 94 int left = std::min(x(), other.x()); local 99 m_location.setX(left); 101 m_size.setWidth(right - left); 115 int left = std::min(x(), other.x()); local 120 m_location.setX(left); [all...] |
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | ArrayBuffer.h | 76 static inline int clampValue(int x, int left, int right); 83 int ArrayBuffer::clampValue(int x, int left, int right) argument 85 ASSERT(left <= right); 86 if (x < left) 87 x = left;
|
/external/chromium_org/third_party/freetype/include/freetype/ |
H A D | ftcache.h | 770 /* If `anode' is NULL, the cache node is left unchanged, which means */ 823 /* If `anode' is NULL, the cache node is left unchanged, which means */ 865 /* left :: The horizontal distance from the pen position to the */ 866 /* left bitmap border (a.k.a. `left side bearing', or */ 891 FT_Char left; member in struct:FTC_SBitRec_ 981 /* If `anode' is NULL, the cache node is left unchanged, which means */ 1036 /* If `anode' is NULL, the cache node is left unchanged, which means */
|
H A D | ftglyph.h | 142 /* left :: The left-side bearing, i.e., the horizontal distance */ 143 /* from the current pen position to the left border of the */ 163 FT_Int left; member in struct:FT_BitmapGlyphRec_
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uarrsort.c | 31 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 32 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 36 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 37 return *(const int32_t *)left - *(const int32_t *)right; 41 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 42 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 123 int32_t left, right; local 125 /* start and left are inclusive, limit and right are exclusive */ 132 left=start; 139 while(/* array[left]< [all...] |
H A D | unorm.cpp | 218 unorm_concatenate(const UChar *left, int32_t leftLength, argument 238 left==NULL || leftLength<-1 || 254 /* allow left==dest */ 256 if(left==dest) { 260 destString.append(left, leftLength);
|
/external/chromium_org/third_party/libjingle/source/talk/media/webrtc/ |
H A D | webrtcpassthroughrender.cc | 95 const float left, const float top, 92 AddIncomingRenderStream( const uint32_t stream_id, const uint32_t zOrder, const float left, const float top, const float right, const float bottom) argument
|
/external/chromium_org/third_party/libwebp/enc/ |
H A D | tree.c | 338 int left = preds[-1]; local 340 const uint8_t* const probas = kBModesProba[top_pred[x]][left]; 341 left = PutI4Mode(bw, preds[x], probas);
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/util/ |
H A D | u_string.h | 198 size_t left; member in struct:util_strbuf 208 sbuf->left = size; 215 if(sbuf->left > 1) { 219 written = util_vsnprintf(sbuf->ptr, sbuf->left, format, ap); 222 sbuf->left -= written;
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkRasterClip.h | 56 bool quickContains(int left, int top, int right, int bottom) const { argument 57 return quickContains(SkIRect::MakeLTRB(left, top, right, bottom));
|
H A D | SkTSort.h | 121 template <typename T, typename C> static void SkTInsertionSort(T* left, T* right, C lessThan) { argument 122 for (T* next = left + 1; next <= right; ++next) { 125 while (left < hole && lessThan(insert, *(hole - 1))) { 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument 139 T* newPivot = left; 140 while (left < right) { 141 if (lessThan(*left, pivotValue)) { 142 SkTSwap(*left, *newPivot); 145 left += 1; 154 * This implementation recurses on the left regio 163 SkTIntroSort(int depth, T* left, T* right, C lessThan) argument 191 SkTQSort(T* left, T* right, C lessThan) argument 201 SkTQSort(T* left, T* right) argument 206 SkTQSort(T** left, T** right) argument [all...] |
/external/chromium_org/third_party/skia/src/gpu/ |
H A D | GrTexture.cpp | 47 bool GrTexture::readPixels(int left, int top, int width, int height, argument 56 left, top, width, height, 61 void GrTexture::writePixels(int left, int top, int width, int height, argument 70 left, top, width, height,
|
H A D | SkGrPixelRef.cpp | 165 int left, top, width, height; local 167 left = subset->fLeft; 172 left = 0; 184 return fSurface->readPixels(left, top, width, height,
|
/external/chromium_org/third_party/smhasher/src/ |
H A D | md5.cpp | 276 unsigned long left; local 281 left = ctx->total[0] & 0x3F; 282 fill = 64 - left; 290 if( left && ilen >= fill ) 292 memcpy( (void *) (ctx->buffer + left), 297 left = 0; 309 memcpy( (void *) (ctx->buffer + left),
|
/external/chromium_org/third_party/zlib/ |
H A D | gzread.c | 94 left unchanged if there is no more input data available, will be set to COPY 544 unsigned left, n; local 569 left = (unsigned)len - 1; 570 if (left) do { 583 n = state->have > left ? left : state->have; 593 left -= n; 595 } while (left && eol == NULL);
|
H A D | infback.c | 122 left = strm->avail_out; \ 133 strm->avail_out = left; \ 203 if (left == 0) { \ 205 left = state->wsize; \ 206 state->whave = left; \ 207 if (out(out_desc, put, left)) { \ 251 unsigned have, left; /* available input and output */ local 278 left = state->wsize; 337 if (copy > left) copy = left; [all...] |
/external/chromium_org/tools/memory_watcher/ |
H A D | memory_hook.h | 71 bool operator!=(const PrivateHookAllocator<T>& left, argument 73 return (!(left == right));
|
H A D | memory_watcher.cc | 189 static bool CompareCallStackIdItems(MemoryWatcher::StackTrack* left, argument 191 return left->size > right->size;
|
/external/chromium_org/ui/native_theme/ |
H A D | native_theme_aura.cc | 121 gfx::ImageSkia* left = rb.GetImageSkiaNamed( local 123 DrawTiledImage(canvas, *left, 125 rect.x(), rect.y(), left->width(), left->height()); 126 center_offset += left->width(); 127 center_width -= left->width(); 194 gfx::ImageSkia* left = rb.GetImageSkiaNamed(left_resource_id); local 195 DrawTiledImage(canvas, *left, 197 rect.x(), rect.y(), left->width(), left [all...] |
/external/chromium_org/ui/views/ |
H A D | border.cc | 20 SidedSolidBorder(int top, int left, int bottom, int right, SkColor color); 35 int left, 40 insets_(top, left, bottom, right) { 47 canvas->FillRect(gfx::Rect(0, 0, insets_.left(), view.height()), color_); 77 EmptyBorder(int top, int left, int bottom, int right) argument 78 : insets_(top, left, bottom, right) {} 141 Border* Border::CreateEmptyBorder(int top, int left, int bottom, int right) { argument 142 return new EmptyBorder(top, left, bottom, right); 147 int left, 151 return new SidedSolidBorder(top, left, botto 34 SidedSolidBorder(int top, int left, int bottom, int right, SkColor color) argument 146 CreateSolidSidedBorder(int top, int left, int bottom, int right, SkColor color) argument [all...] |
/external/chromium_org/v8/benchmarks/spinning-balls/ |
H A D | splay-tree.js | 78 node.left = this.root_; 83 node.left = this.root_.left; 84 this.root_.left = null; 107 if (!this.root_.left) { 111 this.root_ = this.root_.left; 165 // the left subtree. 168 } else if (this.root_.left) { 169 return this.findMax(this.root_.left); 204 // the L tree of the algorithm. The left chil [all...] |
/external/chromium_org/v8/benchmarks/ |
H A D | splay.js | 57 left: GeneratePayloadTree(depth - 1, tag), 173 node.left = this.root_; 178 node.left = this.root_.left; 179 this.root_.left = null; 202 if (!this.root_.left) { 206 this.root_ = this.root_.left; 260 // the left subtree. 263 } else if (this.root_.left) { 264 return this.findMax(this.root_.left); [all...] |