HomeSort by relevance Sort by last modified time
    Searched defs:high (Results 151 - 175 of 1130) sorted by null

1 2 3 4 5 67 8 91011>>

  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/site-packages/setools/policyrep/
mls.py 198 high = level_factory(policy, levels[1].strip())
202 high = low
206 policy_range = qpol.qpol_mls_range_t(policy, low.qpol_symbol, high.qpol_symbol)
209 format(sym, low, high))
432 high = self.high
434 if high == low:
437 return "{0} - {1}".format(low, high)
444 return self.low == other.low and self.high == other.high
457 def high(self): member in class:Range
    [all...]
  /art/compiler/optimizing/
intrinsics.h 138 high(0),
149 // Value of java.lang.IntegerCache#high.
150 int32_t high; member in struct:art::IntrinsicVisitor::IntegerValueOfInfo
locations.h 137 static Location RegisterPairLocation(int low, int high) {
138 return Location(kRegisterPair, low << 16 | high);
141 static Location FpuRegisterPairLocation(int low, int high) {
142 return Location(kFpuRegisterPair, low << 16 | high);
175 int high() const { function in class:art::Location
201 return static_cast<T>(high());
213 return static_cast<T>(high());
233 return Location::RegisterLocation(high());
235 return Location::FpuRegisterLocation(high());
  /dalvik/dexgen/src/com/android/dexgen/dex/code/
SwitchData.java 212 long high = cases.get(sz - 1); local
213 long result = ((high - low + 1)) * 2 + 4;
  /dalvik/dx/src/com/android/dx/dex/code/
SwitchData.java 213 long high = cases.get(sz - 1); local
214 long result = ((high - low + 1)) * 2 + 4;
  /external/aac/libArithCoding/src/
ac_arith_coder.cpp 423 int high; member in struct:__anon13712
434 INT low, high, range, value; local
439 high = s->high;
442 range = high - low + 1;
503 high = low + mul_sbc_14bits(range, c_freq[symbol - 1]) - 1;
508 USHORT us_high = (USHORT)high;
526 s->high = (int)us_high;
627 as.high = ari_q4new;
  /external/apache-commons-math/src/main/java/org/apache/commons/math/ode/
ContinuousOutputModel.java 324 final int high = FastMath.min(iMax - 1, (iMin + 9 * iMax) / 10); local
327 } else if (index > high) {
328 index = high;
  /external/apache-http/src/org/apache/http/impl/auth/
DigestScheme.java 464 int high = ((binaryData[i] & 0xf0) >> 4); local
465 buffer[i * 2] = HEXADECIMAL[high];
  /external/apache-xml/src/main/java/org/apache/xml/serializer/
WriterToUTF8Buffered.java 123 * the 16 low-order bits of the given integer value; the 16 high-order bits
214 // Adjust the end of the chunk if it ends on a high char
231 * and it is the high char of a high/low pair with
234 * The char array incorrectly ends in a high char
235 * of a high/low surrogate pair, but there is
236 * no corresponding low as the high is the last char
281 * Unicode: [1101 10ww] [wwzz zzyy] (high surrogate)
287 char high, low; local
288 high = c
415 char high, low; local
    [all...]
  /external/e2fsprogs/e2fsck/
dirinfo.c 207 int low, high, mid; local
249 high = ctx->dir_info->count-1;
258 if (ino == ctx->dir_info->array[high].ino) {
261 ctx->dir_info->array[high].dotdot,
262 ctx->dir_info->array[high].parent);
264 return &ctx->dir_info->array[high];
267 while (low < high) {
268 mid = (low+high)/2;
269 if (mid == low || mid == high)
280 high = mid
    [all...]
ea_refcount.c 158 int low, high, mid; local
164 high = (int) refcount->count-1;
166 (blk > refcount->list[high].ea_blk))) {
183 while (low <= high) {
184 mid = (low+high)/2;
190 high = mid-1;
196 * low (where high will be left at low-1).
  /external/elfutils/libdwfl/
linux-proc-maps.c 179 do_report (Dwfl *dwfl, char **plast_file, Dwarf_Addr low, Dwarf_Addr high)
184 low, high);
193 #define report() do_report(dwfl, &last_file, low, high)
201 Dwarf_Addr low = 0, high = 0; local
236 high = end;
253 high = end;
261 high = end;
  /external/gptfdisk/
gptcl.cc 66 uint64_t low, high, startSector, endSector, sSize; local
294 high = FindLastInFree(low);
295 startSector = IeeeToInt(GetString(newPartInfo, 2), sSize, low, high, low);
296 endSector = IeeeToInt(GetString(newPartInfo, 3), sSize, startSector, high, high);
  /external/honggfuzz/libcommon/
util.c 286 size_t high = arraySz - 1; local
289 while (array[high] != array[low] && key >= array[low] && key <= array[high]) {
290 mid = low + (key - array[low]) * ((high - low) / (array[high] - array[low]));
295 high = mid - 1;
  /external/icu/icu4c/source/common/
locmap.cpp 1260 uint32_t high = gLocaleCount; local
    [all...]
uniset.cpp 446 // list[len - 1] == HIGH and that c is legal (0..HIGH-1).
449 // High runner test. c is often after the last range, so an
587 * it is contained in any pair of this set. Pairs either have the high
588 * bytes equal, or unequal. If the high bytes are equal, then we have
589 * aaxx..aayy, where aa is the high byte. Then v is contained if xx <=
590 * v <= yy. If the high bytes are unequal we have aaxx..bbyy, bb>aa.
598 UChar32 high = getRangeEnd(i); local
599 if ((low & ~0xFF) == (high & ~0xFF)) {
600 if ((low & 0xFF) <= v && v <= (high & 0xFF))
    [all...]
usc_impl.cpp 271 UChar high = scriptRun->textArray[scriptRun->scriptLimit]; local
272 UChar32 ch = high;
277 * if the character is a high surrogate and it's not the last one
280 if (high >= 0xD800 && high <= 0xDBFF && scriptRun->scriptLimit < scriptRun->textLength - 1) {
288 ch = (high - 0xD800) * 0x0400 + low - 0xDC00 + 0x10000;
337 * end it before the high surrogate
uset.cpp 331 * - some supplementary: (length|0x8000) (bmpLength<length) BMP, .., BMP, supp-high, supp-low, ..
441 uint16_t high=(uint16_t)(c>>16), low=(uint16_t)c; local
445 if (high < array[base] || (high==array[base] && low<array[base+1])) {
447 } else if (high < array[base+hi] || (high==array[base+hi] && low<array[base+hi+1])) {
453 } else if (high < array[iabs] || (high==array[iabs] && low<array[iabs+1])) {
  /external/icu/icu4c/source/i18n/
ucoleitr.cpp 49 int32_t high; member in struct:RCEI
112 buffer[bufferIndex].high = ixHigh;
174 buffer[bufferIndex].high = ixHigh;
335 uint32_t low = 0, high = 0; local
346 high = cei->getOffset();
361 *ixHigh = high;
388 int32_t low = 0, high = 0; local
403 high = cei->getOffset();
415 rceb.put((uint32_t)ce, low, high, *status);
425 pceBuffer.put(result, rcei->low, rcei->high, *status)
    [all...]
  /external/libmojo/ipc/
ipc_message_utils.cc 1006 uint64_t high, low; local
1007 if (!ParamTraits<uint64_t>::Read(m, iter, &high) ||
1012 if (high == 0 && low == 0)
1015 *r = base::UnguessableToken::Deserialize(high, low);
    [all...]
  /external/lzma/CPP/Windows/
FileIO.cpp 128 LONG high = (LONG)(distanceToMove >> 32); local
129 DWORD low = ::SetFilePointer(_handle, (LONG)(distanceToMove & 0xFFFFFFFF), &high, moveMethod);
133 newPosition = (((UInt64)(UInt32)high) << 32) + low;
  /external/lzma/Java/Tukaani/src/org/tukaani/xz/lzma/
LZMACoder.java 103 int high = (pos & literalPosMask) << lc; local
104 return low + high;
126 final short[] high = new short[HIGH_SYMBOLS]; field in class:LZMACoder.LengthCoder
137 RangeCoder.initProbs(high);
  /external/mesa3d/src/compiler/glsl/
opt_minmax.cpp 57 minmax_range(ir_constant *low = NULL, ir_constant *high = NULL)
60 this->high = high;
63 /* low is the lower limit of the range, high is the higher limit. NULL on
64 * low means negative infinity (unlimited) and on high positive infinity
69 ir_constant *high; member in class:__anon29243::minmax_range
248 if (!r0.high) {
249 ret.high = ismin ? r1.high : r0.high;
    [all...]
  /external/one-true-awk/
lex.c 439 int cond, low, mid, high; local
442 high = n - 1;
443 while (low <= high) {
444 mid = (low + high) / 2;
446 high = mid - 1;
  /external/opencv/cv/src/
cvcanny.cpp 63 int low, high; local
117 high = uh.i;
122 high = cvFloor( high_thresh );
253 if( m > high && !prev_flag && _map[j-mapstep] != 2 )
267 if( m > high && !prev_flag && _map[j-mapstep] != 2 )
282 if( m > high && !prev_flag && _map[j-mapstep] != 2 )

Completed in 776 milliseconds

1 2 3 4 5 67 8 91011>>