| /src/sys/external/bsd/drm2/include/linux/ |
| sort.h | 40 sort(void *array, size_t nelem, size_t elemsize,
48 KASSERT(nelem <= SIZE_MAX/elemsize);
51 kheapsort(array, nelem, elemsize, cmp, tmp);
|
| mm.h | 118 kvcalloc(size_t nelem, size_t elemsize, gfp_t gfp)
122 if (SIZE_MAX/elemsize < nelem)
124 return kvzalloc(nelem * elemsize, gfp);
128 kvmalloc_array(size_t nelem, size_t elemsize, gfp_t gfp)
132 if (nelem > SIZE_MAX/elemsize)
134 return kmalloc(nelem * elemsize, gfp);
|
| /src/lib/libc/gen/ |
| ctype_guard.h | 115 #define __ctype_table_size(name, guard, nelem, elemsize) \
117 __CTASSERT(sizeof(guard) == _CTYPE_GUARD_SIZE + (nelem)*(elemsize)); \
119 ___STRING((nelem) * (elemsize)))
152 # define __ctype_table_guarded(name, guard, nelem, elemsize) \
157 __ctype_table_size(name, guard, nelem, elemsize)
176 # define __ctype_table_guarded(name, guard, nelem, elemsize) \
179 __ctype_table_size(name, guard, nelem, elemsize)
|
| getloadavg.c | 59 * Put `nelem' samples into `loadavg' array.
63 getloadavg(double loadavg[], int nelem)
70 _DIAGASSERT(nelem >= 0);
77 size = MIN((size_t)nelem, __arraycount(loadinfo.ldavg));
80 return nelem;
|
| /src/lib/libkvm/ |
| kvm_getloadavg.c | 69 * Put `nelem' samples into `loadavg' array.
73 kvm_getloadavg(kvm_t *kd, double loadavg[], int nelem)
80 return (getloadavg(loadavg, nelem));
101 nelem = MIN(nelem, sizeof(loadinfo.ldavg) / sizeof(fixpt_t));
102 for (i = 0; i < nelem; i++)
104 return (nelem);
|
| /src/usr.bin/sort/ |
| fsort.c | 90 int c, nelem; local in function:fsort
121 nelem = 0;
132 if (++nelem == max_recs) {
149 if (nelem >= max_recs
150 || (bufsize >= MAXBUFSIZE && nelem > 8))
173 radix_sort(keylist, keylist + max_recs, nelem);
177 append(keylist, nelem, outfp,
183 if (nelem != 0) {
185 append(keylist, nelem, tmp_fp, putrec);
|
| append.c | 75 append(RECHEADER **keylist, int nelem, FILE *fp, put_func_t put)
80 lastkey = keylist + nelem;
|
| /src/usr.bin/rs/ |
| rs.c | 82 static int nelem; variable in typeref:typename:int
190 nelem = ep - elem;
202 for (j = i; j < nelem; j += orows)
207 for (n = 0, i = 0; i < orows && n < nelem; i++) {
209 if (n++ >= nelem)
261 if (!nelem)
275 if (ocols > nelem)
276 ocols = nelem;
277 orows = nelem / ocols + (nelem % ocols ? 1 : 0)
[all...] |
| /src/usr.bin/cap_mkdb/ |
| cap_mkdb.c | 71 2048, /* nelem */
121 * Set nelem to twice the value returned by count_record().
123 openinfo.nelem = count_records(argv) << 1;
299 int nelem, slash; local in function:count_records
302 for(nelem = 0, slash = 0; *list && (fp = fopen(*list++, "r")); ) {
308 nelem++;
315 if (nelem == 0) {
317 nelem = 1;
318 } else if (!powerof2(nelem)) {
319 /* set nelem to nearest bigger power-of-two number *
[all...] |
| /src/sys/external/bsd/common/include/linux/ |
| overflow.h | 66 /* return basesize + elemsize*nelem saturated at SIZE_MAX */
68 __struct_size(size_t basesize, size_t elemsize, size_t nelem)
73 if ((arraysize = array_size(elemsize, nelem)) == SIZE_MAX)
|
| /src/common/lib/libc/rpc/ |
| xdr_array.c | 160 xdr_vector(XDR *xdrs, char *basep, u_int nelem, u_int elemsize,
167 for (i = 0; i < nelem; i++) {
|
| /src/lib/libc/db/hash/ |
| ndbm.c | 70 info.nelem = 1;
|
| hash.c | 281 int nelem; local in function:init_hash
283 nelem = 1;
318 if (info->nelem)
319 nelem = info->nelem;
330 if (init_htab(hashp, (size_t)nelem))
342 init_htab(HTAB *hashp, size_t nelem)
353 nelem = (nelem - 1) / hashp->FFACTOR + 1;
355 _DBFIT(nelem, uint32_t)
[all...] |
| /src/lib/libc/locale/ |
| rune.c | 80 alloc_guarded(size_t elemsize, size_t nelem)
87 if (nelem > SIZE_MAX/elemsize)
89 nbytes = page_size + roundup(elemsize*nelem, page_size);
107 free_guarded(void *q, size_t elemsize, size_t nelem)
115 _DIAGASSERT(elemsize <= SIZE_MAX/nelem);
116 nbytes = page_size + roundup(elemsize*nelem, page_size);
|
| /src/sys/external/bsd/libnv/dist/ |
| nv_kern_netbsd.c | 212 nv_calloc(size_t nelem, size_t elemsize)
215 if (nelem > SIZE_MAX/elemsize)
218 const size_t len = nelem * elemsize;
|
| /src/lib/libterminfo/ |
| term.c | 62 allocset(void *pp, int init, size_t nelem, size_t elemsize)
66 memset(*p, init, nelem * elemsize);
70 if ((*p = calloc(nelem, elemsize)) == NULL)
74 memset(*p, init, nelem * elemsize);
|
| /src/usr.sbin/services_mkdb/ |
| uniq.c | 48 .nelem = 32768,
|
| output_db.c | 61 .nelem = 32768,
|
| /src/lib/librumpclient/ |
| rumpclient.c | 1166 size_t nelem; local in function:rumpclient_exec
1191 for (nelem = 0; envp && envp[nelem]; nelem++)
1194 newenv = malloc(sizeof(*newenv) * (nelem+3));
1200 memcpy(&newenv[0], envp, nelem*sizeof(*envp));
1202 newenv[nelem] = envstr;
1203 newenv[nelem+1] = envstr2;
1204 newenv[nelem+2] = NULL;
|
| /src/sbin/iscsictl/ |
| iscsic_driverif.c | 292 size_t i, nelem; local in function:dump_data
297 nelem = min(16, len);
300 for (i = 0; i < nelem; i++) {
306 for (i = nelem; i < 16; i++) {
310 for (i = 0; i < nelem; i++) {
|
| /src/include/ |
| db.h | 152 unsigned int nelem; /* number of elements */ member in struct:__anon7d709f9c0408
|
| /src/tests/lib/libc/db/ |
| h_lfsr.c | 71 hi.nelem = 65536;
|
| /src/sys/kern/ |
| tty_pty.c | 198 * Allocate and zero array of nelem elements.
201 ptyarralloc(int nelem)
204 nelem += 10;
205 pt = kmem_zalloc(nelem * sizeof(*pt), KM_SLEEP);
210 ptyarrfree(struct pt_softc **pt, int nelem)
213 nelem += 10;
214 kmem_free(pt, nelem * sizeof(*pt));
|
| /src/lib/librumphijack/ |
| hijack.c | 1949 size_t nelem; local in function:execve
1968 for (nelem = 0; envp && envp[nelem]; nelem++)
1970 newenv = malloc(sizeof(*newenv) * (nelem+bonus));
1976 memcpy(newenv, envp, nelem*sizeof(*newenv));
1977 newenv[nelem+i] = dup2str;
1981 newenv[nelem+i] = __UNCONST(pwdinrumpstr);
1984 newenv[nelem+i] = NULL;
|
| /src/lib/libedit/ |
| history.c | 835 history_save_fp(TYPE(History) *h, size_t nelem, FILE *fp)
851 if (nelem != (size_t)-1) {
852 for (retval = HFIRST(h, &ev); retval != -1 && nelem-- > 0;
|
