Searched defs:len (Results 451 - 475 of 5037) sorted by relevance

<<11121314151617181920>>

/external/libnl/tests/
H A Dcheck-addr.c104 socklen_t len = sizeof(sin); local
130 fail_if(nl_addr_fill_sockaddr(addr4, (struct sockaddr *) &sin, &len) != 0,
145 socklen_t len = sizeof(sin); local
171 fail_if(nl_addr_fill_sockaddr(addr6, (struct sockaddr *) &sin, &len) != 0,
/external/libopus/silk/
H A DLPC_analysis_filter.c46 const opus_int32 len, /* I Signal length */
63 silk_assert( d <= len );
73 celt_fir( in + d, num, out + d, len - d, d, mem, arch );
79 for( ix = d; ix < len; ix++ ) {
42 silk_LPC_analysis_filter( opus_int16 *out, const opus_int16 *in, const opus_int16 *B, const opus_int32 len, const opus_int32 d, int arch ) argument
H A Dbiquad_alt.c48 const opus_int32 len, /* I signal length (must be even) */
62 for( k = 0; k < len; k++ ) {
42 silk_biquad_alt( const opus_int16 *in, const opus_int32 *B_Q28, const opus_int32 *A_Q28, opus_int32 *S, opus_int16 *out, const opus_int32 len, opus_int stride ) argument
/external/libopus/silk/fixed/
H A Dvector_ops_FIX.c66 /* sum = for(i=0;i<len;i++)inVec1[i]*inVec2[i]; --- inner product */
69 /* * len should be positive 16bit integer. */
70 /* * only when len>6, memory access can be reduced by half. */
74 const opus_int len, /* I vector lengths */
79 return celt_inner_prod(inVec1, inVec2, len, arch);
83 for( i = 0; i < len; i++ ) {
93 const opus_int len /* I vector lengths */
98 for( i = 0; i < len; i++ ) {
71 silk_inner_prod_aligned( const opus_int16 *const inVec1, const opus_int16 *const inVec2, const opus_int len, int arch ) argument
/external/libtextclassifier/util/strings/
H A Dstringpiece.h42 StringPiece(const std::string &s, int offset, int len) argument
43 : StringPiece(s.data() + offset, len) {}
/external/libvorbis/test/
H A Dtest.c30 static int check_output (const float * data_in, unsigned len, float allowable);
80 check_output (const float * data_in, unsigned len, float allowable) argument
85 for (k = 0 ; k < len ; k++) {
/external/libvpx/libvpx/vp9/encoder/
H A Dvp9_cost.h38 int len) {
43 const int bit = (bits >> --len) & 1;
46 } while (len);
37 treed_cost(vpx_tree tree, const vpx_prob *probs, int bits, int len) argument
H A Dvp9_treewriter.h26 int len; member in struct:vp9_token
32 const vpx_prob *probs, int bits, int len,
35 const int bit = (bits >> --len) & 1;
38 } while (len);
44 vp9_write_tree(w, tree, probs, token->value, token->len, 0);
31 vp9_write_tree(vpx_writer *w, const vpx_tree_index *tree, const vpx_prob *probs, int bits, int len, vpx_tree_index i) argument
/external/libvpx/libvpx/
H A Dvpxstats.c82 void stats_write(stats_io_t *stats, const void *pkt, size_t len) { argument
84 (void)fwrite(pkt, 1, len, stats->file);
86 if (stats->buf.sz + len > stats->buf_alloc_sz) {
99 memcpy(stats->buf_ptr, pkt, len);
100 stats->buf.sz += len;
101 stats->buf_ptr += len;
/external/libxml2/doc/examples/
H A Dio1.c79 * @len: number of bytes to read
86 sqlRead(void * context, char * buffer, int len) { argument
89 if ((context == NULL) || (buffer == NULL) || (len < 0))
92 if (len > rlen) len = rlen;
93 memcpy(buffer, ptr, len);
94 rlen -= len;
95 return(len);
/external/ltp/lib/
H A Dfile_lock.c94 "fcntl(%d, %d, &flocks): type:%d whence:%d, start:%lld len:%lld\n",
133 int record_lock(int fd, int flags, int start, int len, char **errormsg) argument
147 flocks.l_len = len;
166 "fcntl(%d, %d, &flocks): type:%d whence:%d, start:%lld len:%lld\n",
/external/ltp/testcases/kernel/syscalls/confstr/
H A Dconfstr01.c82 int len; local
97 len = TEST_RETURN;
98 buf = SAFE_MALLOC(cleanup, len);
99 TEST(confstr(test_cases[i].value, buf, len));
101 if (TEST_RETURN != len || buf[len-1] != '\0') {
/external/ltp/testcases/kernel/syscalls/fallocate/
H A Dfallocate.h51 static inline long fallocate(int fd, int mode, loff_t offset, loff_t len) argument
55 return ltp_syscall(__NR_fallocate, fd, mode, offset, len);
60 __LONG_LONG_PAIR((off_t) (len >> 32),
61 (off_t) len));
/external/ltp/testcases/kernel/syscalls/fanotify/
H A Dfanotify05.c63 int len; local
83 len = read(fd_notify, &event, sizeof(event));
84 if (len < 0) {
/external/ltp/testcases/kernel/syscalls/mlock/
H A Dmlock01.c65 int len; member in struct:test_case_t
69 * range pointed to by addr and len are not valid mapped pages
103 TC[i].setupfunc(TC[i].len);
105 TEST(mlock(*(TC[i].addr), TC[i].len));
136 void setup1(int len) argument
138 addr1 = malloc(len);
/external/ltp/testcases/kernel/syscalls/munlock/
H A Dmunlock01.c82 int len; member in struct:test_case_t
110 TEST(munlock(*(TC[i].addr), TC[i].len));
116 "return=%ld", TC[i].addr, TC[i].len,
120 i, TC[i].len);
133 addr1 = malloc(TC[i].len);
136 TEST(mlock(*(TC[i].addr), TC[i].len));
142 TC[i].len, TEST_RETURN);
/external/ltp/testcases/kernel/syscalls/setgroups/
H A Dsetgroups01.c129 int len = NGROUPS, ngrps = 0; variable
162 len, TEST_ERRNO, strerror(TEST_ERRNO));
166 len, TEST_RETURN);
187 ngrps = GETGROUPS(cleanup, len, list);
191 len, errno, strerror(errno));
/external/ltp/testcases/network/multicast/mc_opts/
H A Dmc_verify_opts_error.c21 unsigned long len = 0; local
47 len = sizeof(gimr);
49 (s, IPPROTO_IP, IP_MULTICAST_IF, &gimr, (socklen_t *)&len) != 0)
52 len = sizeof(ttl);
54 (s, IPPROTO_IP, IP_MULTICAST_TTL, &ttl, (socklen_t *)&len) != 0)
68 len = sizeof(no_loop);
71 (socklen_t *)&len) != 0)
/external/ltp/testcases/network/rpc/rpc-tirpc/tests_pack/rpc_suite/tirpc/tirpc_auth_authsys_create/
H A Dtirpc_authsys_create.c49 int len; local
54 len = getgroups(NGRPS, aup_gids);
57 authSys = authsys_create(argc[1], uid, gid, len, aup_gids);
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mmap/
H A D11-2.c10 * continuing for len bytes to whole pages following the end
14 * 1. Map a file with size = 1/2 page_size, while len = 2 * page_size
57 size_t len; local
69 len = page_size * 2;
90 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
H A D11-3.c10 * continuing for len bytes to whole pages following the end
15 * with len = 2 * page_size
57 size_t len; local
70 len = page_size * 2;
90 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
H A D11-5.c10 * Thus, while the argument len
13 * operation, any partial page specified by the range [pa,pa+len).
21 * set len = 1/2 * page_size
50 ssize_t len; local
59 len = page_size / 2;
73 if (ftruncate(fd, len) == -1) {
78 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
85 for (i = len; i < page_size; i++)
93 pa[len + 1] = 'b';
94 munmap(pa, len);
[all...]
H A D11-6.c10 * Thus, while the argument len
13 * operation, any partial page specified by the range [pa,pa+len).
21 * set len = 1/2 * page_size
50 ssize_t len; local
59 len = page_size / 2;
73 if (ftruncate(fd, len) == -1) {
78 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
85 for (i = len; i < page_size; i++)
93 pa[len + 1] = 'b';
94 munmap(pa, len);
[all...]
H A D18-1.c76 size_t len; local
88 /* Set rlim.rlim_cur < len */
89 len = 1024 * 1024;
90 memlock_size = len / 2;
130 pa = mmap(NULL, len, PROT_READ | PROT_WRITE, MAP_SHARED, fd, 0);
137 munmap(pa, len);
144 munmap(pa, len);
/external/ltp/testcases/open_posix_testsuite/conformance/interfaces/munmap/
H A D3-1.c39 size_t len; local
53 len = page_size + 1;
73 pa = mmap(addr, len, prot, flag, fd, off);
87 if (munmap(pa2, len) == -1 && errno == EINVAL) {

Completed in 518 milliseconds

<<11121314151617181920>>