Searched refs:entries (Results 76 - 100 of 414) sorted by relevance

1234567891011>>

/freebsd-13-stable/contrib/subversion/subversion/svnfsfs/
H A Dload-index-cmd.c136 apr_array_header_t *entries = apr_array_make(pool, 16, sizeof(void*)); local
167 APR_ARRAY_PUSH(entries, svn_fs_fs__p2l_entry_t *) = entry;
178 ioctl_input.entries = entries;
/freebsd-13-stable/lib/libsecureboot/openpgp/
H A Dpacket.h49 LIST_ENTRY(OpenPGP_key_) entries; member in struct:OpenPGP_key_
/freebsd-13-stable/sys/dev/vmware/vmci/
H A Dvmci_hashtable.h24 struct vmci_hash_entry **entries; member in struct:vmci_hashtable
/freebsd-13-stable/sys/kern/
H A Dkern_kcov.c84 * can set this by using ioctl(fd, KIOSETBUFSIZE, entries);. When
129 size_t entries; /* (o) */ member in struct:kcov_info
141 static int kcov_alloc(struct kcov_info *info, size_t entries);
160 "Maximum number of entries in the kcov buffer");
217 if (index + 2 > info->entries)
251 if (index * 4 + 4 + 1 > info->entries)
279 * Move to KCOV_STATE_DYING to stop adding new entries.
353 if (info->kvaddr == 0 || size / KCOV_ELEMENT_SIZE != info->entries)
363 kcov_alloc(struct kcov_info *info, size_t entries) argument
372 if (entries <
[all...]
/freebsd-13-stable/contrib/bsnmp/lib/
H A Dsnmpclient.h179 } entries[0]; member in struct:snmp_table
181 } entries[]; variable in typeref:struct:snmp_table
/freebsd-13-stable/sys/arm64/acpica/
H A Dacpi_iort.c83 * case of ITS group nodes a set of ITS entries.
101 } entries; member in struct:iort_node
153 entry = node->entries.mappings;
234 node->entries.mappings = mapping;
264 node->entries.its = its;
367 iort_resolve_node(&node->entries.mappings[i], TRUE);
370 iort_resolve_node(&node->entries.mappings[i], FALSE);
375 * Walk MADT table, assign PIC xrefs to all ITS entries.
393 its_entry = its_node->entries.its;
407 * Walk SRAT, assign proximity to all ITS entries
[all...]
/freebsd-13-stable/lib/libc/tests/nss/
H A Dtestutil.h33 STAILQ_ENTRY(ent##_entry) entries; \
105 STAILQ_INSERT_TAIL(&td->snapshot_data, e, entries); \
119 STAILQ_FOREACH(e, &td->snapshot_data, entries) { \
152 e1 = STAILQ_NEXT(e1, entries); \
153 e2 = STAILQ_NEXT(e2, entries); \
170 STAILQ_FOREACH(e, &td->snapshot_data, entries) { \
189 STAILQ_REMOVE_HEAD(&td->snapshot_data, entries); \
/freebsd-13-stable/crypto/openssl/crypto/x509/
H A Dx509name.c53 return sk_X509_NAME_ENTRY_num(name->entries);
77 sk = name->entries;
89 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
93 return sk_X509_NAME_ENTRY_value(name->entries, loc);
102 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
106 sk = name->entries;
192 sk = name->entries;
/freebsd-13-stable/sys/cam/
H A Dcam_queue.h53 int entries; member in struct:camq
135 #define CAMQ_GET_PRIO(camq) (((camq)->entries > 0) ? \
172 return (ccbq->queue.entries + ccbq->queue_extra_entries);
197 if (queue->entries == queue->array_size &&
199 old_ccb = (struct ccb_hdr *)camq_remove(queue, queue->entries);
/freebsd-13-stable/usr.bin/finger/
H A Dfinger.c93 int entries, gflag, lflag, pplan, oflag; variable
212 if (entries == 0)
224 if (entries) {
372 if (*p || entries)
378 if (entries == 0)
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/
H A Ddag.c276 /* Given directory NODEREV in FS, set *ENTRIES_P to its entries list
277 hash, as part of TRAIL, or to NULL if NODEREV has no entries. The
278 entries list will be allocated in POOL, and the entries in that
288 apr_hash_t *entries = NULL;
297 _("Attempted to get entries of a non-directory node"));
299 /* If there's a DATA-KEY, there might be entries to fetch. */
302 /* Now we have a rep, follow through to get the entries. */
307 /* Were there entries? Make a hash from them. */
309 SVN_ERR(svn_fs_base__parse_entries_skel(&entries, entries_ske
285 apr_hash_t *entries = NULL; local
348 apr_hash_t *entries; local
380 apr_hash_t *entries = NULL; local
505 svn_fs_base__dag_dir_entries(apr_hash_t **entries, dag_node_t *node, trail_t *trail, apr_pool_t *pool) argument
849 apr_hash_t *entries = NULL; local
1016 apr_hash_t *entries; local
[all...]
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_fs/
H A Dindex.h60 /* Call this function before adding entries for the next revision to the
70 * but duplicate entries for the same ITEM_INDEX are not supported.
85 * be REVISION, entries to the next revision will be assigned to REVISION+1
110 * The entries must be added in ascending offset order and must not leave
144 /* Use the phys-to-log mapping files in FS to build a list of entries
157 svn_fs_fs__p2l_index_lookup(apr_array_header_t **entries,
234 * its name in *PROTONAME. All entries to write are given in ENTRIES and
235 * entries are of type svn_fs_fs__p2l_entry_t* (sic!). The ENTRIES array
242 apr_array_header_t *entries,
247 * its name in *PROTONAME. All entries t
[all...]
H A Dverify.c252 /* Verify that for all log-to-phys index entries for revisions START to
291 /* get L2P entry. Ignore unused entries. */
334 /* Verify that for all phys-to-log index entries for revisions START to
364 /* for all offsets in the file, get the P2L index entries and check
368 apr_array_header_t *entries;
374 /* get all entries for the current block */
375 SVN_ERR(svn_fs_fs__p2l_index_lookup(&entries, fs, rev_file, start,
378 if (entries->nelts == 0)
385 /* process all entries (and later continue with the next block) */
387 = &APR_ARRAY_IDX(entries, entrie
367 apr_array_header_t *entries; local
636 apr_array_header_t *entries; local
[all...]
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Dindex.h80 * There must be no overlapping / conflicting entries.
120 /* Call this function before adding entries for the next revision to the
130 * in any order but duplicate entries for the same ITEM_INDEX, SUB_ITEM
147 * be REVISION, entries to the next revision will be assigned to REVISION+1
172 * The entries must be added in ascending offset order and must not leave
206 /* Use the phys-to-log mapping files in FS to build a list of entries
219 svn_fs_x__p2l_index_lookup(apr_array_header_t **entries,
311 * its name in *PROTONAME. All entries to write are given in ENTRIES and
312 * entries are of type svn_fs_x__p2l_entry_t* (sic!). The ENTRIES array
319 apr_array_header_t *entries,
[all...]
/freebsd-13-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DCompactUnwindPass.cpp61 ArrayRef<CompactUnwindEntry> entries; member in struct:lld::mach_o::__anon2723::UnwindInfoPage
171 pages[i].entries[0].rangeStart);
177 for (auto &entry : pages[i].entries)
183 auto &finalEntry = pages[pages.size() - 1].entries.back();
197 for (auto &entry : page.entries) {
218 headerSize + 2 * page.entries.size() * sizeof(uint32_t);
227 write16(&_contents[curPageOffset + 6], page.entries.size(), _isBig);
230 for (auto &entry : page.entries) {
291 // First collect all __compact_unwind and __eh_frame entries, addressable by
310 // Now sort the entries b
[all...]
/freebsd-13-stable/sys/dev/mlx5/mlx5_ib/
H A Dmlx5_ib_cq.c744 int entries, u32 **cqb,
772 entries * ucmd.cqe_size,
787 (long long)ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
846 int entries, int cqe_size,
861 err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
913 int entries = attr->cqe; local
927 if (entries < 0 ||
928 (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))))
934 entries = roundup_pow_of_two(entries
742 create_cq_user(struct mlx5_ib_dev *dev, struct ib_udata *udata, struct ib_ucontext *context, struct mlx5_ib_cq *cq, int entries, u32 **cqb, int *cqe_size, int *index, int *inlen) argument
845 create_cq_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq, int entries, int cqe_size, u32 **cqb, int *index, int *inlen) argument
1122 resize_user(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq, int entries, struct ib_udata *udata, int *npas, int *page_shift, int *cqe_size) argument
1165 resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq, int entries, int cqe_size) argument
1249 mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata) argument
[all...]
/freebsd-13-stable/lib/libsecureboot/
H A Dveopen.c33 char *fi_prefix; /**< manifest entries relative to */
34 char *fi_skip; /**< manifest entries prefixed with */
39 LIST_ENTRY(fingerprint_info) entries;
62 * path that all manifest entries are resolved via
65 * optional prefix within manifest entries which should be skipped
137 LIST_INSERT_HEAD(&fi_list, nfip, entries);
142 LIST_FOREACH(fip, &fi_list, entries) {
144 LIST_INSERT_BEFORE(fip, nfip, entries);
152 LIST_INSERT_AFTER(lfip, nfip, entries);
250 LIST_FOREACH(fip, &fi_list, entries) {
[all...]
/freebsd-13-stable/sys/dev/agp/
H A Dagp_amd.c84 u_int32_t entries = apsize >> AGP_PAGE_SHIFT; local
103 gatt->ag_entries = entries;
104 gatt->ag_virtual = (void *)kmem_alloc_attr(entries * sizeof(u_int32_t),
122 kmem_free((vm_offset_t)gatt->ag_virtual, entries *
135 gatt->ag_entries = entries;
137 device_printf(dev, "allocating GATT for %d AGP page entries\n",
153 npages = ((entries * sizeof(u_int32_t) + AGP_PAGE_SIZE - 1)
/freebsd-13-stable/sys/arm/arm/
H A Dunwind.c118 * synthesize at init time). New entries are added to the end of this list as
119 * needed, but entries are never deleted from the list. Instead, they are
133 * List entries marked as unused get reused when new modules are loaded. We
362 state->entries--;
378 if (state->entries == 0)
445 state->entries = 0;
508 state->entries = 1;
511 state->entries = ((*state->insn >> 16) & 0xFF) + 1;
519 while (state->entries > 0) {
/freebsd-13-stable/usr.sbin/nscd/
H A Dcachelib.c154 * Routines to sort and search the entries by name
182 return ((struct cache_entry_ **)(bsearch(entry_name, the_cache->entries,
197 TAILQ_REMOVE(&ws->items, data_item, entries);
261 TAILQ_REMOVE(&mp_entry->ws_head, ws, entries);
267 TAILQ_REMOVE(&mp_entry->rs_head, rs, entries);
490 retval->entries = calloc(INITIAL_ENTRIES_CAPACITY,
491 sizeof(*retval->entries));
492 assert(retval->entries != NULL);
508 if (the_cache->entries != NULL) {
511 destroy_cache_entry(the_cache->entries[
[all...]
/freebsd-13-stable/sys/dev/bnxt/
H A Dbnxt_ioctl.h112 uint32_t entries; member in struct:bnxt_ioctl_hwrm_nvm_get_dir_info
120 uint32_t entries; member in struct:bnxt_ioctl_hwrm_nvm_get_dir_entries
/freebsd-13-stable/sys/net/route/
H A Dfib_algo.h69 struct fib_change_entry *entries; member in struct:fib_change_queue
101 TAILQ_ENTRY(fib_lookup_module) entries; member in struct:fib_lookup_module
/freebsd-13-stable/sys/dev/liquidio/
H A Dlio_bsd.h114 STAILQ_ENTRY (lio_stailq_node) entries; member in struct:lio_stailq_node
129 STAILQ_REMOVE_HEAD(root, entries);
/freebsd-13-stable/usr.sbin/zonectl/
H A Dzonectl.c291 entry = &report->entries[i];
389 struct disk_zone_rep_entry *entries = NULL; local
519 entries = malloc(entry_alloc_size);
520 if (entries == NULL) {
527 zone_args.zone_params.report.entries = entries;
567 bzero(entries, entry_alloc_size);
583 free(entries);
/freebsd-13-stable/tools/tools/termcap/
H A Dtermcap.pl36 Compares the entries in the termcap.src for <term1> and <term2> and
38 the size of two similar termcap entries with the "tc" option.

Completed in 895 milliseconds

1234567891011>>