HomeSort by relevance Sort by last modified time
    Searched defs:left (Results 251 - 275 of 2695) sorted by null

<<11121314151617181920>>

  /external/syslinux/com32/lib/zlib/
inftrees.c 46 int left; /* number of prefix codes available */ local
131 left = 1;
133 left <<= 1;
134 left -= count[len];
135 if (left < 0) return -1; /* over-subscribed */
137 if (left > 0 && (type == CODES || max != 1))
270 left = (int)(1 << curr);
272 left -= count[curr + drop];
273 if (left <= 0) break;
275 left <<= 1
    [all...]
  /external/v8/benchmarks/
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);
370 SplayTree.Node.prototype.left = null; method in class:SplayTree.Node
    [all...]
  /external/valgrind/memcheck/tests/
mempool.c 26 int size, left; member in struct:_pool
47 p->size = p->left = SUPERBLOCK_SIZE;
102 p->left -= size + (REDZONE_SIZE*2);
mempool2.c 29 int size, left; member in struct:_pool
50 p->size = p->left = SUPERBLOCK_SIZE;
105 p->left -= size + (REDZONE_SIZE*2);
  /external/webp/src/dec/
tree_dec.c 288 uint8_t* const left = dec->intra_l_; local
311 memset(left, ymode, 4 * sizeof(*left));
316 int ymode = left[y];
343 left[y] = ymode;
  /external/webp/src/dsp/
filters.c 94 // Very first top-left pixel is copied.
96 // Rest of top scan-line is left-predicted.
136 // left prediction for top scan-line
212 uint8_t top = prev[0], top_left = top, left = top; local
216 left = in[i] + GradientPredictor(left, top, top_left);
218 out[i] = left;
filters_mips_dsp_r2.c 252 // Very first top-left pixel is copied.
254 // Rest of top scan-line is left-predicted.
318 // left prediction for top scan-line
360 uint8_t top = prev[0], top_left = top, left = top; local
364 left = in[i] + GradientPredictor(left, top, top_left);
366 out[i] = left;
  /external/webp/src/enc/
tree_enc.c 333 int left = preds[-1]; local
335 const uint8_t* const probas = kBModesProba[top_pred[x]][left];
336 left = PutI4Mode(bw, preds[x], probas);
  /external/webrtc/webrtc/common_audio/
audio_util_unittest.cc 112 int16_t left[kSamplesPerChannel], right[kSamplesPerChannel]; local
113 int16_t* deinterleaved[] = {left, right};
117 ExpectArraysEq(kRefLeft, left, kSamplesPerChannel);
  /external/webrtc/webrtc/common_audio/resampler/
resampler.cc 410 int16_t* left = (int16_t*)malloc(lengthIn * sizeof(int16_t) / 2); local
418 left[i >> 1] = samplesIn[i];
428 res |= slave_left_->Push(left, lengthIn, out_left, maxLen / 2, actualOutLen_left);
432 free(left);
447 free(left);
  /external/webrtc/webrtc/modules/desktop_capture/
desktop_region.h 34 RowSpan(int32_t left, int32_t right);
38 return left == that.left && right == that.right;
41 int32_t left; member in struct:webrtc::DesktopRegion::RowSpan
135 // Comparison functions used for std::lower_bound(). Compare left or right
141 static void AddSpanToRow(Row* row, int32_t left, int32_t right);
screen_capturer_helper.cc 96 int left = DownToMultiple(it.rect().left(), grid_size_mask); local
100 result->AddRect(DesktopRect::MakeLTRB(left, top, right, bottom));
  /external/wpa_supplicant_8/src/drivers/
