Searched refs:overlap (Results 1 - 25 of 94) sorted by relevance

1234

/external/valgrind/memcheck/tests/
H A Doverlap.stderr.exp1 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 Dmvc.stdout.exp7 ------- Destructive overlap #1
10 ------- Destructive overlap #2
13 ------- Destructive overlap #3 (max length)
15 ------- Non-destructive overlap buf[0:4] = buf[10:14]
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/icu/icu4c/source/common/
H A Dunisetspan.cpp565 * 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); // Lengt
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/libopus/celt/
H A Dmdct.h62 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);
H A Dmodes.h43 #define OVERLAP(mode) ((mode)->overlap)
62 int overlap; member in struct:OpusCustomMode
H A Dmdct.c106 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 Dcelt_lpc.h52 const opus_val16 *window, int overlap, int lag, int n, int arch);
H A Dcelt_decoder.c66 int overlap; member in struct:OpusCustomDecoder
91 celt_sig _decode_mem[1]; /* Size = channels*(DECODE_BUFFER_SIZE+mode->overlap) */
108 + (channels*(DECODE_BUFFER_SIZE+mode->overlap)-1)*sizeof(celt_sig)
155 st->overlap = mode->overlap;
267 const int overlap = OVERLAP(mode); local
280 /* IMDCT on the interleaved the sub-frames, overlap-add is performed by the IMDCT */
282 clt_mdct_backward(&mode->mdct, &X[b+c*N*B], out_mem[c]+N*b, mode->window, overlap, shift, B);
344 int overlap; local
355 overlap
698 int overlap; local
[all...]
H A Dcelt.c116 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
H A Dmodes.c362 mode->overlap = ((mode->shortMdctSize>>2)<<2);
368 window = (opus_val16*)opus_alloc(mode->overlap*sizeof(opus_val16));
373 for (i=0;i<mode->overlap;i++)
374 window[i] = Q15ONE*sin(.5*M_PI* sin(.5*M_PI*(i+.5)/mode->overlap) * sin(.5*M_PI*(i+.5)/mode->overlap));
376 for (i=0;i<mode->overlap;i++)
377 window[i] = MIN32(32767,floor(.5+32768.*sin(.5*M_PI* sin(.5*M_PI*(i+.5)/mode->overlap) * sin(.5*M_PI*(i+.5)/mode->overlap))));
/external/icu/android_icu4j/src/main/java/android/icu/impl/
H A DUnicodeSetStringSpan.java296 * 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...]
H A DTrie2Writable.java102 * does not overlap other index-2 blocks with the gap.
732 * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
734 * - moves and overlaps blocks that overlap with multiple values in the overlap region
737 * - try to move and overlap blocks that are not already adjacent
741 int blockLength, overlap;
793 /* look for maximum overlap (modulo granularity) with the previous, adjacent block */
794 for(overlap=blockLength-UTRIE2_DATA_GRANULARITY;
795 overlap>0 && !equal_int(data, (newStart-overlap), star
[all...]
/external/icu/icu4j/main/classes/core/src/com/ibm/icu/impl/
H A DUnicodeSetStringSpan.java292 * must be matched with a partial overlap
337 * must be matched with a partial overlap
340 * must be matched with a full overlap because the longest-match algorithm
382 // Consider strings; they may overlap with the span.
396 int overlap = spanLengths[i];
397 if (overlap == ALL_CP_CONTAINED) {
404 // Try to match this string at pos-overlap..pos.
405 if (overlap >= LONG_SPAN) {
406 overlap = length16;
408 overlap
[all...]
H A DTrie2Writable.java100 * does not overlap other index-2 blocks with the gap.
730 * - overlaps adjacent blocks as much as possible (if overlap==TRUE)
732 * - moves and overlaps blocks that overlap with multiple values in the overlap region
735 * - try to move and overlap blocks that are not already adjacent
739 int blockLength, overlap;
791 /* look for maximum overlap (modulo granularity) with the previous, adjacent block */
792 for(overlap=blockLength-UTRIE2_DATA_GRANULARITY;
793 overlap>0 && !equal_int(data, (newStart-overlap), star
[all...]
/external/wpa_supplicant_8/wpa_supplicant/
H A Dctrl_iface_named_pipe.c62 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
346 ctrl_iface_read_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument
542 OVERLAPPED overlap; member in struct:wpa_global_dst
686 global_iface_write_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument
763 global_iface_read_completed(DWORD err, DWORD bytes, LPOVERLAPPED overlap) argument
[all...]
/external/libvpx/libvpx/vp8/decoder/
H A Dec_types.h26 int overlap; member in struct:__anon11026
H A Derror_concealment.c69 /* Inserts a new overlap area value to the list of overlaps of a block */
72 int overlap)
75 if (overlap <= 0)
77 /* Find and assign to the next empty overlap node in the list of overlaps.
84 overlaps[i].overlap = overlap;
90 /* Calculates the overlap area between two 4x4 squares, where the first
93 * properly handle squares which do not overlap.
107 /* Calculates the overlap area for all blocks in a macroblock at position
119 * overlapped by bmi and calculate and assign overlap fo
70 assign_overlap(OVERLAP_NODE* overlaps, union b_mode_info *bmi, int overlap) argument
161 const int overlap = block_overlap(new_row, new_col, local
[all...]
/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_image.cpp500 // 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/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/libFDK/include/
H A Dmdct.h117 } overlap; /**< Pointer to overlap memory */ member in struct:__anon151
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/valgrind/memcheck/tests/solaris/
H A Dstrlcpy.stderr.exp8 Source and destination overlap in strlcpy(0x........, 0x........, 11)
/external/aac/libSBRdec/src/
H A Dlpp_tran.h181 UCHAR overlap; /*!< Overlap size */ member in struct:__anon215
226 const int overlap);
/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 907 milliseconds

1234