Searched defs:left (Results 251 - 275 of 1217) sorted by relevance

<<11121314151617181920>>

/external/clang/include/clang/Basic/
H A DTargetCXXABI.h148 /// Are arguments to a call destroyed left to right in the callee?
278 friend bool operator==(const TargetCXXABI &left, const TargetCXXABI &right) { argument
279 return left.getKind() == right.getKind();
282 friend bool operator!=(const TargetCXXABI &left, const TargetCXXABI &right) { argument
283 return !(left == right);
/external/e2fsprogs/ext2ed/
H A Dwin.c125 int left,top,right,bottom,i; local
135 left=0;right=show_pad_info.display_cols-1;
145 prefresh (show_pad,show_pad_info.line,show_pad_info.col,top,left,show_pad_info.display_lines-1,show_pad_info.display_cols-1);
147 prefresh (show_pad,show_pad_info.line,show_pad_info.col,top,left,top+show_pad_info.display_lines-1,left+show_pad_info.display_cols-1);
/external/e2fsprogs/lib/ext2fs/
H A Dimager.c46 int left = blocksize; local
48 while (left > 0) {
51 left--;
63 unsigned int group, left, c, d; local
80 left = fs->inode_blocks_per_group;
81 while (left) {
83 if (c > left)
84 c = left;
98 left--;
123 left
142 unsigned int group, c, left; local
[all...]
H A Drbtree.c50 struct rb_node *left = node->rb_left; local
53 if ((node->rb_left = left->rb_right))
54 ext2fs_rb_set_parent(left->rb_right, node);
55 left->rb_right = node;
57 ext2fs_rb_set_parent(left, parent);
62 parent->rb_right = left;
64 parent->rb_left = left;
67 root->rb_node = left;
68 ext2fs_rb_set_parent(node, left);
227 struct rb_node *old = node, *left; local
[all...]
/external/fio/crc/
H A Dsha1.c38 int left = 64 - lenW; local
39 if (len < left)
40 left = len;
41 memcpy(lenW + (char *)ctx->W, data, left);
42 lenW = (lenW + left) & 63;
43 len -= left;
44 data += left;
/external/freetype/include/
H A Dftcache.h770 /* 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 Dftglyph.h142 /* 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/guava/guava/src/com/google/common/collect/
H A DRange.java504 static int compareOrThrow(Comparable left, Comparable right) { argument
505 return left.compareTo(right);
H A DSortedMaps.java53 * left intact. For example, the code: <pre> {@code
101 * are left intact. For example, the code: <pre> {@code
154 * the left map, or {@code Ordering.natural()} if the left map uses the
161 * of the left map.
164 * same mappings, call {@code left.equals(right)} instead of this method.
166 * @param left the map to treat as the "left" map for purposes of comparison
172 SortedMap<K, ? extends V> left, Map<? extends K, ? extends V> right) {
173 return Maps.difference(left, righ
171 difference( SortedMap<K, ? extends V> left, Map<? extends K, ? extends V> right) argument
[all...]
/external/guava/guava/src/com/google/common/primitives/
H A DUnsignedInts.java157 public int compare(int[] left, int[] right) { argument
158 int minLength = Math.min(left.length, right.length);
160 if (left[i] != right[i]) {
161 return UnsignedInts.compare(left[i], right[i]);
164 return left.length - right.length;
H A DUnsignedLongs.java159 public int compare(long[] left, long[] right) { argument
160 int minLength = Math.min(left.length, right.length);
162 if (left[i] != right[i]) {
163 return UnsignedLongs.compare(left[i], right[i]);
166 return left.length - right.length;
/external/guava/guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/
H A DRegularContiguousSet.java77 private static boolean equalsOrThrow(Comparable<?> left, @Nullable Comparable<?> right) { argument
78 return right != null && Range.compareOrThrow(left, right) == 0;
/external/harfbuzz_ng/test/api/
H A Dtest-shape.c72 hb_codepoint_t left, hb_codepoint_t right,
75 if (left == 1 && right == 2)
71 glyph_h_kerning_func(hb_font_t *font, void *font_data, hb_codepoint_t left, hb_codepoint_t right, void *user_data) argument
/external/icu/icu4c/source/common/
H A Duarrsort.c38 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 */
180 left=start;
187 while(/* array[left]<
[all...]
H A Dunorm.cpp225 _concatenate(const UChar *left, int32_t leftLength, argument
234 left==NULL || leftLength<-1 || right==NULL || rightLength<-1) {
248 /* allow left==dest */
250 if(left==dest) {
254 destString.append(left, leftLength);
261 unorm_concatenate(const UChar *left, int32_t leftLength, argument
273 return _concatenate(left, leftLength, right, rightLength,
276 return _concatenate(left, leftLength, right, rightLength,
/external/icu/icu4c/source/i18n/
H A Dcollationcompare.cpp27 CollationCompare::compareUpToQuaternary(CollationIterator &left, CollationIterator &right, argument
48 int64_t ce = left.nextCE(errorCode);
56 left.setCurrentCE(ce & INT64_C(0xffffffff00000000));
58 ce = left.nextCE(errorCode);
61 left.setCurrentCE(0);
119 leftSecondary = ((uint32_t)left.getCE(leftIndex++)) >> 16;
141 while((leftLower32 = (uint32_t)left.getCE(leftLimit)) >
160 leftSecondary = ((uint32_t)left.getCE(--leftIndex)) >> 16;
177 U_ASSERT(left.getCE(leftLimit) == right.getCE(rightLimit));
178 if(left
[all...]
/external/icu/icu4c/source/test/cintltst/
H A Dsorttest.c126 linesComparator(const void *context, const void *left, const void *right) { argument
128 const Line *leftLine=(const Line *)left;
/external/javassist/src/main/javassist/compiler/
H A DJvstTypeChecker.java68 protected void atFieldAssign(Expr expr, int op, ASTree left, ASTree right) argument
71 if (left instanceof Member
72 && ((Member)left).get().equals(codeGen.paramArrayName)) {
83 super.atFieldAssign(expr, op, left, right);
173 ASTree left = args.head();
174 return (left instanceof Member
175 && ((Member)left).get().equals(codeGen.paramListName));
/external/javassist/src/main/javassist/compiler/ast/
H A DASTList.java25 private ASTree left; field in class:ASTList
29 left = _head;
34 left = _head;
42 public ASTree getLeft() { return left; }
46 public void setLeft(ASTree _left) { left = _left; }
55 public ASTree head() { return left; }
58 left = _head;
80 ASTree a = list.left;
129 if (list.left == oldObj) {
130 list.left
[all...]
/external/jsilver/src/com/google/clearsilver/jsilver/autoescape/
H A DEscapeMode.java92 * values are provided by {@code left} and {@code right} respectively. For now, if either of the
99 public static EscapeMode combineModes(EscapeMode left, EscapeMode right) { argument
100 if (left.equals(ESCAPE_NONE) || right.equals(ESCAPE_NONE)) {
/external/jsilver/src/com/google/clearsilver/jsilver/data/
H A DDefaultHdfParser.java57 output.setValue(createFullPath(context, split.left), split.right);
63 output.setValue(createFullPath(context, split.left), readToToken(lineReader, split.right));
67 context.add(split.left);
74 output.setSymlink(createFullPath(context, split.left), split.right);
124 result.left = line.substring(0, position).trim();
133 String left; field in class:DefaultHdfParser.Split
/external/libhevc/common/arm/
H A Dihevc_intra_ref_substitution_a9q.c76 * UWORD8 pointer to the top-left
82 * UWORD8 pointer to the left
118 WORD32 bot_left, left, top, tp_right, tp_left; local
144 left = (nbr_flags & 0x000f0);
151 pu1_dst[(4 * nt)] = *pu1_top_left; // U top-left sample
152 pu1_dst[(4 * nt) + 1] = *(pu1_top_left + 1); // V top-left sample
155 if(0 != left)
159 pu1_dst[(4 * nt) - 2 - i] = pu1_left[j * src_strd]; // U left samples
160 pu1_dst[(4 * nt) - 1 - i] = pu1_left[(j * src_strd) + 1]; // V left samples
169 pu1_dst[(4 * nt) - 2 - i] = pu1_left[j * src_strd]; // U left sample
415 WORD32 bot_left, left, top, tp_right, tp_left; local
[all...]
/external/libvpx/libvpx/vp8/common/
H A Dfindnearmv.c37 const MODE_INFO *left = here - 1; local
61 /* Process left */
62 if (left->mbmi.ref_frame != INTRA_FRAME)
64 if (left->mbmi.mv.as_int)
68 this_mv.as_int = left->mbmi.mv.as_int;
69 mv_bias(ref_frame_sign_bias[left->mbmi.ref_frame], refframe, &this_mv, ref_frame_sign_bias);
83 /* Process above left */
108 /* See if above-left MV can be merged with NEAREST */
114 + (left->mbmi.mode == SPLITMV)) * 2
/external/libvpx/libvpx/vp8/encoder/
H A Dmr_dissim.c105 const MODE_INFO *left = here - 1; local
119 GET_MV_SIGN(left)
148 GET_MV(left)
/external/libvpx/libvpx/vp9/common/mips/dspr2/
H A Dvp9_intrapred16_dspr2.c18 const uint8_t *above, const uint8_t *left) {
23 "lb %[tmp1], (%[left]) \n\t"
24 "lb %[tmp2], 1(%[left]) \n\t"
25 "lb %[tmp3], 2(%[left]) \n\t"
26 "lb %[tmp4], 3(%[left]) \n\t"
27 "lb %[tmp5], 4(%[left]) \n\t"
28 "lb %[tmp6], 5(%[left]) \n\t"
29 "lb %[tmp7], 6(%[left]) \n\t"
30 "lb %[tmp8], 7(%[left]) \n\t"
31 "lb %[tmp9], 8(%[left]) \
17 vp9_h_predictor_16x16_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
164 vp9_dc_predictor_16x16_dspr2(uint8_t *dst, ptrdiff_t stride, const uint8_t *above, const uint8_t *left) argument
[all...]

Completed in 320 milliseconds

<<11121314151617181920>>