Searched refs:nentries (Results 1 - 25 of 50) sorted by relevance

12

/freebsd-9.3-release/sys/cddl/compat/opensolaris/sys/
H A Dacl.h36 void aces_from_acl(ace_t *aces, int *nentries, const struct acl *aclp);
37 int acl_from_aces(struct acl *aclp, const ace_t *aces, int nentries);
/freebsd-9.3-release/sys/boot/efi/libefi/
H A Dhandles.c40 int nentries; variable
48 idx = nentries;
49 nentries += count;
50 sz = nentries * sizeof(struct entry);
52 for (unit = 0; idx < nentries; idx++, unit++) {
65 for (idx = 0; idx < nentries; idx++) {
80 for (idx = 0; idx < nentries; idx++) {
/freebsd-9.3-release/sys/gnu/fs/xfs/FreeBSD/support/
H A Dktrace.c58 ktrace_alloc(int nentries, int sleep) argument
78 if (nentries == ktrace_zentries) {
82 ktep = (ktrace_entry_t*)kmem_zalloc((nentries * sizeof(*ktep)),
101 ktp->kt_nentries = nentries;
235 int nentries; local
245 nentries = ktrace_nentries(ktp);
247 if (index < nentries) {
251 if (index > nentries)
306 int nentries = ktrace_nentries(ktp); local
310 while (new_index >= nentries) {
[all...]
/freebsd-9.3-release/sys/cddl/compat/opensolaris/kern/
H A Dopensolaris_acl.c102 acl_from_aces(struct acl *aclp, const ace_t *aces, int nentries) argument
108 if (nentries < 1) {
113 if (nentries > ACL_MAX_ENTRIES) {
125 aclp->acl_cnt = nentries;
127 for (i = 0; i < nentries; i++) {
172 aces_from_acl(ace_t *aces, int *nentries, const struct acl *aclp) argument
180 *nentries = aclp->acl_cnt;
/freebsd-9.3-release/lib/libelf/
H A Dlibelf_ar.c211 size_t n, nentries, off; local
226 GET_WORD(p, nentries);
229 if (nentries == 0 || p + nentries * INTSZ >= end) {
234 /* Allocate space for a nentries + a sentinel. */
235 if ((symtab = malloc(sizeof(Elf_Arsym) * (nentries+1))) == NULL) {
240 s = p + (nentries * INTSZ); /* start of the string table. */
242 for (n = nentries, sym = symtab; n > 0; n--) {
268 *count = e->e_u.e_ar.e_symtabsz = nentries + 1;
/freebsd-9.3-release/sys/kern/
H A Dsubr_hash.c109 phashinit(int elements, struct malloc_type *type, u_long *nentries) argument
126 *nentries = hashsize;
/freebsd-9.3-release/contrib/gcclibs/libcpp/
H A Dsymtab.c181 hashnode *nentries, *p, *limit; local
185 nentries = XCNEWVEC (hashnode, size);
198 if (nentries[index])
205 while (nentries[index]);
207 nentries[index] = *p;
214 table->entries = nentries;
287 fprintf (stderr, "\nString pool\nentries\t\t%lu\n",
/freebsd-9.3-release/contrib/ntp/sntp/libevent/
H A Devmap.c206 if (map->nentries <= slot) {
207 int nentries = map->nentries ? map->nentries : 32; local
210 while (nentries <= slot)
211 nentries <<= 1;
213 tmp = (void **)mm_realloc(map->entries, nentries * msize);
217 memset(&tmp[map->nentries], 0,
218 (nentries - map->nentries) * msiz
[all...]
/freebsd-9.3-release/usr.sbin/pmcstat/
H A Dpmcpl_callgraph.c403 int n, nentries; local
431 nentries = cgn - sortbuffer;
432 assert(nentries <= pmcstat_cgnode_hash_count);
434 if (nentries == 0) {
439 qsort(sortbuffer, nentries, sizeof(struct pmcstat_cgnode *),
447 for (cgn = sortbuffer, n = 0; n < nentries; n++, cgn++) {
579 int n, nentries; local
611 nentries = cgn - sortbuffer;
612 assert(nentries <= pmcstat_cgnode_hash_count);
614 if (nentries
[all...]
/freebsd-9.3-release/sys/dev/cxgb/ulp/tom/
H A Dcxgb_l2t.h74 unsigned int nentries; /* number of entries */ member in struct:l2t_data
H A Dcxgb_l2t.c73 return jhash_2words(key, ifindex, 0) & (d->nentries - 1);
296 for (e = d->rover, end = &d->l2tab[d->nentries]; e != end; ++e) {
415 d->nentries = l2t_capacity;
435 for (i = 0; i < d->nentries; ++i)
/freebsd-9.3-release/sys/dev/qlxgbe/
H A Dql_tmplt.h41 uint16_t nentries; member in struct:_q8_tmplt_hdr
H A Dql_misc.c1114 uint32_t nentries)
1119 for (i = start_idx; ((i < nentries) && (!proc_end)); i++) {
1205 if (qla_tmplt_execute(ha, buf, index , &end_idx, hdr->nentries)) {
1215 if (qla_tmplt_execute(ha, buf, index , &end_idx, hdr->nentries)) {
1227 if (qla_tmplt_execute(ha, buf, index , &end_idx, hdr->nentries)) {
1256 if (qla_tmplt_execute(ha, buf, index , &end_idx, hdr->nentries)) {
1285 if (qla_tmplt_execute(ha, buf, index , &end_idx, hdr->nentries)) {
1297 if (qla_tmplt_execute(ha, buf, index , &end_idx, hdr->nentries)) {
1113 qla_tmplt_execute(qla_host_t *ha, uint8_t *buf, int start_idx, int *end_idx, uint32_t nentries) argument
/freebsd-9.3-release/contrib/amd/amd/
H A Dinfo_ldap.c360 int i, err = 0, nentries = 0; local
407 nentries = ldap_count_entries(a->ldap, res);
408 if (nentries == 0) {
457 int i, err = 0, nvals = 0, nentries = 0; local
527 nentries = ldap_count_entries(a->ldap, res);
528 dlog("Search found %d entries\n", nentries);
529 if (nentries == 0) {
/freebsd-9.3-release/usr.sbin/flowctl/
H A Dflowctl.c235 (resp->nentries * sizeof(struct flow_entry_data)))))
265 for (i = 0; i < resp->nentries; i++, fle++) {
298 for (i = 0; i < resp->nentries; i++, fle6++) {
331 for (i = 0; i < resp->nentries; i++, fle++) {
374 for (i = 0; i < resp->nentries; i++, fle6++) {
/freebsd-9.3-release/usr.sbin/setfmac/
H A Dsetfmac.c60 } *entries, /* entries[0..nentries] */
62 size_t nentries; /* size of entries list */ member in struct:label_spec
255 spec->nentries = nlines;
277 (long)spec->nentries);
289 spec->nentries = 1;
290 spec->entries = calloc(spec->nentries, sizeof(*spec->entries));
409 ent < &ls->entries[ls->nentries]; ent++) {
/freebsd-9.3-release/sbin/nvmecontrol/
H A Dlogpage.c90 int i, nentries; local
102 nentries = size/sizeof(struct nvme_error_information_entry);
103 for (i = 0; i < nentries; i++, entry++) {
/freebsd-9.3-release/contrib/bind9/lib/dns/
H A Dadb.c150 unsigned int nentries; member in struct:dns_adb
527 while (nbuckets[i] != 0 && adb->nentries >= nbuckets[i])
539 for (i = 0; i < adb->nentries; i++)
574 for (i = 0; i < adb->nentries; i++) {
604 DESTROYMUTEXBLOCK(adb->entrylocks, adb->nentries);
606 sizeof(*adb->entries) * adb->nentries);
608 sizeof(*adb->deadentries) * adb->nentries);
610 sizeof(*adb->entrylocks) * adb->nentries);
612 sizeof(*adb->entry_sd) * adb->nentries);
614 sizeof(*adb->entry_refcnt) * adb->nentries);
[all...]
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_log.h175 int nentries,
H A Dxfsidbg.c4630 int nentries; local
4637 nentries = ktrace_nentries(xfs_alloc_trace_buf);
4639 count = nentries;
4641 if ((count <= 0) || (count > nentries)) {
4642 qprintf("Invalid count. There are %d entries.\n", nentries);
4647 if (count != nentries) {
4652 skip_entries = nentries - count - 1;
4950 int nentries; local
4957 nentries = ktrace_nentries(xfs_attr_trace_buf);
4959 count = nentries;
5086 int nentries; local
5442 int nentries; local
5658 int nentries; local
6068 int nentries; local
6114 int nentries; local
[all...]
/freebsd-9.3-release/crypto/openssh/
H A Dssh-agent.c116 int nentries; member in struct:__anon4735
179 idtable[i].nentries = 0;
242 buffer_put_int(&msg, tab->nentries);
416 if (tab->nentries < 1)
418 "internal error: tab->nentries %d",
419 tab->nentries);
422 tab->nentries--;
446 tab->nentries = 0;
472 tab->nentries--;
554 tab->nentries
[all...]
/freebsd-9.3-release/bin/ps/
H A Dps.c183 int descendancy, nentries, nkept, nselectors; local
511 nentries = -1;
512 kp = kvm_getprocs(kd, what, flag, &nentries);
513 if ((kp == NULL && nentries > 0) || (kp != NULL && nentries < 0))
516 if (nentries > 0) {
517 if ((kinfo = malloc(nentries * sizeof(*kinfo))) == NULL)
519 for (i = nentries; --i >= 0; ++kp) {
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c1311 size_t i, nentries = 0; local
1314 nentries++;
1316 sorted = dt_alloc(dtp, nentries * sizeof (dt_ahashent_t *));
1327 dt_aggregate_qsort(dtp, sorted, nentries,
1335 qsort(sorted, nentries, sizeof (dt_ahashent_t *), sfunc);
1340 for (i = 0; i < nentries; i++) {
1433 size_t nentries = 0, nbundles = 0, start, zsize = 0, bundlesize; local
1527 nentries++;
1530 if (nentries == 0) {
1604 * (or nentries woul
[all...]
/freebsd-9.3-release/usr.bin/yacc/
H A Doutput.c48 static int nentries; variable
492 nentries = 0;
500 j = nentries - 1;
508 for (k = nentries - 1; k > j; k--)
512 nentries++;
526 pos = NEW2(nentries, short);
538 for (i = 0; i < nentries; i++)
/freebsd-9.3-release/usr.bin/w/
H A Dw.c136 int ch, i, nentries, nusers, wcmd, longidle, longattime, dropgid; local
279 if ((kp = kvm_getprocs(kd, KERN_PROC_ALL, 0, &nentries)) == NULL)
281 for (i = 0; i < nentries; i++, kp++) {

Completed in 222 milliseconds

12