HomeSort by relevance Sort by last modified time
    Searched defs:shift (Results 251 - 275 of 828) sorted by null

<<11121314151617181920>>

  /external/chromium_org/third_party/libvpx/source/libvpx/test/
intrapred_test.cc 99 int sum = 0, shift = BlockSizeLog2Min1() + mbptr_->up_available + local
107 expected = (sum + (1 << (shift - 1))) >> shift;
  /external/chromium_org/third_party/libwebp/utils/
bit_writer.c 116 if (bw->range_ < 127) { // emit 'shift' bits out and renormalize
117 const int shift = kNorm[bw->range_]; local
119 bw->value_ <<= shift;
120 bw->nb_bits_ += shift;
264 const int shift = VP8L_WRITER_MAX_BITS - used; local
267 n_bits -= shift;
268 bits >>= shift; local
  /external/chromium_org/third_party/mesa/src/src/gallium/auxiliary/gallivm/
lp_bld_format_aos.c 161 unsigned shift; local
192 shift = 0;
212 shifts[i] = lp_build_const_int32(gallivm, shift);
223 shift += bits;
275 unsigned shift; local
301 shift = 0;
315 shifts[i] = lp_build_const_int32(gallivm, shift);
325 shift += bits;
lp_bld_swizzle.c 229 int shift = shifts[channel][i]; local
232 shift = -shift;
235 if(shift > 0)
236 tmp = LLVMBuildLShr(builder, a, lp_build_const_int_vec(bld->gallivm, type4, shift*type.width), "");
237 if(shift < 0)
238 tmp = LLVMBuildShl(builder, a, lp_build_const_int_vec(bld->gallivm, type4, -shift*type.width), "");
360 int shift; local
385 * Mask and shift the channels, trying to group as many channels in the
386 * same shift as possibl
    [all...]
  /external/chromium_org/third_party/mesa/src/src/gallium/state_trackers/wgl/
stw_pixelformat.c 56 } shift; member in struct:stw_pf_color_info
167 pfi->pfd.cRedShift = color->shift.red;
169 pfi->pfd.cGreenShift = color->shift.green;
171 pfi->pfd.cBlueShift = color->shift.blue;
173 pfi->pfd.cAlphaShift = color->shift.alpha;
  /external/chromium_org/third_party/mesa/src/src/mesa/swrast/
