/external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/v8-v6/ |
H A D | v8-splay.js | 53 right: GeneratePayloadTree(depth - 1, tag) 92 // Verify that the splay tree has the right size. 169 node.right = this.root_.right; 170 this.root_.right = null; 172 node.right = this.root_; 198 this.root_ = this.root_.right; 200 var right = this.root_.right; 202 // Splay to make sure that the new root has an empty right chil [all...] |
/external/chromium_org/third_party/WebKit/Source/core/rendering/ |
H A D | RenderVTTCue.cpp | 120 // Vertical: ... right by the distance given by position 155 LayoutUnit right = left + firstLineBox->width(); local 168 // rendering area, or if step is positive and the right edge of the 169 // first line box in boxes is now to the right of the right edge of 172 if (m_cue->getWritingDirection() != VTTCue::Horizontal && ((step < 0 && left < 0) || (step > 0 && right > parentWidth))) 186 // 13. Vertical: Move all the boxes in boxes right by the distance
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/style/ |
H A D | BorderData.h | 116 const BorderValue& right() const { return m_right; } function in class:blink::BorderData
|
/external/chromium_org/third_party/WebKit/Source/platform/ |
H A D | PODIntervalTree.h | 177 // See whether we need to traverse the right subtree. 181 searchForOverlapsFrom<AdapterType>(node->right(), adapter); 194 IntervalNode* right = node->right(); variable 195 if (right) { 196 if (*curMax < right->data().maxHigh()) 197 curMax = &right->data().maxHigh(); 214 IntervalNode* right = node->right(); local 219 if (right) { [all...] |
/external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
H A D | IntRect.cpp | 67 int right = std::min(maxX(), other.maxX()); local 71 if (left >= right || top >= bottom) { 74 right = 0; 80 m_size.setWidth(right - left); 96 int right = std::max(maxX(), other.maxX()); local 101 m_size.setWidth(right - left); 117 int right = std::max(maxX(), other.maxX()); local 122 m_size.setWidth(right - left);
|
/external/chromium_org/third_party/WebKit/Source/wtf/ |
H A D | ArrayBuffer.h | 75 static inline int clampValue(int x, int left, int right); 82 int ArrayBuffer::clampValue(int x, int left, int right) argument 84 ASSERT(left <= right); 87 if (right < x) 88 x = right;
|
/external/chromium_org/third_party/angle/src/compiler/translator/ |
H A D | RewriteElseBlocks.cpp | 41 TIntermBinary *MakeNewBinary(TOperator op, TIntermTyped *left, TIntermTyped *right, const TType &resultType) argument 45 binary->setRight(right);
|
/external/chromium_org/third_party/icu/source/common/ |
H A D | uarrsort.c | 38 uprv_uint16Comparator(const void *context, const void *left, const void *right) { argument 39 return (int32_t)*(const uint16_t *)left - (int32_t)*(const uint16_t *)right; 43 uprv_int32Comparator(const void *context, const void *left, const void *right) { argument 44 return *(const int32_t *)left - *(const int32_t *)right; 48 uprv_uint32Comparator(const void *context, const void *left, const void *right) { argument 49 uint32_t l=*(const uint32_t *)left, r=*(const uint32_t *)right; 171 int32_t left, right; local 173 /* start and left are inclusive, limit and right are exclusive */ 181 right=limit; 192 while(/* x<array[right [all...] |
H A D | unorm.cpp | 226 const UChar *right, int32_t rightLength, 234 left==NULL || leftLength<-1 || right==NULL || rightLength<-1) { 239 /* check for overlapping right and destination */ 241 ((right>=dest && right<(dest+destCapacity)) || 242 (rightLength>0 && dest>=right && dest<(right+rightLength))) 256 return n2->append(destString, UnicodeString(rightLength<0, right, rightLength), *pErrorCode). 262 const UChar *right, int32_t rightLength, 273 return _concatenate(left, leftLength, right, rightLengt 225 _concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, const Normalizer2 *n2, UErrorCode *pErrorCode) argument 261 unorm_concatenate(const UChar *left, int32_t leftLength, const UChar *right, int32_t rightLength, UChar *dest, int32_t destCapacity, UNormalizationMode mode, int32_t options, UErrorCode *pErrorCode) argument [all...] |
/external/chromium_org/third_party/icu/source/i18n/ |
H A D | buddhcal.cpp | 48 BuddhistCalendar& BuddhistCalendar::operator= ( const BuddhistCalendar& right) argument 50 GregorianCalendar::operator=(right);
|
H A D | taiwncal.cpp | 48 TaiwanCalendar& TaiwanCalendar::operator= ( const TaiwanCalendar& right) argument 50 GregorianCalendar::operator=(right);
|
/external/chromium_org/third_party/icu/source/test/cintltst/ |
H A D | sorttest.c | 126 linesComparator(const void *context, const void *left, const void *right) { argument 129 const Line *rightLine=(const Line *)right;
|
/external/chromium_org/third_party/libjingle/source/talk/media/webrtc/ |
H A D | webrtcpassthroughrender.cc | 96 const float right, const float bottom) { 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/libvpx/source/libvpx/vp8/encoder/ |
H A D | mr_dissim.c | 109 const MODE_INFO *right = NULL; local 125 right = here + 1; 127 GET_MV_SIGN(right) 154 right = here + 1; 156 GET_MV(right)
|
/external/chromium_org/third_party/skia/src/core/ |
H A D | SkScan_AntiPath.cpp | 87 const int right = clip.getBounds().fRight; local 91 fWidth = right - left; 333 // There is always a left column, a middle, and a right column.
|
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) { 136 static T* SkTQSort_Partition(T* left, T* right, T* pivot, C lessThan) { argument 138 SkTSwap(*pivot, *right); 140 while (left < right) { 147 SkTSwap(*newPivot, *right); 154 * This implementation recurses on the left region after pivoting and loops on the right, 160 * @param right the end of the region to be sorted (inclusive). 163 template <typename T, typename C> void SkTIntroSort(int depth, T* left, T* right, C lessThan) { argument 165 if (right 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/gl/ |
H A D | GrGLNameAllocator.cpp | 124 * AVL tree with non-null, non-adjacent left and right children. 128 SparseNameTree(SparseNameRange* left, SparseNameRange* right) argument 130 fRight(right) { 260 SkASSERT(fLeft->end() < fRight->first()); // There must be a gap between left and right. 323 SparseNameRange* right = this->takeRef(); variable 325 return SkNEW_ARGS(SparseNameTree, (left, right));
|
/external/chromium_org/third_party/skia/tests/ |
H A D | PathOpsCubicLineIntersectionTest.cpp | 106 double right = line[1].fX; local 107 flipped = left > right; 109 SkTSwap<double>(left, right); 111 result = intersections.horizontal(cubic, left, right, line[0].fY, flipped);
|
H A D | PathOpsQuadLineIntersectionTest.cpp | 45 double right = line[1].fX; local 46 flipped = left > right; 48 SkTSwap<double>(left, right); 50 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
|
H A D | PathOpsQuadLineIntersectionThreadedTest.cpp | 28 double right = line[1].fX; local 29 flipped = left > right; 31 SkTSwap<double>(left, right); 33 result = intersections.horizontal(quad, left, right, line[0].fY, flipped);
|
/external/chromium_org/third_party/webrtc/common_audio/resampler/ |
H A D | resampler.cc | 447 int16_t* right = (int16_t*)malloc(lengthIn * sizeof(int16_t) / 2); local 455 right[i >> 1] = samplesIn[i + 1]; 463 // Do resampling for right channel 465 res |= slave_right_->Push(right, lengthIn, out_right, maxLen / 2, actualOutLen_right); 469 free(right); 484 free(right);
|
/external/chromium_org/third_party/webrtc/modules/desktop_capture/ |
H A D | desktop_geometry.h | 91 int32_t right, int32_t bottom) { 92 return DesktopRect(left, top, right, bottom); 103 int32_t right() const { return right_; } function in class:webrtc::DesktopRect 132 DesktopRect(int32_t left, int32_t top, int32_t right, int32_t bottom) argument 133 : left_(left), top_(top), right_(right), bottom_(bottom) { 90 MakeLTRB(int32_t left, int32_t top, int32_t right, int32_t bottom) argument
|
H A D | differ.cc | 28 // One additional row/column is added as a boundary on the right & bottom. 54 // Calc size of partial blocks which may be present on right and bottom edge. 145 // We've found a modified block. Look at blocks to the right and below 153 // Group with blocks to the right. 156 uint8_t* right = diff_info + 1; local 157 while (*right) { 158 *right++ = 0; 170 right = bottom; 172 if (*right++ == 0) { 182 right [all...] |
H A D | screen_capturer_helper.cc | 97 int right = UpToMultiple(it.rect().right(), grid_size, grid_size_mask); local 100 result->AddRect(DesktopRect::MakeLTRB(left, top, right, bottom));
|
/external/chromium_org/third_party/webrtc/modules/video_render/android/java/src/org/webrtc/videoengine/ |
H A D | ViESurfaceRenderer.java | 55 dstRect.right = (int)(dstRect.left + dstRightScale * dstWidth); 69 " srcRect.right:" + srcRect.right + 73 " dstRect.right:" + dstRect.right + 82 changeDestRect(dst.right - dst.left, dst.bottom - dst.top); 86 " dst.right:" + dst.right + 90 " srcRect.right:" + srcRect.right 134 SetCoordinates(float left, float top, float right, float bottom) argument [all...] |