Searched refs:entries (Results 26 - 50 of 402) sorted by relevance

1234567891011>>

/freebsd-11-stable/sys/cam/
H A Dcam_queue.c124 KASSERT(new_size >= queue->entries, ("camq_resize: "
125 "New queue size can't accommodate queued entries (%d < %d).",
126 new_size, queue->entries));
141 queue->entries * sizeof(cam_pinfo *));
158 KASSERT(queue->entries < queue->array_size,
160 queue->entries, queue->array_size));
161 queue->entries++;
162 queue->queue_array[queue->entries] = new_entry;
163 new_entry->index = queue->entries;
164 if (queue->entries !
[all...]
H A Dcam_sim.h82 #define spriv_ptr0 sim_priv.entries[0].ptr
83 #define spriv_ptr1 sim_priv.entries[1].ptr
84 #define spriv_field0 sim_priv.entries[0].field
85 #define spriv_field1 sim_priv.entries[1].field
/freebsd-11-stable/usr.bin/ktrdump/
H A Dktrdump.c84 * Reads the ktr trace buffer from kernel memory and prints the trace entries.
98 int entries; local
184 entries = sb.st_size / sizeof(*buf);
190 if (kvm_read(kd, nl[1].n_value, &entries, sizeof(entries))
193 if ((buf = malloc(sizeof(*buf) * entries)) == NULL)
198 kvm_read(kd, bufptr, buf, sizeof(*buf) * entries) == -1 ||
243 i = index2 + 1 % entries;
246 if (i == entries)
252 i = entries
[all...]
/freebsd-11-stable/contrib/expat/tests/
H A Dstructdata.c73 storage->entries = NULL;
87 new = realloc(storage->entries,
90 storage->entries = new;
93 entry = &storage->entries[storage->count];
113 sprintf(buffer, "wrong number of entries: got %d, expected %d",
119 const StructDataEntry *got = &storage->entries[i];
150 free((void *)storage->entries[i].str);
151 free(storage->entries);
154 storage->entries = NULL;
H A Dstructdata.h51 int count; /* Number of entries used */
52 int max_count; /* Number of StructDataEntry items in `entries` */
53 StructDataEntry *entries; member in struct:__anon29
/freebsd-11-stable/usr.bin/finger/
H A Dextern.h37 extern int entries; /* Number of people. */
/freebsd-11-stable/usr.bin/column/
H A Dcolumn.c71 static int entries; /* number of records */ variable
137 if (!entries)
163 if (!--entries)
187 numrows = entries / numcols;
188 if (entries % numcols)
196 if ((base += numrows) >= entries)
214 for (cnt = entries, lp = list; cnt--; ++lp)
235 if ((t = tbl = calloc(entries, sizeof(TBL))) == NULL)
241 for (cnt = 0, lp = list; cnt < entries; ++cnt, ++lp, ++t) {
266 for (cnt = 0, t = tbl; cnt < entries;
[all...]
/freebsd-11-stable/usr.sbin/nscd/
H A Dhashtable.h59 * Defines the hash table structure, which uses the specified type of entries.
60 * The only restriction for entries is that is that they should have the field,
64 struct entry *entries; \
78 (table)->entries = calloc(_entries_size, \
79 sizeof(*(table)->entries)); \
82 (table)->entries[var].field.capacity = \
84 (table)->entries[var].field.size = 0; \
85 (table)->entries[var].field.values = malloc( \
88 assert((table)->entries[var].field.values != NULL);\
99 free((table)->entries[va
[all...]
H A Dcachelib.h59 * When doing partial transformations of entries (which are applied for
85 /* params, used for most entries */
100 /* params, used for multipart entries */
157 TAILQ_ENTRY(cache_mp_data_item_) entries; member in struct:cache_mp_data_item_
170 TAILQ_ENTRY(cache_mp_write_session_) entries; member in struct:cache_mp_write_session_
177 TAILQ_ENTRY(cache_mp_read_session_) entries; member in struct:cache_mp_read_session_
214 struct cache_entry_ **entries; member in struct:cache_
239 /* cache entries manipulation routines */
244 /* read/write operations used on common entries */
248 /* read/write operations used on multipart entries */
[all...]
/freebsd-11-stable/sys/powerpc/powermac/
H A Dpowermac_thermal.c70 SLIST_ENTRY(pmac_fan_le) entries;
77 SLIST_ENTRY(pmac_sens_le) entries;
110 SLIST_FOREACH(sensor, &sensors, entries) {
141 SLIST_FOREACH(fan, &fans, entries) {
144 SLIST_FOREACH(sensor, &sensors, entries) {
202 SLIST_INSERT_HEAD(&fans, list_entry, entries);
216 SLIST_INSERT_HEAD(&sensors, list_entry, entries);
/freebsd-11-stable/contrib/mdocml/
H A Ddba.c190 struct dba_array *entries; local
193 entries = dba_array_get(page, ie);
195 if (entries == NULL)
198 dba_array_free(entries);
205 dba_array_FOREACH(entries, entry) {
211 dba_array_add(entries, (void *)str);
220 struct dba_array *entries; local
227 entries = dba_array_get(page, DBP_NAME);
228 dba_array_FOREACH(entries, entry) {
234 dba_array_add(entries, prepen
434 struct macro_entry **entries, *entry; local
[all...]
/freebsd-11-stable/usr.bin/gencat/
H A Dgencat.c92 LIST_ENTRY(_msgT) entries;
98 LIST_ENTRY(_setT) entries;
500 set = set->entries.le_next) {
504 msg = msg->entries.le_next) {
551 set = set->entries.le_next) {
555 msg = msg->entries.le_next) {
597 for (; p != NULL && p->setId < setId; q = p, p = p->entries.le_next);
609 LIST_INSERT_HEAD(&sethead, p, entries);
611 LIST_INSERT_AFTER(q, p, entries);
637 for (; p != NULL && p->msgId < msgId; q = p, p = p->entries
[all...]
/freebsd-11-stable/contrib/ncurses/progs/
H A Dinfocmp.c36 * infocmp.c -- decompile an entry, or compare two entries
59 * terminfo entries, completely determine the actions of the program.
63 static ENTRY *entries; /* terminfo entries */ variable
64 static int termcount; /* count of terminal entries */
116 free(entries);
175 * This assumes that multiple use entries are supposed
179 * in the sequence of use entries'.
185 for (ep = &entries[1]; ep < entries
[all...]
/freebsd-11-stable/contrib/llvm-project/lld/lib/ReaderWriter/MachO/
H A DTLVPass.cpp97 std::vector<const TLVPEntryAtom*> entries; variable
98 entries.reserve(_targetToTLVP.size());
100 entries.push_back(it.second);
101 std::sort(entries.begin(), entries.end(),
106 for (const TLVPEntryAtom *slot : entries)
H A DGOTPass.cpp125 std::vector<const GOTEntryAtom *> entries; variable
126 entries.reserve(_targetToGOT.size());
128 entries.push_back(it.second);
129 std::sort(entries.begin(), entries.end(),
133 for (const GOTEntryAtom *slot : entries)
/freebsd-11-stable/contrib/gcclibs/libiberty/
H A Dhashtab.c284 hash table entries are HTAB_EMPTY_ENTRY). The function returns the
300 result->entries = (PTR *) (*alloc_f) (size, sizeof (PTR));
301 if (result->entries == NULL)
335 result->entries = (PTR *) (*alloc_f) (alloc_arg, size, sizeof (PTR));
336 if (result->entries == NULL)
390 PTR *entries = htab->entries; local
395 if (entries[i] != HTAB_EMPTY_ENTRY && entries[i] != HTAB_DELETED_ENTRY)
396 (*htab->del_f) (entries[
416 PTR *entries = htab->entries; local
[all...]
/freebsd-11-stable/contrib/binutils/libiberty/
H A Dhashtab.c284 hash table entries are HTAB_EMPTY_ENTRY). The function returns the
300 result->entries = (PTR *) (*alloc_f) (size, sizeof (PTR));
301 if (result->entries == NULL)
335 result->entries = (PTR *) (*alloc_f) (alloc_arg, size, sizeof (PTR));
336 if (result->entries == NULL)
390 PTR *entries = htab->entries; local
395 if (entries[i] != HTAB_EMPTY_ENTRY && entries[i] != HTAB_DELETED_ENTRY)
396 (*htab->del_f) (entries[
416 PTR *entries = htab->entries; local
[all...]
/freebsd-11-stable/usr.bin/truss/
H A Dtruss.h54 STAILQ_ENTRY(extra_syscall) entries; member in struct:extra_syscall
93 LIST_ENTRY(threadinfo) entries; member in struct:threadinfo
103 LIST_ENTRY(procinfo) entries; member in struct:procinfo
/freebsd-11-stable/bin/ls/
H A Dls.h72 int entries; member in struct:__anon4
/freebsd-11-stable/sys/contrib/octeon-sdk/
H A Dcvmx-tim.h82 * Each timer bucket contains a list of work queue entries to
85 * work queue entries followed by a next block pointer. Since
93 volatile uint64_t entries[0]; member in struct:cvmx_tim_entry_chunk
98 * represents the list of work queue entries that should be
99 * scheduled when the timer fires. The first 3 entries are used
242 tim_entry_ptr = &(work_bucket_ptr->last_chunk->entries[entries_per_chunk - work_bucket_ptr->chunk_remainder]);
264 work_bucket_ptr->last_chunk->entries[entries_per_chunk] = cvmx_ptr_to_phys(new_chunk);
275 tim_entry_ptr = &(new_chunk->entries[0]);
/freebsd-11-stable/contrib/smbfs/smbutil/
H A Dview.c74 int error, opt, bufsize, i, entries, total; local
113 error = smb_rap_NetShareEnum(ctx, 1, rpbuf, bufsize, &entries, &total);
119 for (ep = rpbuf, i = 0; i < entries; i++, ep++) {
129 printf("\n%d shares listed from %d available\n", entries, total);
/freebsd-11-stable/contrib/subversion/subversion/libsvn_wc/
H A Dlock.h48 apr_hash_t *entries);
50 /* Return the entries hash cached in ADM_ACCESS. The returned hash may
/freebsd-11-stable/lib/libc/stdlib/
H A Dhsearch_r.c49 ENTRY *entry = &hsearch->entries[index & hsearch->index_mask];
90 entry = &hsearch->entries[index & hsearch->index_mask];
106 /* Preserve the old hash table entries. */
108 old_entries = hsearch->entries;
120 hsearch->entries = new_entries;
123 /* Copy over the entries from the old table to the new table. */
134 /* Destroy the old hash table entries. */
/freebsd-11-stable/usr.bin/grep/regex/
H A Dhashtable.h26 hashtable_entry **entries; member in struct:__anon13773
/freebsd-11-stable/usr.sbin/ypldap/
H A DMakefile6 ldapclient.c entries.c yp.c \

Completed in 304 milliseconds

1234567891011>>