s_drawpix.c 344 /* Special case: shift 32-bit values down to Visual.depthBits */
345 const GLint shift = 32 - ctx->DrawBuffer->Visual.depthBits; local
351 if (shift == 0) {
357 span.array->z[col] = zSrc[col] >> shift;
543 * stencil offset/shift, GL_DEPTH_WRITEMASK and GL_STENCIL_WRITEMASK,
626 /* get stencil values, with shift/offset/mapping */
  /external/chromium_org/third_party/opus/src/celt/
kiss_fft.c 564 st->shift = 0;
565 while (nfft<<st->shift != base->nfft && st->shift < 32)
566 st->shift++;
567 if (st->shift>=32)
572 st->shift = -1;
601 if (cfg->shift < 0)
616 int shift; local
618 /* st->shift can be -1 */
619 shift = st->shift>0 ? st->shift : 0
675 int shift; local
    [all...]
  /external/chromium_org/third_party/opus/src/silk/fixed/
noise_shape_analysis_FIX.c 267 opus_int shift, slope_part, flat_part; local
272 shift = slope_part;
273 silk_memcpy( x_windowed + shift, x_ptr + shift, flat_part * sizeof(opus_int16) );
274 shift += flat_part;
275 silk_apply_sine_window( x_windowed + shift, x_ptr + shift, 2, slope_part );
  /external/chromium_org/third_party/skia/src/core/
SkEdge.cpp 16 the points into FDot6. This is modulated by the shift parameter, which
20 or pt * 256 for antialiasing. This is implemented as 1 << (shift + 6).
23 or pt >> 8 for antialiasing. This is implemented as pt >> (10 - shift).
28 // away data in value, so just perform a modify up-shift
35 int shift) {
39 float scale = float(1 << (shift + 6));
135 /* We store 1<<shift in a (signed) byte, so its maximum value is 1<<6 == 64.
159 // shift down dist (it is currently in dot6)
165 // each subdivision (shift value) cuts this dist (error) by 1/4
169 int SkQuadraticEdge::setQuadratic(const SkPoint pts[3], int shift)
266 int shift = fCurveShift; local
    [all...]
  /external/chromium_org/third_party/skia/src/images/
SkImageDecoder_libico.cpp 47 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors);
50 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors);
53 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors);
56 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors);
59 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors);
181 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors) = NULL;
280 int shift = 7 - (andPixelNo & 0x7); local
281 int m = 1 << shift;
284 placePixel(pixelNo, buf, xorOffset, x, y, w, bm, alphaByte, m, shift, colors);
299 SkBitmap* bm, int alphaByte, int m, int shift, SkPMColor* colors
    [all...]
  /external/chromium_org/third_party/skia/tests/
RegionTest.cpp 198 int shift = 32 - bits; local
199 rect->set(rand.nextU() >> shift, rand.nextU() >> shift,
200 rand.nextU() >> shift, rand.nextU() >> shift);
  /external/chromium_org/third_party/webrtc/modules/desktop_capture/x11/
x_server_pixel_buffer.cc 27 int shift = 0; local
30 shift += 16;
34 shift += 8;
38 shift += 4;
42 shift += 2;
45 shift += 1;
47 return shift;
  /external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/
rtcp_packet.cc 634 int shift = static_cast<uint16_t>(nack_list[i] - pid) - 1; local
635 if (shift >= 0 && shift <= 15) {
636 bitmask |= (1 << shift);
  /external/chromium_org/v8/src/
string-search.h 20 // Cap on the maximal shift in the Boyer-Moore implementation. By setting a
36 // Bad-char shift table stored in the state. It's length is the alphabet size.
158 // Store for the BoyerMoore(Horspool) bad char shift table.
165 // Store for the BoyerMoore good suffix shift table.
173 // shift table.
304 int shift = local
306 index += shift;
316 // Fall back on BMH shift.
324 int shift = j - bc_occ; local
325 if (gs_shift > shift) {
428 int shift = j - bc_occ; local
    [all...]
  /external/compiler-rt/lib/builtins/
gcc_personality_v0.c 86 uintptr_t shift = 0; local
91 result |= (byte & 0x7f) << shift;
92 shift += 7;
  /external/deqp/framework/common/
tcuFuzzyImageCompare.cpp 289 int shift = (int)(kernel.size() - 1) / 2; local
293 case TextureFormat::RGBA: separableConvolve<4, 4>(refFiltered, ref, shift, shift, kernel, kernel); break;
294 case TextureFormat::RGB: separableConvolve<4, 3>(refFiltered, ref, shift, shift, kernel, kernel); break;
301 case TextureFormat::RGBA: separableConvolve<4, 4>(cmpFiltered, cmp, shift, shift, kernel, kernel); break;
302 case TextureFormat::RGB: separableConvolve<4, 3>(cmpFiltered, cmp, shift, shift, kernel, kernel); break;
  /external/e2fsprogs/e2fsck/
revoke.c 202 int shift, tmp; local
215 shift = 0;
218 shift++;
219 journal->j_revoke->hash_shift = shift;
  /external/eigen/Eigen/src/Eigenvalues/
ComplexSchur.h 178 * shift. The cost of computing the Schur decomposition depends
277 /** Compute the shift in the current QR iteration. */
284 // exceptional shift, taken from http://www.netlib.org/eispack/comqr.f
288 // compute the shift as one of the eigenvalues of t, the 2x2
428 ComplexScalar shift = computeShift(iu, iter); local
430 rot.makeGivens(m_matT.coeff(il,il) - shift, m_matT.coeff(il+1,il));
  /external/eigen/Eigen/src/Householder/
HouseholderSequence.h 191 * The index \f$ i \f$ equals \p k + shift(), corresponding to the k-th column of the matrix \p v
194 * \sa setShift(), shift()
352 /** \brief Sets the shift of the Householder sequence.
353 * \param [in] shift New value for the shift.
357 * reflection. After this function is called, the object represents \f$ H = H_{\mathrm{shift}}
358 * H_{\mathrm{shift}+1} \ldots H_{n-1} \f$ and the i-th column of \p v corresponds to the (shift+i)-th
361 * \sa shift()
363 HouseholderSequence& setShift(Index shift)
370 Index shift() const { return m_shift; } \/**< \\brief Returns the shift of the Householder sequence. *\/ function in class:Eigen::HouseholderSequence
    [all...]
  /external/freetype/src/base/
ftbitmap.c 155 FT_Int shift = bit_last & 7; local
156 FT_UInt mask = 0xFF00U >> shift;
165 if ( shift > 0 )
ftoutln.c 56 #define SCALED( x ) ( ( (x) << shift ) - delta )
72 FT_Int shift; local
79 shift = func_interface->shift;
935 FT_Vector in, out, shift; local
973 /* shift only if turn is less than ~160 degrees */
978 /* shift components are aligned along lateral bisector */
980 shift.x = in.y + out.y;
981 shift.y = in.x + out.x;
984 shift.x = -shift.x
    [all...]
  /external/freetype/src/cff/
cffparse.c 292 FT_Long new_fraction_length, shift; local
297 shift = new_fraction_length - fraction_length;
299 if ( shift > 0 )
302 number *= power_tens[shift];
  /external/guava/guava/src/com/google/common/math/
BigIntegerMath.java 237 int shift = (log2 - DoubleUtils.SIGNIFICAND_BITS) & ~1; // even! local
239 * We have that x / 2^shift < 2^54. Our initial approximation to sqrtFloor(x) will be
240 * 2^(shift/2) * sqrtApproxWithDoubles(x / 2^shift).
242 sqrt0 = sqrtApproxWithDoubles(x.shiftRight(shift)).shiftLeft(shift >> 1);
300 int shift = Long.numberOfTrailingZeros(product); local
301 product >>= shift; local
319 shift += tz;
336 return listProduct(bignums).shiftLeft(shift);
    [all...]
  /external/iproute2/tc/
em_meta.c 33 " META_ID := id [ shift SHIFT ] [ mask MASK ]\n" \
36 " meta(indev shift 1 eq \"ppp\")\n" \
312 if (!bstrcmp(a, "shift")) {
313 unsigned long shift; local
321 shift = bstrtoul(a);
322 if (shift == ULONG_MAX) {
323 PARSE_ERR(a, "meta: invalid shift, must " \
328 obj->shift = (__u8) shift;
    [all...]
m_pedit.c 43 "\t\tATC:= at <atval> offmask <maskval> shift <shiftval>\n "
46 "\t\tNOTE: shiftval is a is a shift value\n "
139 sel->keys[hwm].shift = tkey->shift;
382 /* [at <someval> offmask <maskval> shift <shiftval>] */
385 __u32 atv=0,offmask=0x0,shift=0; local
400 if (get_u32(&shift, *argv, 0))
402 tkey->shift = shift;

Completed in 1607 milliseconds

<<11121314151617181920>>