/external/valgrind/memcheck/tests/ |
H A D | 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 [all...] |
/external/valgrind/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...] |
H A D | 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]
|
/external/aac/libSBRdec/src/ |
H A D | HFgen_preFlat.h | 117 * \param[in] overlap number of overlap samples. 127 int sourceBuffer_e_current, int overlap,
|
H A D | sbr_dec.cpp | 133 FIXP_DBL **qmfImag, int noCols, int overlap, 140 FIXP_DBL **ppqmfReal = qmfReal + overlap; 141 FIXP_DBL **ppqmfImag = qmfImag + overlap; 144 slotOffset = noCols - overlap - LPC_ORDER; 179 for (col = slotOffset; col < overlap + LPC_ORDER; col++) { 218 static overlap buffer is required for each channel. Due to in-place 283 /* Number of QMF timeslots in the overlap buffer: */ 284 int ov_len = hSbrDec->LppTrans.pSettings->overlap; 507 for (i = 0; i < LPC_ORDER + hSbrDec->LppTrans.pSettings->overlap; i++) { 683 /* we need to patch usb for this frame as overlap ma 132 copyHarmonicSpectrum(int *xOverQmf, FIXP_DBL **qmfReal, FIXP_DBL **qmfImag, int noCols, int overlap, KEEP_STATES_SYNCED_MODE keepStatesSynced) argument 885 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, int codecFrameSize) argument [all...] |
/external/icu/icu4c/source/common/ |
H A D | unisetspan.cpp | 567 * with a partial overlap because the recursive algorithm would have tried 615 * with a partial overlap because the standard algorithm would have tried 618 * must be matched with a full overlap because the longest-match algorithm 643 // Consider strings; they may overlap with the span. 654 int32_t overlap=spanLengths[i]; local 655 if(overlap==ALL_CP_CONTAINED) { 662 // Try to match this string at pos-overlap..pos. 663 if(overlap>=LONG_SPAN) { 664 overlap=length16; 666 U16_BACK_1(s16, 0, overlap); // Lengt 693 int32_t overlap=spanLengths[i]; local 818 int32_t overlap=spanBackLengths[i]; local 859 int32_t overlap=spanBackLengths[i]; local 986 int32_t overlap=spanUTF8Lengths[i]; local 1032 int32_t overlap=spanUTF8Lengths[i]; local 1163 int32_t overlap=spanBackUTF8Lengths[i]; local 1212 int32_t overlap=spanBackUTF8Lengths[i]; local [all...] |
/external/libese/libese/tests/ |
H A D | bitspec_unittests.cpp | 37 } 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/icu/android_icu4j/src/main/java/android/icu/impl/ |
H A D | UnicodeSetStringSpan.java | 300 * must be matched with a partial overlap 345 * must be matched with a partial overlap 348 * must be matched with a full overlap because the longest-match algorithm 390 // Consider strings; they may overlap with the span. 404 int overlap = spanLengths[i]; 405 if (overlap == ALL_CP_CONTAINED) { 412 // Try to match this string at pos-overlap..pos. 413 if (overlap >= LONG_SPAN) { 414 overlap = length16; 416 overlap [all...] |
/external/wpa_supplicant_8/wpa_supplicant/ |
H A D | ctrl_iface_named_pipe.c | 62 OVERLAPPED overlap; member in struct:wpa_ctrl_dst 90 LPOVERLAPPED overlap); 97 LPOVERLAPPED overlap); 147 dst->overlap.hEvent = CreateEvent(NULL, TRUE, TRUE, NULL); 148 if (dst->overlap.hEvent == NULL) { 154 eloop_register_event(dst->overlap.hEvent, 155 sizeof(dst->overlap.hEvent), 181 if (ConnectNamedPipe(dst->pipe, &dst->overlap)) { 198 if (SetEvent(dst->overlap.hEvent)) 226 if (dst->overlap 254 ctrl_iface_write_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument 345 ctrl_iface_read_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument 541 OVERLAPPED overlap; member in struct:wpa_global_dst 685 global_iface_write_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument 761 global_iface_read_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument [all...] |
/external/libopus/celt/ |
H A D | modes.h | 54 int overlap; member in struct:OpusCustomMode
|
H A D | mdct.h | 67 const opus_val16 *window, int overlap, 70 /** Compute a backward MDCT (no scaling) and performs weighted overlap-add 75 int overlap, int shift, int stride, int arch); 84 int overlap, int shift, int stride, int arch); 94 int overlap, int shift, int stride, int arch);
|
H A D | mdct.c | 120 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...] |
H A D | celt_lpc.h | 64 const opus_val16 *window, int overlap, int lag, int n, int arch);
|
/external/libvpx/libvpx/vp8/decoder/ |
H A D | ec_types.h | 24 int overlap; member in struct:__anon12791
|
/external/libopus/celt/arm/ |
H A D | celt_ne10_mdct.c | 48 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...] |
H A D | mdct_arm.h | 42 const opus_val16 *window, int overlap, 47 const opus_val16 *window, int overlap,
|
/external/dng_sdk/source/ |
H A D | dng_misc_opcodes.cpp | 215 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 D | dng_image.cpp | 500 // Find the overlap with the image bounds. 502 dng_rect overlap = buffer.fArea & fBounds; local 506 if (overlap.NotEmpty ()) 511 temp.fArea = overlap; 513 temp.fData = buffer.DirtyPixel (overlap.t, 514 overlap.l, 523 if ((edgeOption != edge_none) && (overlap != buffer.fArea)) 692 dng_rect overlap = buffer.fArea & fBounds; local 694 if (overlap.NotEmpty ()) 699 temp.fArea = overlap; [all...] |
/external/libopus/celt/mips/ |
H A D | mdct_mipsr1.h | 61 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...] |
H A D | celt_mipsr1.h | 59 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
|
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/ |
H A D | UnicodeSetStringSpan.java | 296 * must be matched with a partial overlap 341 * must be matched with a partial overlap 344 * must be matched with a full overlap because the longest-match algorithm 386 // Consider strings; they may overlap with the span. 400 int overlap = spanLengths[i]; 401 if (overlap == ALL_CP_CONTAINED) { 408 // Try to match this string at pos-overlap..pos. 409 if (overlap >= LONG_SPAN) { 410 overlap = length16; 412 overlap [all...] |
/external/libopus/celt/dump_modes/ |
H A D | dump_modes.c | 95 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/valgrind/memcheck/tests/solaris/ |
H A D | strlcpy.stderr.exp | 8 Source and destination overlap in strlcpy(0x........, 0x........, 11)
|
/external/tensorflow/tensorflow/examples/android/jni/object_tracking/ |
H A D | tracked_object.cc | 117 const float overlap = detection_position.PascalScore(last_known_position_); local 118 if (overlap > kPositionOverlapThreshold) { 142 if (overlap < kPositionOverlapThreshold) {
|
/external/libxaac/decoder/ |
H A D | ixheaacd_lt_predict.h | 44 WORD32 *overlap, WORD32 frame_len,
|