Searched defs:overlap (Results 1 - 25 of 71) sorted by relevance

123

/external/valgrind/none/tests/s390x/
H A Dmvc.c7 char overlap[]= "012345678901234567890"; variable
24 /* Destructive overlap #1 */
25 printf("------- Destructive overlap #1\n");
26 printf("before: |%s|\n", overlap);
28 ::"a" (overlap),"a" (overlap): "memory");
29 printf("after: |%s|\n", overlap);
31 /* Destructive overlap #2 */
32 printf("------- Destructive overlap #2\n");
40 /* Destructive overlap #
[all...]
/external/libvpx/libvpx/vp8/decoder/
H A Dec_types.h24 int overlap; member in struct:__anon11849
/external/aac/libFDK/include/
H A Dmdct.h117 } overlap; /**< Pointer to overlap memory */ member in struct:__anon325
123 int ov_offset; /**< overlap time data fill level */
134 * \param overlap pointer to FIXP_DBL overlap buffer.
135 * \param overlapBufferSize size in FIXP_DBLs of the given overlap buffer.
139 FIXP_DBL *overlap,
151 * \param fr right overlap window slope length
152 * \param wrs pointer to the right side overlap window coefficients.
190 * \brief Copy overlap tim
[all...]
/external/libese/libese/tests/
H A Dbitspec_unittests.cpp37 } overlap; member in struct:TestSpec
58 .overlap = {
144 EXPECT_EQ(0, bs_get(kTestSpec.overlap.upper6, byte));
145 EXPECT_EQ(0, bs_get(kTestSpec.overlap.lower6, byte));
146 EXPECT_EQ(0, bs_get(kTestSpec.overlap.all8, byte));
148 EXPECT_EQ(0x3f, bs_get(kTestSpec.overlap.upper6, byte));
149 EXPECT_EQ(0x3f, bs_get(kTestSpec.overlap.lower6, byte));
150 EXPECT_EQ(0xff, bs_get(kTestSpec.overlap.all8, byte));
154 bs_assign(&byte, kTestSpec.overlap.lower6, i);
155 EXPECT_EQ((i & (0x3f << 2)) >> 2, bs_get(kTestSpec.overlap
[all...]
/external/libopus/celt/
H A Dmodes.h54 int overlap; member in struct:OpusCustomMode
H A Dcelt_lpc.c232 int overlap,
247 celt_assert(overlap>=0);
248 if (overlap == 0)
254 for (i=0;i<overlap;i++)
228 _celt_autocorr( const opus_val16 *x, opus_val32 *ac, const opus_val16 *window, int overlap, int lag, int n, int arch ) argument
H A Dcelt.c185 const opus_val16 *window, int overlap, int arch)
213 /* If the filter didn't change, we don't need the overlap */
215 overlap=0;
216 for (i=0;i<overlap;i++)
238 OPUS_MOVE(y+overlap, x+overlap, N-overlap);
183 comb_filter(opus_val32 *y, opus_val32 *x, int T0, int T1, int N, opus_val16 g0, opus_val16 g1, int tapset0, int tapset1, const opus_val16 *window, int overlap, int arch) argument
H A Dmdct.c120 const opus_val16 *window, int overlap, int shift, int stride, int arch)
155 const kiss_fft_scalar * OPUS_RESTRICT xp1 = in+(overlap>>1);
156 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1);
158 const opus_val16 * OPUS_RESTRICT wp1 = window+(overlap>>1);
159 const opus_val16 * OPUS_RESTRICT wp2 = window+(overlap>>1)-1;
160 for(i=0;i<((overlap+3)>>2);i++)
171 wp2 = window+overlap-1;
172 for(;i<N4-((overlap+3)>>2);i++)
243 const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride, int arch)
265 kiss_fft_scalar * OPUS_RESTRICT yp = out+(overlap>>
119 clt_mdct_forward_c(const mdct_lookup *l, kiss_fft_scalar *in, kiss_fft_scalar * OPUS_RESTRICT out, const opus_val16 *window, int overlap, int shift, int stride, int arch) argument
242 clt_mdct_backward_c(const mdct_lookup *l, kiss_fft_scalar *in, kiss_fft_scalar * OPUS_RESTRICT out, const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride, int arch) argument
[all...]
/external/fio/lib/
H A Dprio_tree.c24 * i.e., selecting a set of stored intervals (vmas) that overlap with (map) a
27 * intervals (vmas) that overlap (map) with the input interval X (the set of
291 * overlap with the input interval X [radix_index, heap_index]. The enumeration
294 * 'm' is the number of prio_tree_nodes that overlap the interval X.
386 static inline int overlap(struct prio_tree_iter *iter, function
419 if (overlap(iter, r_index, h_index))
447 if (overlap(iter, r_index, h_index))
461 if (overlap(iter, r_index, h_index))
H A Daxmap.c220 unsigned long mask, overlap; local
228 * Mask off any potential overlap, only sets contig regions
230 overlap = al->map[offset] & mask;
231 if (overlap == mask)
234 while (overlap) {
235 unsigned long clear_mask = ~(1UL << ffz(~overlap));
238 overlap &= clear_mask;
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DIntTrieBuilder.java246 // compact once without overlap to improve folding
250 // compact again with overlap for minimum data array length
306 // compact once without overlap to improve folding
310 // compact again with overlap for minimum data array length
549 * - overlaps adjacent blocks as much as possible (if overlap == true)
551 * - moves and overlaps blocks that overlap with multiple values in the overlap region
554 * - try to move and overlap blocks that are not already adjacent
555 * @param overlap flag
557 private void compact(boolean overlap) argument
[all...]
/external/libopus/celt/arm/
H A Dcelt_ne10_mdct.c48 int overlap, int shift, int stride, int arch)
76 const kiss_fft_scalar * OPUS_RESTRICT xp1 = in+(overlap>>1);
77 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1);
79 const opus_val16 * OPUS_RESTRICT wp1 = window+(overlap>>1);
80 const opus_val16 * OPUS_RESTRICT wp2 = window+(overlap>>1)-1;
81 for(i=0;i<((overlap+3)>>2);i++)
92 wp2 = window+overlap-1;
93 for(;i<N4-((overlap+3)>>2);i++)
162 int overlap, int shift, int stride, int arch)
201 opus_ifft(st, (kiss_fft_cpx *)f, (kiss_fft_cpx*)(out+(overlap>>
44 clt_mdct_forward_neon(const mdct_lookup *l, kiss_fft_scalar *in, kiss_fft_scalar * OPUS_RESTRICT out, const opus_val16 *window, int overlap, int shift, int stride, int arch) argument
158 clt_mdct_backward_neon(const mdct_lookup *l, kiss_fft_scalar *in, kiss_fft_scalar * OPUS_RESTRICT out, const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride, int arch) argument
[all...]
/external/libopus/celt/dump_modes/
H A Ddump_modes.c95 fprintf(file, "#ifndef DEF_WINDOW%d\n", mode->overlap);
96 fprintf(file, "#define DEF_WINDOW%d\n", mode->overlap);
97 fprintf (file, "static const opus_val16 window%d[%d] = {\n", mode->overlap, mode->overlap);
98 for (j=0;j<mode->overlap;j++)
225 fprintf(file, "static const CELTMode mode%d_%d_%d = {\n", mode->Fs, mdctSize, mode->overlap);
227 fprintf(file, "%d, /* overlap */\n", mode->overlap);
250 fprintf(file, "window%d, /* window */\n", mode->overlap);
269 fprintf(file, "&mode%d_%d_%d,\n", mode->Fs, mdctSize, mode->overlap);
279 int overlap = 0; local
[all...]
/external/libopus/celt/mips/
H A Dcelt_mipsr1.h59 const opus_val16 *window, int overlap, int arch)
91 /* If the filter didn't change, we don't need the overlap */
93 overlap=0;
95 for (i=0;i<overlap;i++)
129 OPUS_MOVE(y+overlap, x+overlap, N-overlap);
133 for (i=overlap;i<N;i++)
57 comb_filter(opus_val32 *y, opus_val32 *x, int T0, int T1, int N, opus_val16 g0, opus_val16 g1, int tapset0, int tapset1, const opus_val16 *window, int overlap, int arch) argument
H A Dmdct_mipsr1.h61 const opus_val16 *window, int overlap, int shift, int stride, int arch)
98 const kiss_fft_scalar * OPUS_RESTRICT xp1 = in+(overlap>>1);
99 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1);
101 const opus_val16 * OPUS_RESTRICT wp1 = window+(overlap>>1);
102 const opus_val16 * OPUS_RESTRICT wp2 = window+(overlap>>1)-1;
103 for(i=0;i<((overlap+3)>>2);i++)
114 wp2 = window+overlap-1;
115 for(;i<N4-((overlap+3)>>2);i++)
187 const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride, int arch)
210 kiss_fft_scalar * OPUS_RESTRICT yp = out+(overlap>>
60 clt_mdct_forward(const mdct_lookup *l, kiss_fft_scalar *in, kiss_fft_scalar * OPUS_RESTRICT out, const opus_val16 *window, int overlap, int shift, int stride, int arch) argument
186 clt_mdct_backward(const mdct_lookup *l, kiss_fft_scalar *in, kiss_fft_scalar * OPUS_RESTRICT out, const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride, int arch) argument
[all...]
/external/aac/libFDK/src/
H A Dmdct.cpp100 FIXP_DBL *overlap,
103 hMdct->overlap.freq = overlap;
104 //FDKmemclear(overlap, overlapBufferSize*sizeof(FIXP_DBL));
166 FDKmemcpy(output, hMdct->overlap.time, buffered_samples*sizeof(FIXP_DBL));
186 FDKmemcpy(pTimeData, hMdct->overlap.time, nt*sizeof(FIXP_DBL));
189 pOvl = hMdct->overlap.freq + hMdct->ov_size - 1;
232 * If the previous transform block is big enough, enlarge previous window overlap,
233 * if not, then shrink current window overlap.
280 pOvl = hMdct->overlap
99 mdct_init( H_MDCT hMdct, FIXP_DBL *overlap, INT overlapBufferSize ) argument
[all...]
/external/aac/libSBRdec/src/
H A Dlpp_tran.h181 UCHAR overlap; /*!< Overlap size */ member in struct:__anon389
226 const int overlap);
/external/bsdiff/
H A Dbsdiff.cc149 off_t overlap,Ss,lens; local
260 overlap=(lastscan+lenf)-(scan-lenb);
262 for(i=0;i<overlap;i++) {
263 if(new_buf[lastscan+lenf-overlap+i]==
264 old_buf[lastpos+lenf-overlap+i]) s++;
270 lenf+=lens-overlap;
/external/dng_sdk/source/
H A Ddng_misc_opcodes.cpp215 dng_rect overlap = fArea & tile; local
217 if (overlap.NotEmpty ())
220 overlap.t = fArea.t + ConvertUint32ToInt32(
221 RoundUpUint32ToMultiple(static_cast<uint32>(overlap.t - fArea.t),
223 overlap.l = fArea.l + ConvertUint32ToInt32(
224 RoundUpUint32ToMultiple(static_cast<uint32>(overlap.l - fArea.l),
227 if (overlap.NotEmpty ())
230 overlap.b = overlap.t + ((overlap
406 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
625 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
987 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
1193 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
1373 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
1550 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
[all...]
H A Ddng_gain_map.cpp550 dng_rect overlap = fAreaSpec.Overlap (dstArea); local
552 if (overlap.NotEmpty ())
555 uint32 cols = overlap.W ();
567 for (int32 row = overlap.t; row < overlap.b; row += fAreaSpec.RowPitch ())
570 real32 *dPtr = buffer.DirtyPixel_real32 (row, overlap.l, plane);
575 overlap.l,
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DIntTrieBuilder.java244 // compact once without overlap to improve folding
248 // compact again with overlap for minimum data array length
304 // compact once without overlap to improve folding
308 // compact again with overlap for minimum data array length
547 * - overlaps adjacent blocks as much as possible (if overlap == true)
549 * - moves and overlaps blocks that overlap with multiple values in the overlap region
552 * - try to move and overlap blocks that are not already adjacent
553 * @param overlap flag
555 private void compact(boolean overlap) argument
[all...]
/external/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h35 overlap(const LiveInterval::Segment &VRSeg, function in namespace:llvm
76 // Provide public access to the underlying map to allow overlap iteration.
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DLiveIntervalUnion.h38 overlap(const LiveRange &VRSeg, function in namespace:llvm
81 // Provide public access to the underlying map to allow overlap iteration.
/external/syslinux/com32/chain/
H A Dchain.c45 static int overlap(const struct data_area *a, const struct data_area *b) function
217 possible overlap is the identity mapping. */
547 if (opt.file && opt.maps && overlap(&fdat, &sdat)) {
558 if ( ( opt.file && overlap(&fdat, &hdat)) ||
559 ( opt.maps && overlap(&sdat, &hdat)) ) {
/external/tpm2/
H A DSession.c598 INT16 overlap; local
608 // Figure out if there will be any overlap
609 overlap = bind->t.size + auth.t.size - sizeof(bind->t.name);
610 // There is overlap if the combined sizes are greater than will fit
611 if(overlap > 0)
613 // The overlap area is at the end of the Name
614 BYTE *result = &bind->t.name[bind->t.size - overlap];
616 // XOR the auth value into the Name for the overlap area
617 for(i = 0; i < overlap; i++)
622 // There is no overlap
[all...]

Completed in 3267 milliseconds

123