Searched defs:in (Results 126 - 150 of 1566) sorted by last modified time

1234567891011>>

/external/valgrind/main/coregrind/
H A Dm_signals.c18 This program is distributed in the hope that it will be useful, but
28 The GNU General Public License is contained in the file COPYING.
42 client process stack, it is extended in the same way the kernel
48 able to report on bugs in Valgrind. This means that we're also
66 if it appears to be blocked in a syscall.
73 signals get delivered in the same way as in the non-Valgrind case
84 per-thread). This info is duly recorded in the SCSS (static Client
85 signal state) in m_signals.c, and if the client later queries what
89 However, we set the real signal state in th
2363 fault_mask(Addr in) argument
[all...]
/external/valgrind/main/coregrind/m_syswrap/
H A Dsyswrap-generic.c19 This program is distributed in the hope that it will be useful, but
29 The GNU General Public License is contained in the file COPYING.
185 ML_(generic_PRE_sys_mmap), in m_syswrap, is the "normal case" handler for
316 - grow -> if can grow in-place, do so, else fail
323 - grow -> if can grow in-place, do so, else
395 /* try growing it in-place */
710 struct vki_sockaddr_in in; member in union:u
729 inet_to_name(&(laddr.in), llen, lname),
733 fd, inet_to_name(&(laddr.in), llen, lname));
808 have /proc support compiled in, o
[all...]
/external/valgrind/main/drd/tests/
H A Dcircular_buffer.c23 has built-in functions for atomic memory access.
35 /* Counting semaphore representing the number of data items in the buffer. */
40 int in; member in struct:__anon32785
43 /* Mutex that protects 'in'. */
98 b->in = 0;
127 int in; local
131 in = fetch_and_add(&b->in, 1);
132 if (in >= BUFFER_MAX)
134 fetch_and_add(&b->in,
[all...]
/external/valgrind/main/none/tests/mips32/
H A Dtest_fcsr.c6 unsigned long long in [] = {0x405EE0A3D70A3D71ULL, 0x3FF0000000000000ULL}; local
20 : "r" (in), "r" (out)
/external/tinyxml/
H A Dtinyxml.cpp15 software in a product, an acknowledgment in the product documentation
966 // in the STL case, cause the assignment method of the std::string to
969 // like a bug in the Microsoft STL implementation.
974 // reading in binary mode so that tinyxml can normalize the EOL
992 // If we have a file, assume it is all one big XML file, and read it in.
1001 // ...the XML processor MUST behave as if it normalized all line breaks in external
1045 // handle moving forward in the buffer.
1154 // The stream in code will only read one element, so don't
1586 TIXML_ISTREAM & operator >> (TIXML_ISTREAM & in, TiXmlNod argument
[all...]
H A Dtinyxmlparser.cpp15 software in a product, an acknowledgment in the product documentation
45 // Including the basic of this table, which determines the #bytes in the
48 // Beware of the non-characters in UTF-8:
211 // We *should* never get here, but in case we do, don't
356 /*static*/ bool TiXmlBase::StreamWhiteSpace( TIXML_ISTREAM * in, TIXML_STRING * tag ) argument
360 if ( !in->good() ) return false;
362 int c = in->peek();
367 *tag += (char) in->get();
371 /*static*/ bool TiXmlBase::StreamTo( TIXML_ISTREAM * in, in argument
618 StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag ) argument
886 StreamIn(TIXML_ISTREAM * in, TIXML_STRING * tag) argument
1207 StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag ) argument
1265 StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag ) argument
1387 StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag ) argument
1483 StreamIn( TIXML_ISTREAM * in, TIXML_STRING * tag ) argument
[all...]
/external/tremolo/Tremolo/
H A Dbitwise.c6 * Redistribution and use in source and binary forms, with or without
12 * * Redistributions in binary form must reproduce the above
14 * in the documentation and/or other materials provided with the
214 /* Read in bits without advancing the bitptr; bits <= 32 */
369 void report(char *in){ argument
370 fprintf(stderr,"%s",in);
H A Dfloor1.c6 * Redistribution and use in source and binary forms, with or without
12 * * Redistributions in binary form must reproduce the above
14 * in the documentation and/or other materials provided with the
251 * need to add 1 in all the cases when we wouldn't have done so before.
288 ogg_int32_t *floor1_inverse1(vorbis_dsp_state *vd,vorbis_info_floor *in, argument
290 vorbis_info_floor1 *info=(vorbis_info_floor1 *)in;
374 int floor1_inverse2(vorbis_dsp_state *vd,vorbis_info_floor *in, argument
376 vorbis_info_floor1 *info=(vorbis_info_floor1 *)in;
H A Dmdct.c6 * Redistribution and use in source and binary forms, with or without
12 * * Redistributions in binary form must reproduce the above
14 * in the documentation and/or other materials provided with the
45 that presented in the paper, but the basic structure remains if you
64 STIN void presymmetry(DATA_TYPE *in,int n2,int step){ argument
70 aX = in+n2-3;
78 }while(aX>=in+n4);
84 }while(aX>=in);
86 aX = in+n2-4;
87 bX = in;
412 mdct_backward(int n, DATA_TYPE *in) argument
435 mdct_shift_right(int n, DATA_TYPE *in, DATA_TYPE *right) argument
468 mdct_unroll_lap(int n0,int n1, int lW,int W, DATA_TYPE *in, DATA_TYPE *right, LOOKUP_T *w0, LOOKUP_T *w1, ogg_int16_t *out, int step, int start, int end ) argument
[all...]
H A Dres012.c6 * Redistribution and use in source and binary forms, with or without
12 * * Redistributions in binary form must reproduce the above
14 * in the documentation and/or other materials provided with the
104 ogg_int32_t **in,int *nonzero,int ch){
124 in[used++]=in[i];
152 /* this can be done quickly in assembly due to the quotient
171 if(vorbis_book_decodev_add(stagebook,in[j]+offset,&vd->opb,
175 if(vorbis_book_decodevs_add(stagebook,in[j]+offset,&vd->opb,
216 /* this can be done quickly in assembl
103 res_inverse(vorbis_dsp_state *vd,vorbis_info_residue *info, ogg_int32_t **in,int *nonzero,int ch) argument
[all...]
/external/tagsoup/src/org/ccil/cowan/tagsoup/
H A DHTMLScanner.java8 // TagSoup is distributed in the hope that it will be useful, but
9 // unless required by applicable law or agreed to in writing, TagSoup
276 * { current state, input character } and store the result in
278 * are present in the state table, we only do the computation for
279 * characters 0 to the highest character value in the state table.
282 * in the state table.
285 * to be in the range [-1 (inclusive), statetableIndexMaxChar (exclusive)].
290 * the value in the statetableIndex. If the value is -1, then
294 * to the start of the answer 4-tuple in the statetable.
298 * The highest character value seen in th
701 nicechar(int in) argument
[all...]
H A DParser.java8 // TagSoup is distributed in the hope that it will be useful, but
9 // unless required by applicable law or agreed to in writing, TagSoup
100 the document specified standalone="yes" in its XML declaration,
114 A value of "true" indicates that system IDs in declarations will
134 parser in ContentHandler.startElement() implement the
143 in ContentHandler.setDocumentLocator() implement the
166 errors as described in section 2.13 and Appendix B of the XML
174 the parser treats namespace declaration attributes as being in
218 translate colons into underscores in names.
232 transmit whitespace in elemen
874 trimquotes(String in) argument
[all...]
/external/tagsoup/templates/org/ccil/cowan/tagsoup/
H A DHTMLScanner.java8 // TagSoup is distributed in the hope that it will be useful, but
9 // unless required by applicable law or agreed to in writing, TagSoup
55 * { current state, input character } and store the result in
57 * are present in the state table, we only do the computation for
58 * characters 0 to the highest character value in the state table.
61 * in the state table.
64 * to be in the range [-1 (inclusive), statetableIndexMaxChar (exclusive)].
69 * the value in the statetableIndex. If the value is -1, then
73 * to the start of the answer 4-tuple in the statetable.
77 * The highest character value seen in th
480 nicechar(int in) argument
[all...]
/external/tcpdump/
H A Dprint-isakmp.c5 * Redistribution and use in source and binary forms, with or without
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
41 /* The functions from print-esp.c used in this file are only defined when both
251 cookie_find(cookie_t *in) argument
256 if (memcmp(in, &cookiecache[i].initiator, sizeof(*in)) == 0)
265 cookie_record(cookie_t *in, const u_char *bp2) argument
275 i = cookie_find(in);
327 UNALIGNED_MEMCPY(&cookiecache[ninitiator].initiator, in, sizeo
[all...]
H A Dsmbutil.c74 * in network byte order
88 * in halfword-swapped network byte order!
102 * It's originally in "100ns units since jan 1st 1601"
132 name_interpret(const u_char *in, const u_char *maxbuf, char *out) argument
137 if (in >= maxbuf)
139 TCHECK2(*in, 1);
140 len = (*in++) / 2;
148 TCHECK2(*in, 2);
149 if (in + 1 >= maxbuf)
151 if (in[
[all...]
/external/stlport/src/
H A Dios.cpp73 const ios_base::openmode ios_base::in; member in class:ios_base
206 // that is also set in the exception mask exceptions().
229 // Copy x's state to *this. This member function is used in the
/external/stlport/stlport/stl/
H A D_codecvt.h84 result in(state_type& __state, function
202 result in(state_type& __state,
299 result in(state_type& __state,
/external/stlport/test/unit/
H A Dfstream_test.cpp20 //size in Go
134 ifstream in("/tmp");
135 if (in.good()) {
137 getline(in, s);
138 CPPUNIT_ASSERT( in.fail() );
157 basic_fstream<char,char_traits<char> > f( "test_file.txt", ios_base::in | ios_base::out | ios_base::trunc );
192 basic_fstream<char,char_traits<char> > f( "test_file.txt", ios_base::in | ios_base::out | ios_base::trunc );
226 ifstream is("test_file.txt", ios_base::in | ios_base::binary);
245 ifstream is("test_file.txt", ios_base::in | ios_base::binary);
261 ifstream is("test_file.txt", ios_base::in | ios_bas
634 result in (state_type&, function in class:std::codecvt
[all...]
/external/strace/
H A Dfile.c8 * Redistribution and use in source and binary forms, with or without
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
215 # if O_LARGEFILE == 0 /* biarch platforms in 64-bit mode */
445 * hi,lo are "unsigned longs" and combined exactly this way in kernel:
879 * <linux/include/asm-x86_64/ia32.h> is not in the public includes set.
1050 newbuf->st_blksize = 0; /* not supported in old_stat */
1051 newbuf->st_blocks = 0; /* not supported in old_stat */
1744 * neither includes NUL in the returned count,
2032 /* Not much point in printin
2270 unsigned char *in = &buf[3 * size]; local
[all...]
/external/speex/libspeex/
H A Dfftwrap.c6 Redistribution and use in source and binary forms, with or without
13 - Redistributions in binary form must reproduce the above copyright
14 notice, this list of conditions and the following disclaimer in the
45 static int maximize_range(spx_word16_t *in, spx_word16_t *out, spx_word16_t bound, int len) argument
51 if (in[i]>max_val)
52 max_val = in[i];
53 if (-in[i]>max_val)
54 max_val = -in[i];
64 out[i] = SHL16(in[i], shift);
69 static void renorm_range(spx_word16_t *in, spx_word16_ argument
98 spx_fft(void *table, float *in, float *out) argument
116 spx_ifft(void *table, float *in, float *out) argument
156 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
162 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument
173 float *in; member in struct:fftw_config
204 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
222 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument
273 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
285 spx_fft(void *table, spx_word16_t *in, spx_word16_t *out) argument
297 spx_ifft(void *table, spx_word16_t *in, spx_word16_t *out) argument
315 spx_fft_float(void *table, float *in, float *out) argument
351 spx_ifft_float(void *table, float *in, float *out) argument
388 spx_fft_float(void *table, float *in, float *out) argument
392 spx_ifft_float(void *table, float *in, float *out) argument
[all...]
H A Dmdf.c6 Redistribution and use in source and binary forms, with or without
13 2. Redistributions in binary form must reproduce the above copyright
14 notice, this list of conditions and the following disclaimer in the
34 The echo canceller is based on the MDF algorithm described in:
41 double-talk is achieved using a variable learning rate as described in:
43 Valin, J.-M., On Adjusting the Learning Rate in Frequency Domain Echo
49 in the learning rate based on residual echo, double-talk and background
55 in most cases. The lower 16 bits are completely unreliable (due to the
56 fact that the update is done only on the top bits), but help in the
62 reduce the effect of quantization noise in th
193 filter_dc_notch16(const spx_int16_t *in, spx_word16_t radius, spx_word16_t *out, int len, spx_mem_t *mem, int stride) argument
686 speex_echo_cancel(SpeexEchoState *st, const spx_int16_t *in, const spx_int16_t *far_end, spx_int16_t *out, spx_int32_t *Yout) argument
692 speex_echo_cancellation(SpeexEchoState *st, const spx_int16_t *in, const spx_int16_t *far_end, spx_int16_t *out) argument
[all...]
H A Dnb_celp.c4 Redistribution and use in source and binary forms, with or without
11 - Redistributions in binary form must reproduce the above copyright
12 notice, this list of conditions and the following disclaimer in the
279 spx_word16_t *in = (spx_word16_t*)vin; local
299 highpass(in, in, st->frameSize, (st->isWideband?HIGHPASS_WIDEBAND:HIGHPASS_NARROWBAND)|HIGHPASS_INPUT, st->mem_hp);
310 w_sig[i] = EXTRACT16(SHR32(MULT16_16(in[i-st->windowSize+st->frameSize],st->window[i]),SIG_SHIFT));
313 autocorr[0] = ADD16(autocorr[0],MULT16_16_Q15(autocorr[0],st->lpc_floor)); /* Noise floor in auto-correlation domain */
315 /* Lag windowing: equivalent to filtering in the power-spectrum domain */
366 SPEEX_COPY(st->sw+diff, in, s
[all...]
H A Dresample.c7 Redistribution and use in source and binary forms, with or without
14 2. Redistributions in binary form must reproduce the above copyright
15 notice, this list of conditions and the following disclaimer in the
47 Center for Computer Research in Music and Acoustics (CCRMA),
52 interpolation instead of linear interpolation in the above paper. This
56 (e.g. 2/3), and get rid of the rounding operations in the inner loop.
332 static int resampler_basic_direct_single(SpeexResamplerState *st, spx_uint32_t channel_index, const spx_word16_t *in, spx_uint32_t *in_len, spx_word16_t *out, spx_uint32_t *out_len) argument
349 const spx_word16_t *iptr = & in[last_sample];
384 static int resampler_basic_direct_double(SpeexResamplerState *st, spx_uint32_t channel_index, const spx_word16_t *in, spx_uint32_t *in_len, spx_word16_t *out, spx_uint32_t *out_len) argument
401 const spx_word16_t *iptr = & in[last_sampl
433 resampler_basic_interpolate_single(SpeexResamplerState *st, spx_uint32_t channel_index, const spx_word16_t *in, spx_uint32_t *in_len, spx_word16_t *out, spx_uint32_t *out_len) argument
496 resampler_basic_interpolate_double(SpeexResamplerState *st, spx_uint32_t channel_index, const spx_word16_t *in, spx_uint32_t *in_len, spx_word16_t *out, spx_uint32_t *out_len) argument
849 speex_resampler_process_int(SpeexResamplerState *st, spx_uint32_t channel_index, const spx_int16_t *in, spx_uint32_t *in_len, spx_int16_t *out, spx_uint32_t *out_len) argument
890 speex_resampler_process_float(SpeexResamplerState *st, spx_uint32_t channel_index, const float *in, spx_uint32_t *in_len, float *out, spx_uint32_t *out_len) argument
963 speex_resampler_process_interleaved_float(SpeexResamplerState *st, const float *in, spx_uint32_t *in_len, float *out, spx_uint32_t *out_len) argument
984 speex_resampler_process_interleaved_int(SpeexResamplerState *st, const spx_int16_t *in, spx_uint32_t *in_len, spx_int16_t *out, spx_uint32_t *out_len) argument
[all...]
H A Dsb_celp.c4 Redistribution and use in source and binary forms, with or without
11 - Redistributions in binary form must reproduce the above copyright
12 notice, this list of conditions and the following disclaimer in the
320 spx_word16_t *in = (spx_word16_t*)vin; local
334 low = in;
335 high = in+st->frame_size;
339 qmf_decomp(in, h0, low, high, st->full_frame_size, QMF_ORDER, st->h0_mem, stack);
345 /*FIXME: Are the two signals (low, high) in sync? */
400 autocorr[0] = ADD16(autocorr[0],MULT16_16_Q15(autocorr[0],st->lpc_floor)); /* Noise floor in auto-correlation domain */
402 /* Lag windowing: equivalent to filtering in th
[all...]
H A Dscal.c6 Redistribution and use in source and binary forms, with or without
13 2. Redistributions in binary form must reproduce the above copyright
14 notice, this list of conditions and the following disclaimer in the
34 The algorithm implemented here is described in:
137 EXPORT void speex_decorrelate(SpeexDecorrState *st, const spx_int16_t *in, spx_int16_t *out, int strength) argument
171 buff[i+st->frame_size] = in[i*st->channels+ch];

Completed in 5238 milliseconds

1234567891011>>