| /system/core/libpixelflinger/codeflinger/ |
| load_store.cpp | 176 void GGLAssembler::expand(integer_t& d, const component_t& s, int dbits)
180 expand(d, d, dbits);
182 expand(d, integer_t(s.reg, s.size(), s.flags), dbits);
186 void GGLAssembler::expand(component_t& d, const component_t& s, int dbits)
189 expand(r, s, dbits);
193 void GGLAssembler::expand(integer_t& dst, const integer_t& src, int dbits)
202 dst.s = dbits;
205 if (dbits<=sbits) {
213 RSB(AL, 0, d, s, reg_imm(s, LSL, dbits));
214 // d = (s<<dbits) - s
257 int dbits = dh - dl; local
[all...] |
| /system/core/libpixelflinger/ |
| buffer.cpp | 37 static uint32_t expand(uint32_t v, int sbits, int dbits);
252 uint32_t ggl_expand(uint32_t v, int sbits, int dbits)
254 return expand(v, sbits, dbits);
290 // expand a component from sbits to dbits
291 uint32_t expand(uint32_t v, int sbits, int dbits)
293 if (dbits > sbits) {
296 v = (v<<dbits) - v;
298 if (dbits % sbits) {
299 v <<= (dbits-sbits);
300 dbits -= sbits
330 const int dbits = dh-dl; local
[all...] |
| /external/skia/src/core/ |
| Sk64.cpp | 239 int dbits = SkCLZ(denom); local
242 bits = 32 + dbits - nbits;
249 denom <<= (dbits - 1);
|
| SkMath.cpp | 271 int dbits = SkCLZ(denom) - 1; local
272 int bits = shift_bias - nbits + dbits;
281 denom <<= dbits; local
|
| /external/grub/stage2/ |
| gunzip.c | 77 lbits and dbits tuning parameters.
410 This results of this trade are in the variables lbits and dbits
412 length codes can decode in one step, and dbits is the same thing for
425 about one bit more than those, so lbits is 8+1 and dbits is 5+1.
432 static int dbits = 6; /* bits in base distance lookup table */ variable
1047 bd = dbits;
[all...] |
| /external/llvm/lib/Target/CellSPU/ |
| SPUISelLowering.cpp | 1104 uint64_t dbits = DoubleToBits(FP->getValueAPF().convertToDouble()); local
[all...] |
| /external/v8/benchmarks/ |
| crypto.js | 43 var dbits; variable
149 dbits = bits;
151 BI_DB = dbits;
152 BI_DM = ((1<<dbits)-1);
153 BI_DV = (1<<dbits);
157 BI_F1 = BI_FP-dbits;
158 BI_F2 = 2*dbits-BI_FP;
550 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v4/ |
| v8-crypto.js | 35 var dbits; variable
141 dbits = bits;
143 BI_DB = dbits;
144 BI_DM = ((1<<dbits)-1);
145 BI_DV = (1<<dbits);
149 BI_F1 = BI_FP-dbits;
150 BI_F2 = 2*dbits-BI_FP;
542 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v5/ |
| v8-crypto.js | 35 var dbits; variable
141 dbits = bits;
143 BI_DB = dbits;
144 BI_DM = ((1<<dbits)-1);
145 BI_DV = (1<<dbits);
149 BI_F1 = BI_FP-dbits;
150 BI_F2 = 2*dbits-BI_FP;
542 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
[all...] |
| /external/webkit/PerformanceTests/SunSpider/tests/v8-v6/ |
| v8-crypto.js | 35 var dbits; variable
141 dbits = bits;
143 BI_DB = dbits;
144 BI_DM = ((1<<dbits)-1);
145 BI_DV = (1<<dbits);
149 BI_F1 = BI_FP-dbits;
150 BI_F2 = 2*dbits-BI_FP;
542 y = (y*(2-x*y%BI_DV))%BI_DV; // y == 1/x mod 2^dbits
[all...] |
