/external/elfutils/libebl/ |
H A D | eblwstrtab.c | 57 struct Ebl_WStrent *left; member in struct:Ebl_WStrent 76 size_t left; member in struct:Ebl_WStrtab 128 st->left = len - offsetof (struct memoryblock, memory); 164 if (st->left < align + sizeof (struct Ebl_WStrent) + len * sizeof (wchar_t)) 178 newstr->left = NULL; 185 st->left -= align + sizeof (struct Ebl_WStrent) + len * sizeof (wchar_t); 213 return searchstring (&(*sep)->left, newstr); 257 st->left += st->backp - (char *) newstr; 266 st->left += newstr->len; 278 newstr->left [all...] |
/external/fio/engines/ |
H A D | binject.c | 63 int left, int *err) 73 ret = read(bf->fd, p, left * sizeof(struct b_user_cmd)); 98 int left = max, ret, r = 0, ev_index = 0; local 121 while (left) { 139 events = binject_read_commands(td, buf, left, &r); 144 left -= events; 62 binject_read_commands(struct thread_data *td, void *p, int left, int *err) argument
|
H A D | sg.c | 69 int left = max, ret, r = 0; local 90 while (left) { 117 ret = read(f->fd, p, left * sizeof(struct sg_io_hdr)); 137 left -= events;
|
/external/freetype/src/gzip/ |
H A D | infutil.h | 35 uInt left; /* if STORED, bytes left to copy */ member in union:inflate_blocks_state::__anon6013
|
/external/gemmlowp/test/ |
H A D | correctness_meta_gemm.cc | 61 void check_result(std::uint8_t* left, std::uint8_t* right, std::uint8_t* result, argument 73 (static_cast<std::int32_t>(left[depth * i + k]) + lhs_offset) * 117 void check_result_f(std::uint8_t* left, std::uint8_t* right, float* result, argument 127 (static_cast<std::int32_t>(left[depth * i + k]) + lhs_offset) * 203 std::uint8_t* left = new std::uint8_t[max_m * max_k]; local 217 test(scratch, left, right, m, n, k, result, &pool, 4); 227 test_f(scratch, left, right, m, n, k, result_float, &pool, 4);
|
/external/glide/library/src/main/java/com/bumptech/glide/request/target/ |
H A D | SquaringDrawable.java | 29 public void setBounds(int left, int top, int right, int bottom) { argument 30 super.setBounds(left, top, right, bottom); 31 wrapped.setBounds(left, top, right, bottom);
|
/external/guava/guava/src/com/google/common/collect/ |
H A D | Ordering.java | 276 @Override public int compare(Object left, Object right) { argument 277 if (left == right) { 279 } else if (left == null) { 284 int leftCode = identityHashCode(left); 291 int result = uids.get(left).compareTo(uids.get(right)); 446 @Override public abstract int compare(@Nullable T left, @Nullable T right); argument 451 * iterator will be left exhausted: its {@code hasNext()} method will return 527 * iterator will be left exhausted: its {@code hasNext()} method will return 704 int left = 0; 711 while (left < righ 740 partition( E[] values, int left, int right, int pivotIndex) argument [all...] |
H A D | RegularContiguousSet.java | 97 private static boolean equalsOrThrow(Comparable<?> left, @Nullable Comparable<?> right) { argument 98 return right != null && Range.compareOrThrow(left, right) == 0;
|
/external/guava/guava/src/com/google/common/primitives/ |
H A D | Booleans.java | 288 public int compare(boolean[] left, boolean[] right) { argument 289 int minLength = Math.min(left.length, right.length); 291 int result = Booleans.compare(left[i], right[i]); 296 return left.length - right.length;
|
H A D | Chars.java | 409 public int compare(char[] left, char[] right) { argument 410 int minLength = Math.min(left.length, right.length); 412 int result = Chars.compare(left[i], right[i]); 417 return left.length - right.length;
|
H A D | Doubles.java | 392 public int compare(double[] left, double[] right) { argument 393 int minLength = Math.min(left.length, right.length); 395 int result = Double.compare(left[i], right[i]); 400 return left.length - right.length;
|
H A D | Floats.java | 388 public int compare(float[] left, float[] right) { argument 389 int minLength = Math.min(left.length, right.length); 391 int result = Float.compare(left[i], right[i]); 396 return left.length - right.length;
|
/external/guava/guava-gwt/src-super/com/google/common/primitives/super/com/google/common/primitives/ |
H A D | Chars.java | 358 public int compare(char[] left, char[] right) { argument 359 int minLength = Math.min(left.length, right.length); 361 int result = Chars.compare(left[i], right[i]); 366 return left.length - right.length;
|
H A D | Doubles.java | 387 public int compare(double[] left, double[] right) { argument 388 int minLength = Math.min(left.length, right.length); 390 int result = Double.compare(left[i], right[i]); 395 return left.length - right.length;
|
H A D | Floats.java | 384 public int compare(float[] left, float[] right) { argument 385 int minLength = Math.min(left.length, right.length); 387 int result = Float.compare(left[i], right[i]); 392 return left.length - right.length;
|
H A D | Shorts.java | 400 public int compare(short[] left, short[] right) { argument 401 int minLength = Math.min(left.length, right.length); 403 int result = Shorts.compare(left[i], right[i]); 408 return left.length - right.length;
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestsForSetsInJavaUtil.java | 393 public int compare(T left, T right) { argument 394 return String.valueOf(left).compareTo(String.valueOf(right));
|
/external/icu/icu4c/source/common/ |
H A D | normlzr.cpp | 205 Normalizer::concatenate(const UnicodeString &left, const UnicodeString &right, argument 209 if(left.isBogus() || right.isBogus() || U_FAILURE(errorCode)) { 224 *dest=left;
|
H A D | propsvec.c | 313 const uint32_t *left=(const uint32_t *)l, *right=(const uint32_t *)r; local 322 if(left[i]!=right[i]) { 323 return left[i]<right[i] ? -1 : 1;
|
/external/icu/icu4c/source/i18n/ |
H A D | collationweights.cpp | 72 // or is greater than or equal to the width of the promoted left operand, 194 compareRanges(const void * /*context*/, const void *left, const void *right) { argument 197 l=((const CollationWeights::WeightRange *)left)->start;
|
H A D | csdetect.cpp | 73 charsetMatchComparator(const void * /*context*/, const void *left, const void *right) argument 77 const CharsetMatch **csm_l = (const CharsetMatch **) left;
|
H A D | rbt_rule.cpp | 51 * @param anchorStart TRUE if the the rule is anchored on the left to 262 * key. The length of r1 to the left of the alignment point 263 * must be <= the length of r2 to the left; ditto for the 292 int32_t left = anteContextLength; local 294 int32_t right = len - left; 296 int32_t cachedCompare = r2.pattern.compare(left2 - left, len, pattern); 302 if (left == left2 && right == right2 && 311 return left <= left2 &&
|
H A D | uspoof_conf.cpp | 108 static int8_t U_CALLCONV SPUStringCompare(UHashTok left, UHashTok right) { argument 110 static_cast<SPUString *>(left.pointer));
|
/external/icu/icu4c/source/io/ |
H A D | ufmt_cmn.c | 75 UChar *left, *right, temp; local 91 left = buffer; 93 while(left < --right) { 94 temp = *left; 95 *left++ = *right;
|
/external/icu/icu4c/source/test/cintltst/ |
H A D | nfsprep.c | 153 int left, middle, right,rc; local 155 left =0; 158 while(left <= right){ 159 middle = (left+right)/2; 163 left = middle+1;
|