| /external/valgrind/main/memcheck/tests/ |
| overlap.stderr.exp | 1 Source and destination overlap in memcpy(0x........, 0x........, 21)
3 by 0x........: main (overlap.c:40)
5 Source and destination overlap in memcpy(0x........, 0x........, 21)
7 by 0x........: main (overlap.c:42)
9 Source and destination overlap in strncpy(0x........, 0x........, 21)
11 by 0x........: main (overlap.c:45)
13 Source and destination overlap in strncpy(0x........, 0x........, 21)
15 by 0x........: main (overlap.c:47)
17 Source and destination overlap in strcpy(0x........, 0x........)
19 by 0x........: main (overlap.c:54
[all...] |
| /external/valgrind/main/none/tests/s390x/ |
| mvc.stdout.exp | 7 ------- Destructive overlap #1
10 ------- Destructive overlap #2
13 ------- Destructive overlap #3 (max length)
15 ------- Non-destructive overlap buf[0:4] = buf[10:14]
|
| 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 #3 *
[all...] |
| /frameworks/av/media/libstagefright/codecs/mp3dec/src/ |
| s_tmp3dec_chan.h | 88 int32 overlap[SUBBANDS_NUMBER*FILTERBANK_BANDS]; member in struct:__anon38010
|
| pvmp3_imdct_synth.h | 85 int32 overlap[SUBBANDS_NUMBER*FILTERBANK_BANDS],
|
| pvmp3_mdct_6.h | 93 void pvmp3_mdct_6(int32 vec[], int32 *overlap);
|
| pvmp3_mdct_18.h | 96 void pvmp3_mdct_6(int32 vec[], int32 *overlap);
|
| /external/chromium_org/third_party/icu/source/common/ |
| unisetspan.cpp | 563 * with a partial overlap because the recursive algorithm would have tried
611 * with a partial overlap because the standard algorithm would have tried
614 * must be matched with a full overlap because the longest-match algorithm
639 // Consider strings; they may overlap with the span.
650 int32_t overlap=spanLengths[i]; local
651 if(overlap==ALL_CP_CONTAINED) {
658 // Try to match this string at pos-overlap..pos.
659 if(overlap>=LONG_SPAN) {
660 overlap=length16;
662 U16_BACK_1(s16, 0, overlap); // Length of the string minus the last code point
689 int32_t overlap=spanLengths[i]; local
814 int32_t overlap=spanBackLengths[i]; local
855 int32_t overlap=spanBackLengths[i]; local
982 int32_t overlap=spanUTF8Lengths[i]; local
1030 int32_t overlap=spanUTF8Lengths[i]; local
1162 int32_t overlap=spanBackUTF8Lengths[i]; local
1211 int32_t overlap=spanBackUTF8Lengths[i]; local
[all...] |
| /external/icu/icu4c/source/common/ |
| unisetspan.cpp | 565 * with a partial overlap because the recursive algorithm would have tried
613 * with a partial overlap because the standard algorithm would have tried
616 * must be matched with a full overlap because the longest-match algorithm
641 // Consider strings; they may overlap with the span.
652 int32_t overlap=spanLengths[i]; local
653 if(overlap==ALL_CP_CONTAINED) {
660 // Try to match this string at pos-overlap..pos.
661 if(overlap>=LONG_SPAN) {
662 overlap=length16;
664 U16_BACK_1(s16, 0, overlap); // Length of the string minus the last code point
691 int32_t overlap=spanLengths[i]; local
816 int32_t overlap=spanBackLengths[i]; local
857 int32_t overlap=spanBackLengths[i]; local
984 int32_t overlap=spanUTF8Lengths[i]; local
1032 int32_t overlap=spanUTF8Lengths[i]; local
1164 int32_t overlap=spanBackUTF8Lengths[i]; local
1213 int32_t overlap=spanBackUTF8Lengths[i]; local
[all...] |
| /external/chromium_org/third_party/opus/src/celt/ |
| mdct.h | 62 const opus_val16 *window, int overlap, int shift, int stride);
64 /** Compute a backward MDCT (no scaling) and performs weighted overlap-add
68 const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride);
|
| modes.h | 42 #ifndef OVERLAP
43 #define OVERLAP(mode) ((mode)->overlap)
62 int overlap; member in struct:OpusCustomMode
|
| 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>>1)))
[all...] |
| celt_lpc.h | 52 const opus_val16 *window, int overlap, int lag, int n, int arch);
|
| /external/libopus/celt/ |
| mdct.h | 62 const opus_val16 *window, int overlap, int shift, int stride);
64 /** Compute a backward MDCT (no scaling) and performs weighted overlap-add
68 const opus_val16 * OPUS_RESTRICT window, int overlap, int shift, int stride);
|
| modes.h | 42 #ifndef OVERLAP
43 #define OVERLAP(mode) ((mode)->overlap)
62 int overlap; member in struct:OpusCustomMode
|
| 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>>1)))
[all...] |
| celt_lpc.h | 52 const opus_val16 *window, int overlap, int lag, int n, int arch);
|