netlink.c 40 int left; local
48 left = recvfrom(sock, buf, sizeof(buf), MSG_DONTWAIT,
50 if (left < 0) {
58 while (NLMSG_OK(h, left)) {
70 h = NLMSG_NEXT(h, left);
73 if (left > 0) {
75 "netlink message", left);
  /external/zlib/src/contrib/infback9/
inftree9.c 46 int left; /* number of prefix codes available */ local
125 left = 1;
127 left <<= 1;
128 left -= count[len];
129 if (left < 0) return -1; /* over-subscribed */
131 if (left > 0 && (type == CODES || max != 1))
263 left = (int)(1 << curr);
265 left -= count[curr + drop];
266 if (left <= 0) break;
268 left <<= 1
    [all...]
  /external/zlib/src/
inftrees.c 46 int left; /* number of prefix codes available */ local
131 left = 1;
133 left <<= 1;
134 left -= count[len];
135 if (left < 0) return -1; /* over-subscribed */
137 if (left > 0 && (type == CODES || max != 1))
270 left = (int)(1 << curr);
272 left -= count[curr + drop];
273 if (left <= 0) break;
275 left <<= 1
    [all...]
  /frameworks/av/include/ndk/
NdkImage.h 507 * (right - left) and the height of the rectangle is (bottom - top).</p>
510 int32_t left; member in struct:AImageCropRect
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm_neon_asm/
h264bsdFillRow7.s 28 left RN 2 label
60 CMP left, #0
66 SUBS left, left, #1
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/source/arm_neon_asm_gcc/
h264bsdFillRow7.S 28 #define left r2 define
44 void h264bsdFillRow7(const u8 * ref, u8 * fill, i32 left, i32 center,
51 CMP left, #0
57 SUBS left, left, #1
  /frameworks/base/core/java/android/hardware/camera2/marshal/impl/
MarshalQueryableRect.java 42 buffer.putInt(value.left);
50 int left = buffer.getInt(); local
55 int right = left + width;
58 return new Rect(left, top, right, bottom);
  /frameworks/base/core/java/android/hardware/camera2/params/
ReprocessFormatsMap.java 77 int left = entry.length; local
81 left--;
84 if (left < 1) {
90 left--;
99 if (left < length) {
103 "expected: %d)", inputFormat, left, length));
107 left -= length;
132 int left = mEntry.length; local
136 left--;
139 if (left < 1)
180 int left = mEntry.length; local
    [all...]
  /frameworks/base/core/java/android/text/method/
ScrollingMovementMethod.java 30 protected boolean left(TextView widget, Spannable buffer) { method in class:ScrollingMovementMethod
  /frameworks/base/core/java/android/transition/
SidePropagation.java 46 * {@link Gravity#LEFT}, {@link Gravity#TOP}, {@link Gravity#RIGHT},
93 int left = loc[0] + Math.round(sceneRoot.getTranslationX()); local
95 int right = left + sceneRoot.getWidth();
104 epicenterX = (left + right) / 2;
109 left, top, right, bottom);
122 int left, int top, int right, int bottom) {
126 side = isRtl ? Gravity.RIGHT : Gravity.LEFT;
129 side = isRtl ? Gravity.LEFT : Gravity.RIGHT;
135 case Gravity.LEFT:
142 distance = viewX - left + Math.abs(epicenterY - viewY)
    [all...]
  /frameworks/base/packages/SystemUI/src/com/android/systemui/statusbar/policy/
DarkIconDispatcher.java 78 int left = sTmpInt2[0]; local
80 int intersectStart = Math.max(left, area.left);
81 int intersectEnd = Math.min(left + view.getWidth(), area.right);
  /frameworks/base/services/tests/notification/src/com/android/server/notification/
GlobalSortKeyComparatorTest.java 50 NotificationRecord left = new NotificationRecord(getContext(), local
55 left.setGlobalSortKey("first");
72 expected.add(left);
89 NotificationRecord left = new NotificationRecord(getContext(), local
104 expected.add(left);
119 NotificationRecord left = new NotificationRecord(getContext(), local
124 left.setGlobalSortKey("not null");
133 expected.add(left);
  /frameworks/base/tools/aapt2/compile/
Image.h 78 inline bool operator==(const Range& left, const Range& right) {
79 return left.start == right.start && left.end == right.end;
83 * Inset lengths from all edges of a rectangle. `left` and `top` are measured
84 * from the left and top
89 int32_t left = 0; member in struct:aapt::Bounds
96 : left(l), top(t), right(r), bottom(b) {}
102 return left != 0 || top != 0 || right != 0 || bottom != 0;
105 inline bool operator==(const Bounds& left, const Bounds& right) {
106 return left.left == right.left && left.top == right.top &
    [all...]

Completed in 4960 milliseconds

<<11121314151617181920>>