/external/eigen/test/ |
H A D | sparse_permutations.cpp | 26 SparseMatrixType mat(rows, cols), up(rows,cols), lo(rows,cols); 33 lo = mat.template triangularView<Lower>(); 40 VERIFY_IS_APPROX(lo, DenseMatrix(mat_d.template triangularView<Lower>())); 81 res = lo.template selfadjointView<Lower>().twistedBy(p_null); 98 res = lo.template selfadjointView<Lower>(); 142 res.template selfadjointView<Upper>() = lo.template selfadjointView<Lower>().twistedBy(p); 146 res.template selfadjointView<Lower>() = lo.template selfadjointView<Lower>().twistedBy(p); 167 res = lo.template selfadjointView<Lower>().twistedBy(p);
|
/external/libunwind/doc/ |
H A D | unw_flush_cache.tex | 15 \Type{void} \Func{unw\_flush\_cache}(\Type{unw\_addr\_space\_t} \Var{as}, \Type{unw\_word\_t} \Var{lo}, \Type{unw\_word\_t} \Var{hi});\\ 20 relates to address-range \Var{lo} to \Var{hi} (non-inclusive) in the 26 \Var{lo} and \Var{hi} should be understood as a hint: 31 As a special case, if arguments \Var{lo} and \Var{hi} are both 0, all
|
/external/libvpx/libvpx/ |
H A D | tools_common.h | 58 #define LITERALU64(hi, lo) ((((uint64_t)hi) << 32) | lo)
|
/external/llvm/test/MC/Mips/ |
H A D | do_switch2.s | 26 addiu $2, $2, %lo(_gp_disp) 42 lw $1, %lo($JTI0_0)($1)
|
H A D | mips-expansions.s | 23 # CHECK: lw $10, %lo(symbol)($10) # encoding: [A,A,0x4a,0x8d] 28 # CHECK: sw $10, %lo(symbol)($1) # encoding: [A,A,0x2a,0xac] 38 # CHECK: ldc1 $f0, %lo(symbol)($1) 40 # CHECK: sdc1 $f0, %lo(symbol)($1)
|
/external/llvm/test/MC/Sparc/ |
H A D | sparc-pic.s | 28 or %i1, %lo(_GLOBAL_OFFSET_TABLE_+(.Ltmp5-.Ltmp4)), %i1 31 add %i2, %lo(AGlobalVar), %i2
|
/external/regex-re2/re2/testing/ |
H A D | compile_test.cc | 139 int lo; member in struct:re2::UTF8ByteRange 165 for (int j = utf8ranges[i].lo; j <= utf8ranges[i].hi; j++)
|
/external/chromium_org/third_party/boringssl/src/crypto/sha/asm/ |
H A D | sha512-armv4.pl | 55 $lo="LO"; 93 @ LO lo>>14^hi<<18 ^ lo>>18^hi<<14 ^ hi>>9^lo<<23 94 @ HI hi>>14^lo<<18 ^ hi>>18^lo<<14 ^ lo>>9^hi<<23 100 ldr $t2,[sp,#$Hoff+0] @ h.lo 112 ldr $t0,[sp,#$Foff+0] @ f.lo 116 ldr $t2,[sp,#$Goff+0] @ g.lo [all...] |
/external/chromium_org/third_party/cython/src/Cython/Plex/ |
H A D | Transitions.py | 130 lo = 0 131 # loop invariant: map[lo] <= code < map[hi] and hi - lo >= 2 132 while hi - lo >= 4: 134 mid = ((lo + hi) // 2) & ~1 138 lo = mid 139 # map[lo] <= code < map[hi] and hi - lo == 2 140 if map[lo] == code: 141 return lo [all...] |
/external/chromium_org/third_party/re2/re2/ |
H A D | tostring.cc | 25 static void AppendCCRange(string* t, Rune lo, Rune hi); 269 AppendCCRange(t_, i->lo, i->hi); 331 static void AppendCCRange(string* t, Rune lo, Rune hi) { argument 332 if (lo > hi) 334 AppendCCChar(t, lo); 335 if (lo < hi) {
|
H A D | parse.cc | 219 Rune r = re->ccb_->begin()->lo; 224 Rune r = re->ccb_->begin()->lo; 241 // If there isn't one, returns the CaseFold* with smallest f->lo bigger than r. 249 if (f[m].lo <= r && r <= f[m].hi) 251 if (r < f[m].lo) { 277 if ((r - f->lo) % 2) 286 if ((r - f->lo) % 2) 308 if (f == NULL || r < f->lo) 313 // Add lo-hi to the class, along with their fold-equivalent characters. 314 // If lo 316 AddFoldedRange(CharClassBuilder* cc, Rune lo, Rune hi, int depth) argument 1150 MaybeParseRepetition(StringPiece* sp, int* lo, int* hi) argument 1384 AddRangeFlags( Rune lo, Rune hi, Regexp::ParseFlags parse_flags) argument 2091 int lo, hi; local [all...] |
/external/openssl/crypto/sha/asm/ |
H A D | sha512-armv4.pl | 38 $lo="LO"; 76 @ LO lo>>14^hi<<18 ^ lo>>18^hi<<14 ^ hi>>9^lo<<23 77 @ HI hi>>14^lo<<18 ^ hi>>18^lo<<14 ^ lo>>9^hi<<23 83 ldr $t2,[sp,#$Hoff+0] @ h.lo 95 ldr $t0,[sp,#$Foff+0] @ f.lo 99 ldr $t2,[sp,#$Goff+0] @ g.lo [all...] |
/external/regex-re2/re2/ |
H A D | tostring.cc | 25 static void AppendCCRange(string* t, Rune lo, Rune hi); 269 AppendCCRange(t_, i->lo, i->hi); 331 static void AppendCCRange(string* t, Rune lo, Rune hi) { argument 332 if (lo > hi) 334 AppendCCChar(t, lo); 335 if (lo < hi) {
|
H A D | parse.cc | 219 Rune r = re->ccb_->begin()->lo; 224 Rune r = re->ccb_->begin()->lo; 241 // If there isn't one, returns the CaseFold* with smallest f->lo bigger than r. 249 if (f[m].lo <= r && r <= f[m].hi) 251 if (r < f[m].lo) { 277 if ((r - f->lo) % 2) 286 if ((r - f->lo) % 2) 308 if (f == NULL || r < f->lo) 313 // Add lo-hi to the class, along with their fold-equivalent characters. 314 // If lo 316 AddFoldedRange(CharClassBuilder* cc, Rune lo, Rune hi, int depth) argument 1150 MaybeParseRepetition(StringPiece* sp, int* lo, int* hi) argument 1384 AddRangeFlags( Rune lo, Rune hi, Regexp::ParseFlags parse_flags) argument 2091 int lo, hi; local [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_md5.cc | 36 MD5_u32plus lo, hi; member in struct:__tsan::__anon19639 150 ctx->lo = 0; 158 saved_lo = ctx->lo; 159 if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo) 190 used = ctx->lo & 0x3f; 205 ctx->lo <<= 3; 206 ctx->buffer[56] = ctx->lo; 207 ctx->buffer[57] = ctx->lo >> 8; 208 ctx->buffer[58] = ctx->lo >> 16; 209 ctx->buffer[59] = ctx->lo >> 2 [all...] |
/external/libvorbis/lib/ |
H A D | codebook.c | 285 long lo,hi; local 291 lo=(entry>>15)&0x7fff; 298 lo=0; 312 while(hi-lo>1){ 313 long p=(hi-lo)>>1; 314 long test=book->codelist[lo+p]>testword; 315 lo+=p&(test-1); 319 if(book->dec_codelengths[lo]<=read){ 320 oggpack_adv(b, book->dec_codelengths[lo]); 321 return(lo); [all...] |
/external/chromium_org/third_party/opus/src/celt/ |
H A D | rate.c | 254 int lo, hi; local 269 lo = 0; 273 int mid = (lo+hi)>>1; 292 lo = mid; 295 /*printf ("interp bisection gave %d\n", lo);*/ 299 int tmp = bits1[j] + (lo*bits2[j]>>ALLOC_STEPS); 529 int lo, hi, len, j; local 578 lo = 1; 584 int mid = (lo+hi) >> 1; 606 lo [all...] |
/external/libopus/celt/ |
H A D | rate.c | 254 int lo, hi; local 269 lo = 0; 273 int mid = (lo+hi)>>1; 292 lo = mid; 295 /*printf ("interp bisection gave %d\n", lo);*/ 299 int tmp = bits1[j] + (lo*bits2[j]>>ALLOC_STEPS); 529 int lo, hi, len, j; local 578 lo = 1; 584 int mid = (lo+hi) >> 1; 606 lo [all...] |
/external/chromium_org/third_party/freetype/src/base/ |
H A D | md5.c | 206 ctx->lo = 0; 215 saved_lo = ctx->lo; 216 if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo) 248 used = ctx->lo & 0x3f; 263 ctx->lo <<= 3; 264 ctx->buffer[56] = ctx->lo; 265 ctx->buffer[57] = ctx->lo >> 8; 266 ctx->buffer[58] = ctx->lo >> 16; 267 ctx->buffer[59] = ctx->lo >> 24;
|
/external/freetype/src/base/ |
H A D | md5.c | 207 ctx->lo = 0; 216 saved_lo = ctx->lo; 217 if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo) 249 used = ctx->lo & 0x3f; 264 ctx->lo <<= 3; 265 ctx->buffer[56] = ctx->lo; 266 ctx->buffer[57] = ctx->lo >> 8; 267 ctx->buffer[58] = ctx->lo >> 16; 268 ctx->buffer[59] = ctx->lo >> 24;
|
/external/llvm/lib/Support/ |
H A D | MD5.cpp | 183 : a(0x67452301), b(0xefcdab89), c(0x98badcfe), d(0x10325476), hi(0), lo(0) { 193 saved_lo = lo; 194 if ((lo = (saved_lo + Size) & 0x1fffffff) < saved_lo) 235 used = lo & 0x3f; 250 lo <<= 3; 251 buffer[56] = lo; 252 buffer[57] = lo >> 8; 253 buffer[58] = lo >> 16; 254 buffer[59] = lo >> 24;
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/base/ |
H A D | md5.c | 206 ctx->lo = 0; 215 saved_lo = ctx->lo; 216 if ((ctx->lo = (saved_lo + size) & 0x1fffffff) < saved_lo) 248 used = ctx->lo & 0x3f; 263 ctx->lo <<= 3; 264 ctx->buffer[56] = ctx->lo; 265 ctx->buffer[57] = ctx->lo >> 8; 266 ctx->buffer[58] = ctx->lo >> 16; 267 ctx->buffer[59] = ctx->lo >> 24;
|
/external/chromium_org/v8/test/cctest/ |
H A D | test-alloc.cc | 180 static uint32_t lo = 2345; local 181 lo = 18273 * (lo & 0xFFFF) + (lo >> 16); // Provably not 0. 182 return lo & 0xFFFF;
|
/external/openssl/crypto/bn/ |
H A D | bn_sqr.c | 211 BN_ULONG ln,lo,*p; local 278 lo= *p; 279 ln=(lo+c1)&BN_MASK2; 288 lo= *p; 289 ln=(lo+1)&BN_MASK2;
|
/external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/ |
H A D | lp_bld_pack.c | 237 * This differs to lp_build_interleave2 as that function would do the following (for lo): 247 * So interleave-lo would result in: 366 * lo = l0 __ l1 __ l2 __.. __ ln __ 381 LLVMValueRef lo, 431 res = lp_build_intrinsic_binary(builder, intrinsic, intr_vec_type, lo, hi); 451 lo, i*nlen*2, nlen); 453 lo, i*nlen*2 + nlen, nlen); 480 lo = LLVMBuildBitCast(builder, lo, dst_vec_type, ""); 485 res = LLVMBuildShuffleVector(builder, lo, h 378 lp_build_pack2(struct gallivm_state *gallivm, struct lp_type src_type, struct lp_type dst_type, LLVMValueRef lo, LLVMValueRef hi) argument 499 lp_build_packs2(struct gallivm_state *gallivm, struct lp_type src_type, struct lp_type dst_type, LLVMValueRef lo, LLVMValueRef hi) argument [all...] |