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

1234567891011>>

/freebsd-11-stable/sys/arm/arm/
H A Dunwind.c207 state->entries--;
223 if (state->entries == 0)
290 state->entries = 0;
353 state->entries = 1;
356 state->entries = ((*state->insn >> 16) & 0xFF) + 1;
364 while (state->entries > 0) {
/freebsd-11-stable/gnu/usr.bin/rcs/rcsclean/
H A Drcsclean.c284 * Put a vector of all DIRNAME's directory entries names into *AARGV.
286 * Yield the number of entries found. Terminate the vector with 0.
291 int i, entries = 0, entries_max = 64; local
309 if (entries == entries_max)
311 offset[entries++] = chars;
326 *aargv = p = tnalloc(char*, entries+1);
327 for (i=0; i<entries; i++)
331 return entries;
/freebsd-11-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-11-stable/crypto/openssl/crypto/x509/
H A Dx509name.c99 return (sk_X509_NAME_ENTRY_num(name->entries));
123 sk = name->entries;
135 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
139 return (sk_X509_NAME_ENTRY_value(name->entries, loc));
148 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
151 sk = name->entries;
236 sk = name->entries;
/freebsd-11-stable/usr.bin/finger/
H A Dfinger.c91 int entries, gflag, lflag, pplan, oflag; variable
210 if (entries == 0)
222 if (entries) {
370 if (*p || entries)
375 if (entries == 0)
/freebsd-11-stable/sys/cam/
H A Dcam_queue.h51 int entries; member in struct:camq
146 #define CAMQ_GET_PRIO(camq) (((camq)->entries > 0) ? \
184 return (ccbq->queue.entries + ccbq->queue_extra_entries);
209 if (queue->entries == queue->array_size &&
211 old_ccb = (struct ccb_hdr *)camq_remove(queue, queue->entries);
/freebsd-11-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-11-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-11-stable/usr.bin/truss/
H A Dsetup.c185 LIST_FOREACH(nt, &p->threadlist, entries) {
195 LIST_INSERT_HEAD(&p->threadlist, nt, entries);
203 LIST_REMOVE(t, entries);
244 LIST_FOREACH(np, &info->proclist, entries) {
258 LIST_INSERT_HEAD(&info->proclist, np, entries);
271 LIST_FOREACH_SAFE(t, &p->threadlist, entries, t2) {
274 LIST_REMOVE(p, entries);
283 LIST_FOREACH_SAFE(p, &info->proclist, entries, p2) {
294 LIST_FOREACH(np, &info->proclist, entries) {
314 LIST_FOREACH(nt, &np->threadlist, entries) {
[all...]
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DCompactUnwindPass.cpp61 ArrayRef<CompactUnwindEntry> entries; member in struct:lld::mach_o::__anon1144::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-11-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...]
H A Dverify.c224 /* Verify that for all log-to-phys index entries for revisions START to
266 /* get L2P entry. Ignore unused entries. */
310 /* Verify that for all phys-to-log index entries for revisions START to
340 /* for all offsets in the file, get the P2L index entries and check
344 apr_array_header_t *entries;
350 /* get all entries for the current block */
351 SVN_ERR(svn_fs_x__p2l_index_lookup(&entries, fs, rev_file, start,
354 if (entries->nelts == 0)
361 /* process all entries (and later continue with the next block) */
363 = &APR_ARRAY_IDX(entries, entrie
343 apr_array_header_t *entries; local
608 apr_array_header_t *entries; local
[all...]
/freebsd-11-stable/sys/dev/mlx5/mlx5_ib/
H A Dmlx5_ib_cq.c744 int entries, u32 **cqb,
774 entries * ucmd.cqe_size,
789 (long long)ucmd.buf_addr, entries * ucmd.cqe_size, npages, page_shift, ncont);
838 int entries, int cqe_size,
853 err = alloc_cq_buf(dev, &cq->buf, entries, cqe_size);
905 int entries = attr->cqe; local
919 if (entries < 0 ||
920 (entries > (1 << MLX5_CAP_GEN(dev->mdev, log_max_cq_sz))))
926 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
837 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
1114 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
1157 resize_kernel(struct mlx5_ib_dev *dev, struct mlx5_ib_cq *cq, int entries, int cqe_size) argument
1241 mlx5_ib_resize_cq(struct ib_cq *ibcq, int entries, struct ib_udata *udata) argument
[all...]
/freebsd-11-stable/sys/dev/agp/
H A Dagp_amd.c82 u_int32_t entries = apsize >> AGP_PAGE_SHIFT; local
101 gatt->ag_entries = entries;
103 entries * sizeof(u_int32_t), M_NOWAIT | M_ZERO, 0, ~0,
122 entries * sizeof(u_int32_t));
134 gatt->ag_entries = entries;
136 device_printf(dev, "allocating GATT for %d AGP page entries\n",
152 npages = ((entries * sizeof(u_int32_t) + AGP_PAGE_SIZE - 1)
/freebsd-11-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-11-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.
/freebsd-11-stable/usr.sbin/zonectl/
H A Dzonectl.c294 entry = &report->entries[i];
392 struct disk_zone_rep_entry *entries = NULL; local
522 entries = malloc(entry_alloc_size);
523 if (entries == NULL) {
530 zone_args.zone_params.report.entries = entries;
570 bzero(entries, entry_alloc_size);
586 free(entries);
/freebsd-11-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-11-stable/sys/dev/liquidio/
H A Dlio_bsd.h111 STAILQ_ENTRY (lio_stailq_node) entries; member in struct:lio_stailq_node
126 STAILQ_REMOVE_HEAD(root, entries);
/freebsd-11-stable/contrib/bsnmp/lib/
H A Dsnmpclient.c79 LIST_ENTRY(sent_pdu) entries;
155 for (i = 0; work->descr->entries[i].syntax != SNMP_SYNTAX_NULL;
157 d = &work->descr->entries[i];
210 switch (work->descr->entries[i].syntax) {
223 work->descr->entries[i].offset) = var->subs[p++];
254 work->descr->entries[i].offset) = ptr;
256 work->descr->entries[i].offset + sizeof(u_char *))
275 work->descr->entries[i].offset) = oid;
291 work->descr->entries[i].offset)[j] =
308 work->descr->entries[
[all...]
/freebsd-11-stable/contrib/ntp/sntp/libevent/
H A Devmap.c160 if there are no entries for 'slot'. Does no bounds-checking. */
162 (x) = (struct type *)((map)->entries[slot])
170 if ((map)->entries[slot] == NULL) { \
171 (map)->entries[slot] = \
173 if (EVUTIL_UNLIKELY((map)->entries[slot] == NULL)) \
175 (ctor)((struct type *)(map)->entries[slot]); \
177 (x) = (struct type *)((map)->entries[slot]); \
200 /** Expand 'map' with new entries of width 'msize' until it is big enough
213 tmp = (void **)mm_realloc(map->entries, nentries * msize);
221 map->entries
[all...]
/freebsd-11-stable/contrib/gdb/gdb/
H A Df-lang.c701 tmp->entries = NULL;
730 we expect the entries to appear in decl.
742 if (current_common->entries == NULL)
744 current_common->entries = tmp;
814 entry = blk->entries;
/freebsd-11-stable/contrib/smbfs/lib/smb/
H A Drap.c309 int error, rdatacnt, rparamcnt, entries, done, dlen; local
325 rap->r_entries = entries = 0;
331 rap->r_entries = entries = le16toh(*(u_int16_t*)rap->r_npbuf);
346 * In general, unpacking entries we may need to relocate
347 * entries for proper alingning. For now use them as is.
350 while (entries--) {
/freebsd-11-stable/sys/netpfil/pf/
H A Dpf_altq.h92 TAILQ_ENTRY(pf_altq) entries; member in struct:pf_altq

Completed in 174 milliseconds

1234567891011>>