Searched refs:entries (Results 201 - 225 of 402) sorted by relevance

1234567891011>>

/freebsd-11-stable/sys/contrib/ncsw/user/env/
H A Dxx.c131 LIST_ENTRY(XX_MallocTrackStruct) entries;
892 LIST_FOREACH(tp, l, entries) {
928 LIST_INSERT_HEAD(l, ts, entries);
946 LIST_REMOVE(ts, entries);
/freebsd-11-stable/sys/netgraph/bluetooth/include/
H A Dng_btsocket.h145 ng_hci_node_neighbor_cache_entry_ep *entries; member in struct:ng_btsocket_hci_raw_node_neighbor_cache
/freebsd-11-stable/sys/dev/liquidio/base/
H A Dlio_response_manager.c168 &sc->node, lio_stailq_node, entries);
/freebsd-11-stable/usr.sbin/kldxref/
H A Dkldxref.c411 printf(" pnp info for bus %s format %s %d entries of %d bytes\n",
419 printf(" pnp info for bus %s format %s %d entries of %d bytes\n",
535 long start, finish, entries; local
564 &entries));
565 check(EF_SEG_READ_ENTRY_REL(&ef, start, sizeof(*p) * entries,
568 while(entries--) {
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DRegistry.h59 /// Node in linked list of entries.
81 /// Iterators for registry entries.
101 static iterator_range<iterator> entries() { function in class:llvm::Registry
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DGCMetadata.cpp153 for (auto& Entry : GCRegistry::entries()) {
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/
H A DArgs.h77 /// Dump all entries to the stream \a s using label \a label_name.
124 llvm::ArrayRef<ArgEntry> entries() const { return m_entries; } function in class:lldb_private::Args
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_fs/
H A Dcached_data.c2550 sorted(apr_array_header_t *entries)
2554 const svn_fs_dirent_t * const *dirents = (const void *)entries->elts;
2555 for (i = 0; i < entries->nelts-1; ++i)
2582 /* Into *ENTRIES_P, read all directories entries from the key-value text in
2597 apr_array_header_t *entries = NULL;
2602 entries = apr_array_make(result_pool, 16, sizeof(svn_fs_dirent_t *));
2606 to make updating and removing entries cheaper. */
2679 APR_ARRAY_PUSH(entries, svn_fs_dirent_t *) = dirent;
2687 entries = apr_array_make(result_pool, apr_hash_count(hash),
2690 APR_ARRAY_PUSH(entries, svn_fs_dirent_
2549 sorted(apr_array_header_t *entries) argument
2596 apr_array_header_t *entries = NULL; local
2890 svn_fs_fs__find_dir_entry(apr_array_header_t *entries, const char *name, int *hint) argument
3682 apr_array_header_t *entries; local
[all...]
H A Dstats.c209 * entries. Allocate the result in RESULT_POOL.
225 /* allocate *all* entries before the path stringbufs. This increases
573 apr_array_header_t *entries; local
574 SVN_ERR(svn_fs_fs__rep_contents_dir(&entries, query->fs, noderev,
577 for (i = 0; i < entries->nelts; ++i)
579 svn_fs_dirent_t *dirent = APR_ARRAY_IDX(entries, i, svn_fs_dirent_t *);
680 * of entries in its changed paths list and store that info in REVISION_INFO.
1039 /* for all offsets in the file, get the P2L index entries and process
1043 apr_array_header_t *entries; local
1051 /* get all entries fo
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/
H A Dfs.h272 /* Capacity in entries of log-to-phys index pages */
563 /* Contents, i.e. all directory entries, sorted by name. */ member in struct:svn_fs_x__dir_data_t
564 apr_array_header_t *entries;
H A Dcached_data.c2449 sorted(apr_array_header_t *entries)
2453 const svn_fs_x__dirent_t * const *dirents = (const void *)entries->elts;
2454 for (i = 0; i < entries->nelts-1; ++i)
2483 /* Into ENTRIES, parse all directories entries from the serialized form in
2503 apr_array_header_t *entries;
2512 entries = apr_array_make(result_pool, (int)count,
2560 APR_ARRAY_PUSH(entries, svn_fs_x__dirent_t *) = dirent;
2569 APR_ARRAY_PUSH(entries, svn_fs_x__dirent_t *) = apr_hash_this_val(hi);
2571 if (!sorted(entries))
2572 svn_sort__array(entries, compare_dirent
2448 sorted(apr_array_header_t *entries) argument
2502 apr_array_header_t *entries; local
2774 svn_fs_x__find_dir_entry(apr_array_header_t *entries, const char *name, int *hint) argument
3400 apr_array_header_t *entries; local
[all...]
H A Ddag.c260 _("Can't get entries of non-directory"));
378 svn_fs_x__dag_dir_entries(apr_array_header_t **entries,
387 _("Can't get entries of non-directory"));
389 return svn_fs_x__rep_contents_dir(entries, node->fs, noderev, result_pool,
593 /* Find the node named NAME in PARENT's entries list if it exists. */
671 apr_array_header_t *entries;
675 /* Loop over directory entries */
676 SVN_ERR(svn_fs_x__dag_dir_entries(&entries, node, scratch_pool,
678 for (i = 0; i < entries->nelts; ++i)
681 = &APR_ARRAY_IDX(entries,
375 svn_fs_x__dag_dir_entries(apr_array_header_t **entries, dag_node_t *node, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument
666 apr_array_header_t *entries; local
[all...]
/freebsd-11-stable/contrib/llvm-project/lld/ELF/
H A DInputFiles.cpp444 // the section does not hold a table of fixed-size entries". We know
504 ArrayRef<typename ELFT::Word> entries) {
506 for (uint32_t index : entries.slice(1)) {
524 for (uint32_t index : entries.slice(1)) {
585 ArrayRef<Elf_Word> entries = local
587 if (entries.empty())
594 if (entries[0] == 0)
597 if (entries[0] != GRP_COMDAT)
607 selectedGroups.push_back(entries);
612 for (uint32_t secIndex : entries
503 handleSectionGroup(ArrayRef<InputSectionBase *> sections, ArrayRef<typename ELFT::Word> entries) argument
[all...]
/freebsd-11-stable/contrib/libreadline/
H A Dhistory.c74 entries to remember. */
95 state->entries = the_history;
111 the_history = state->entries;
127 /* Return the number of bytes that the primary history entries are using.
283 /* Copy the rest of the entries, moving down one slot. */
389 /* Replace the DATA in the specified history entries, replacing OLD with
391 all of the history entries where entry->data == OLD; WHICH == -2 means
485 number of history entries. The value is positive if the history
/freebsd-11-stable/contrib/gcclibs/libcpp/
H A Dfiles.c966 To avoid duplicate entries we follow the convention that all
1002 /* Create a new block of memory for file hash entries. */
1070 /* Compare entries in the nonexistent file hash table. These are just
1492 while the PCH was being built. The 'entries' field is kept sorted
1495 that's OK. The code does rely on having entries with the same size
1517 struct pchf_entry entries[1];
1564 result->entries[count].once_only = f->once_only;
1569 f->st.st_size, result->entries[count].sum);
1581 md5_stream (ff, result->entries[count].sum);
1585 result->entries[coun
1516 struct pchf_entry entries[1]; member in struct:pchf_data
[all...]
/freebsd-11-stable/sys/amd64/include/xen/
H A Dhypercall.h184 unsigned long *frame_list, unsigned int entries)
186 return _hypercall2(int, set_gdt, frame_list, entries);
183 HYPERVISOR_set_gdt( unsigned long *frame_list, unsigned int entries) argument
/freebsd-11-stable/sys/i386/include/xen/
H A Dhypercall.h161 unsigned long *frame_list, int entries)
163 return _hypercall2(int, set_gdt, frame_list, entries);
160 HYPERVISOR_set_gdt( unsigned long *frame_list, int entries) argument
/freebsd-11-stable/contrib/unbound/contrib/
H A Dunbound_cache.cmd97 echo r - Reload - reloadind new cache entries and refresh existing cache
/freebsd-11-stable/sys/dev/mlx4/mlx4_core/
H A Dmlx4_cq.c140 int entries, struct mlx4_mtt *mtt)
152 cq_context->logsize_usrpage = cpu_to_be32(ilog2(entries) << 24);
139 mlx4_cq_resize(struct mlx4_dev *dev, struct mlx4_cq *cq, int entries, struct mlx4_mtt *mtt) argument
/freebsd-11-stable/sys/conf/
H A Ddtb.mk68 # entries in the NO_ROOT case.
/freebsd-11-stable/sys/dev/sfxge/
H A Dsfxge_rx.c245 KASSERT(rxfill <= EFX_RXQ_LIMIT(rxq->entries),
246 ("rxfill > EFX_RXQ_LIMIT(rxq->entries)"));
247 ntodo = min(EFX_RXQ_LIMIT(rxq->entries) - rxfill, target);
248 KASSERT(ntodo <= EFX_RXQ_LIMIT(rxq->entries),
249 ("ntodo > EFX_RQX_LIMIT(rxq->entries)"));
321 sfxge_rx_qfill(rxq, EFX_RXQ_LIMIT(rxq->entries), B_TRUE);
929 sfxge_rx_qfill(rxq, EFX_RXQ_LIMIT(rxq->entries), B_FALSE);
1281 rxq->entries = sc->rxq_entries;
1282 rxq->ptr_mask = rxq->entries - 1;
1283 rxq->refill_threshold = RX_REFILL_THRESHOLD(rxq->entries);
[all...]
/freebsd-11-stable/sbin/newfs/
H A Dmkfs.c854 int entries; local
863 entries = (nflag) ? ROOTLINKCNT - 1: ROOTLINKCNT;
875 node.dp1.di_nlink = entries;
876 node.dp1.di_size = makedir(root_dir, entries);
911 node.dp2.di_nlink = entries;
912 node.dp2.di_size = makedir(root_dir, entries);
939 * construct a set of directory entries in "iobuf".
943 makedir(struct direct *protodir, int entries) argument
950 for (cp = iobuf, i = 0; i < entries - 1; i++) {
/freebsd-11-stable/sys/dev/ixgbe/
H A Dif_sriov.c411 int entries; local
414 entries = (msg[0] & IXGBE_VT_MSGINFO_MASK) >> IXGBE_VT_MSGINFO_SHIFT;
415 entries = min(entries, IXGBE_MAX_VF_MC);
419 vf->num_mc_hashes = entries;
422 for (int i = 0; i < entries; i++) {
/freebsd-11-stable/stand/libsa/zfs/
H A Dzfs.c96 SLIST_ENTRY(zfs_be_entry) entries;
899 SLIST_FOREACH_SAFE(zfs_be, &zfs_be_head, entries, zfs_be_tmp) {
914 SLIST_REMOVE_HEAD(&zfs_be_head, entries);
981 SLIST_REMOVE_HEAD(&zfs_be_head, entries);
1002 SLIST_INSERT_HEAD(&zfs_be_head, zfs_be, entries);
1030 SLIST_FOREACH_SAFE(zfs_be, &zfs_be_head, entries, zfs_be_tmp) {
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/
H A Dcache-membuffer.c54 * arbitrary gaps between entries. This buffer is sub-devided into
57 * 2. A directory of cache entries. This is organized similar to CPU
59 * of entries that may contain the header info for an item with
76 * entries. Every USED entry has a reference to the previous and the next
103 * As a result, frequently used entries are likely not to be dropped until
106 * with new entries. For details on the fine-tuning involved, see the
184 * byte, i.e. 8 flags/byte x 32 groups/flag x 8 entries/group x 40 index
200 /* We use this structure to identify cache entries. There cannot be two
201 * entries with the same entry key. However unlikely, though, two different
257 /* Number of used entries tha
651 entry_t entries[GROUP_SIZE]; member in struct:entry_group_t
[all...]

Completed in 362 milliseconds

1234567891011>>