/external/valgrind/main/none/tests/s390x/ |
H A D | mvc.c | 7 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/chromium_org/third_party/libvpx/source/libvpx/vp8/decoder/ |
H A D | ec_types.h | 26 int overlap; member in struct:__anon13073
|
/external/chromium_org/ui/gfx/ |
H A D | break_list_unittest.cc | 94 std::vector<std::pair<size_t, bool> > overlap; local 95 overlap.push_back(std::pair<size_t, bool>(0, true)); 96 overlap.push_back(std::pair<size_t, bool>(2, false)); 97 overlap.push_back(std::pair<size_t, bool>(3, true)); 98 overlap.push_back(std::pair<size_t, bool>(6, false)); 99 overlap.push_back(std::pair<size_t, bool>(7, true)); 100 EXPECT_TRUE(breaks.EqualsForTesting(overlap));
|
/external/libvpx/libvpx/vp8/decoder/ |
H A D | ec_types.h | 26 int overlap; member in struct:__anon24864
|
/external/aac/libFDK/include/ |
H A D | mdct.h | 117 } overlap; /**< Pointer to overlap memory */ member in struct:__anon153 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/chromium_org/third_party/opus/src/celt/dump_modes/ |
H A D | dump_modes.c | 89 fprintf(file, "#ifndef DEF_WINDOW%d\n", mode->overlap); 90 fprintf(file, "#define DEF_WINDOW%d\n", mode->overlap); 91 fprintf (file, "static const opus_val16 window%d[%d] = {\n", mode->overlap, mode->overlap); 92 for (j=0;j<mode->overlap;j++) 207 fprintf(file, "static const CELTMode mode%d_%d_%d = {\n", mode->Fs, mdctSize, mode->overlap); 209 fprintf(file, "%d,\t/* overlap */\n", mode->overlap); 232 fprintf(file, "window%d,\t/* window */\n", mode->overlap); 251 fprintf(file, "&mode%d_%d_%d,\n", mode->Fs, mdctSize, mode->overlap); 261 int overlap = 0; local [all...] |
/external/chromium_org/third_party/opus/src/celt/ |
H A D | modes.h | 43 #define OVERLAP(mode) ((mode)->overlap) 62 int overlap; member in struct:OpusCustomMode
|
H A D | celt_lpc.c | 227 int overlap, 242 celt_assert(overlap>=0); 243 if (overlap == 0) 249 for (i=0;i<overlap;i++) 223 _celt_autocorr( const opus_val16 *x, opus_val32 *ac, const opus_val16 *window, int overlap, int lag, int n, int arch ) argument
|
H A D | mdct.c | 106 const opus_val16 *window, int overlap, int shift, int stride) 131 const kiss_fft_scalar * OPUS_RESTRICT xp1 = in+(overlap>>1); 132 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1); 134 const opus_val16 * OPUS_RESTRICT wp1 = window+(overlap>>1); 135 const opus_val16 * OPUS_RESTRICT wp2 = window+(overlap>>1)-1; 136 for(i=0;i<((overlap+3)>>2);i++) 147 wp2 = window+overlap-1; 148 for(;i<N4-((overlap+3)>>2);i++) 212 const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride) 252 opus_ifft(l->kfft[shift], (kiss_fft_cpx *)f2, (kiss_fft_cpx *)(out+(overlap>> 105 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) argument 211 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) argument [all...] |
H A D | celt.c | 116 const opus_val16 *window, int overlap) 144 for (i=0;i<overlap;i++) 166 OPUS_MOVE(y+overlap, x+overlap, N-overlap); 114 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) argument
|
/external/libopus/celt/ |
H A D | modes.h | 43 #define OVERLAP(mode) ((mode)->overlap) 62 int overlap; member in struct:OpusCustomMode
|
H A D | celt_lpc.c | 227 int overlap, 242 celt_assert(overlap>=0); 243 if (overlap == 0) 249 for (i=0;i<overlap;i++) 223 _celt_autocorr( const opus_val16 *x, opus_val32 *ac, const opus_val16 *window, int overlap, int lag, int n, int arch ) argument
|
H A D | mdct.c | 106 const opus_val16 *window, int overlap, int shift, int stride) 131 const kiss_fft_scalar * OPUS_RESTRICT xp1 = in+(overlap>>1); 132 const kiss_fft_scalar * OPUS_RESTRICT xp2 = in+N2-1+(overlap>>1); 134 const opus_val16 * OPUS_RESTRICT wp1 = window+(overlap>>1); 135 const opus_val16 * OPUS_RESTRICT wp2 = window+(overlap>>1)-1; 136 for(i=0;i<((overlap+3)>>2);i++) 147 wp2 = window+overlap-1; 148 for(;i<N4-((overlap+3)>>2);i++) 212 const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride) 252 opus_ifft(l->kfft[shift], (kiss_fft_cpx *)f2, (kiss_fft_cpx *)(out+(overlap>> 105 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) argument 211 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) argument [all...] |
H A D | celt.c | 116 const opus_val16 *window, int overlap) 144 for (i=0;i<overlap;i++) 166 OPUS_MOVE(y+overlap, x+overlap, N-overlap); 114 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) argument
|
/external/chromium_org/storage/browser/fileapi/ |
H A D | sandbox_file_stream_writer.cc | 33 int64 overlap = file_size - file_offset; local 34 if (kint64max - overlap > quota) 35 quota += overlap;
|
/external/fio/lib/ |
H A D | prio_tree.c | 24 * 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 D | axmap.c | 220 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/qemu/ |
H A D | os-win32.c | 128 OVERLAPPED overlap; local 130 memset(&overlap, 0, sizeof(overlap)); 140 &overlap, NULL);
|
/external/aac/libFDK/src/ |
H A D | mdct.cpp | 100 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 D | lpp_tran.h | 181 UCHAR overlap; /*!< Overlap size */ member in struct:__anon216 226 const int overlap);
|
H A D | sbr_dec.cpp | 119 /* Number of QMF timeslots in the overlap buffer: */ 121 for(slot=0; slot<hSbrDec->LppTrans.pSettings->overlap; slot++) { 143 int halflen = (noCols >> 1) + hSbrDec->LppTrans.pSettings->overlap; 144 int totCols = noCols + hSbrDec->LppTrans.pSettings->overlap; 146 /* Number of QMF timeslots in the overlap buffer: */ 148 for(slot=0; slot<hSbrDec->LppTrans.pSettings->overlap; slot++) { 269 static overlap buffer is required for each channel. Du to in-place 337 /* Number of QMF timeslots in the overlap buffer: */ 338 ov_len = hSbrDec->LppTrans.pSettings->overlap; 530 hSbrDec->LppTrans.pSettings->overlap, 726 createSbrDec(SBR_CHANNEL * hSbrChannel, HANDLE_SBR_HEADER_DATA hHeaderData, TRANSPOSER_SETTINGS *pSettings, const int downsampleFac, const UINT qmfFlags, const UINT flags, const int overlap, int chan) argument [all...] |
/external/bsdiff/ |
H A D | bsdiff.c | 206 off_t overlap,Ss,lens; local 312 overlap=(lastscan+lenf)-(scan-lenb); 314 for(i=0;i<overlap;i++) { 315 if(new[lastscan+lenf-overlap+i]== 316 old[lastpos+lenf-overlap+i]) s++; 322 lenf+=lens-overlap;
|
/external/chromium_org/chrome/browser/ui/window_sizer/ |
H A D | window_sizer_common_unittest.cc | 79 gfx::Rect overlap = displays_[i].bounds(); variable 80 overlap.Intersect(match_rect); 81 int area = overlap.width() * overlap.height();
|
/external/llvm/include/llvm/CodeGen/ |
H A D | LiveIntervalUnion.h | 35 overlap(const LiveInterval::Segment &VRSeg, function in namespace:llvm 76 // Provide public access to the underlying map to allow overlap iteration.
|
/external/openfst/src/include/fst/ |
H A D | interval-set.h | 300 bool overlap = false; // point in both intervals_ and intervals local 303 if (it1->end <= it2->begin) { // no overlap - it1 first 306 } else if (it2->end <= it1->begin) { // no overlap - it2 first 310 overlap = true; 315 overlap = true; 319 overlap = true; 321 } else { // strict overlap 324 overlap = true; 326 if (only1 == true && only2 == true && overlap == true) 334 return only1 == true && only2 == true && overlap [all...] |