Searched refs:entries (Results 1 - 25 of 273) sorted by relevance

1234567891011

/freebsd-9.3-release/usr.sbin/lpr/chkprintcap/
H A Dskimprintcap.h38 int entries; member in struct:skiminfo
/freebsd-9.3-release/usr.bin/grep/regex/
H A Dhashtable.c56 * Initializes a hash table that can hold table_size number of entries,
73 tbl->entries = calloc(sizeof(hashtable_entry *), table_size);
74 if (tbl->entries == NULL)
119 * On hash collision entries are inserted at the next free space,
125 if (tbl->entries[hash] == NULL)
127 else if (memcmp(tbl->entries[hash]->key, key, tbl->key_size) == 0)
129 memcpy(tbl->entries[hash]->value, value, tbl->value_size);
140 tbl->entries[hash] = malloc(sizeof(hashtable_entry));
141 if (tbl->entries[hash] == NULL)
147 tbl->entries[has
[all...]
/freebsd-9.3-release/contrib/libarchive/libarchive/test/
H A Dtest_write_format_mtree.c37 } entries[] = { variable in typeref:struct:__anon1641
69 /* Write entries */
70 for (i = 0; entries[i].path != NULL; i++) {
72 archive_entry_set_mtime(ae, entries[i].mtime, 0);
73 assert(entries[i].mtime == archive_entry_mtime(ae));
74 archive_entry_set_mode(ae, entries[i].mode);
75 assert(entries[i].mode == archive_entry_mode(ae));
76 archive_entry_set_uid(ae, entries[i].uid);
77 assert(entries[i].uid == archive_entry_uid(ae));
78 archive_entry_set_gid(ae, entries[
[all...]
/freebsd-9.3-release/contrib/cvs/src/
H A Dfind_names.c27 List *entries));
33 * add the key from entry on entries list to the files list
68 List *entries; local
74 /* look at entries (if necessary) */
77 /* parse the entries file (if it exists) */
78 entries = Entries_Open (aflag, NULL);
79 if (entries != NULL)
81 /* walk the entries file adding elements to the files list */
82 (void) walklist (entries, add_entries_proc, files);
84 /* if our caller wanted the entries lis
159 List *entries = (List *) closure; local
[all...]
/freebsd-9.3-release/contrib/gcc/
H A Dintegrate.c63 initial_value_pair * GTY ((length ("%h.num_entries"))) entries;
223 if (rtx_equal_p (ivs->entries[i].pseudo, reg))
224 return ivs->entries[i].hard_reg;
248 ivs->entries = ggc_alloc (5 * sizeof (initial_value_pair));
255 ivs->entries = ggc_realloc (ivs->entries,
260 ivs->entries[ivs->num_entries].hard_reg = gen_rtx_REG (mode, regno);
261 ivs->entries[ivs->num_entries].pseudo = gen_reg_rtx (mode);
263 return ivs->entries[ivs->num_entries++].pseudo;
279 if (GET_MODE (ivs->entries[
[all...]
H A Dstringpool.c66 /* Create with 16K (2^14) entries. */
218 entries;
233 spd->entries = ggc_alloc (sizeof (spd->entries[0]) * spd->nslots);
234 memcpy (spd->entries, ident_hash->entries,
235 spd->nslots * sizeof (spd->entries[0]));
252 ht_load (ident_hash, spd->entries, spd->nslots, spd->nelements, false);
/freebsd-9.3-release/include/rpcsvc/
H A Dnis_callback.x65 obj_p entries<>; /* List of objects */
/freebsd-9.3-release/lib/libncp/
H A Dsap.c58 static struct sap_packet* sap_packet_alloc(int entries);
59 static int sap_size(int entries, u_short operation);
72 sap_packet_alloc(int entries) argument
74 if (entries > IPX_SAP_MAX_ENTRIES)
77 (struct sap_packet*)malloc(sap_size(entries, IPX_SAP_GENERAL_RESPONSE));
81 sap_size(int entries, u_short operation) argument
83 if (entries <= 0)
87 return entries == 1 ? IPX_SAP_REQUEST_LEN : 0;
89 if (entries > IPX_SAP_MAX_ENTRIES)
91 return sizeof(struct sap_packet) + (entries
[all...]
/freebsd-9.3-release/crypto/openssl/crypto/asn1/
H A Dx_name.c124 if ((ret->entries = sk_X509_NAME_ENTRY_new_null()) == NULL)
135 if (ret->entries)
136 sk_X509_NAME_ENTRY_free(ret->entries);
150 sk_X509_NAME_ENTRY_pop_free(a->entries, X509_NAME_ENTRY_free);
184 STACK_OF(X509_NAME_ENTRY) *entries;
207 entries = (STACK_OF(X509_NAME_ENTRY) *)sk_value(intname.s, i);
208 for (j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
209 entry = sk_X509_NAME_ENTRY_value(entries, j);
211 if (!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
214 sk_X509_NAME_ENTRY_free(entries);
[all...]
/freebsd-9.3-release/crypto/openssh/
H A Dhostfile.c61 struct hostkey_entry *entries; member in struct:hostkeys
237 ret->entries = NULL;
254 debug3("%s: loading entries for host \"%.100s\" from file \"%s\"",
312 hostkeys->entries = xrealloc(hostkeys->entries,
313 hostkeys->num_entries + 1, sizeof(*hostkeys->entries));
314 hostkeys->entries[hostkeys->num_entries].host = xstrdup(host);
315 hostkeys->entries[hostkeys->num_entries].file = xstrdup(path);
316 hostkeys->entries[hostkeys->num_entries].line = linenum;
317 hostkeys->entries[hostkey
[all...]
/freebsd-9.3-release/usr.sbin/mptutil/
H A Dmpt_evt.c96 MPI_LOG_0_ENTRY **entries; local
131 /* Build a list of valid entries and sort them by sequence. */
132 entries = malloc(sizeof(MPI_LOG_0_ENTRY *) * log->NumLogEntries);
133 if (entries == NULL)
140 entries[num_events] = &log->LogEntry[i];
144 qsort(entries, num_events, sizeof(MPI_LOG_0_ENTRY *), event_compare);
151 mpt_print_event(entries[i], verbose);
154 free(entries);
/freebsd-9.3-release/sys/ofed/drivers/net/mlx4/
H A Dport.c56 table->entries[i] = 0;
69 table->entries[i] = 0;
77 __be64 *entries)
87 memcpy(mailbox->buf, entries, MLX4_MAC_TABLE_SIZE);
111 if (mac == (MLX4_MAC_MASK & be64_to_cpu(table->entries[i]))) {
127 /* No free mac entries */
134 table->entries[free] = cpu_to_be64(mac | MLX4_MAC_VALID);
136 err = mlx4_set_port_mac_table(dev, port, table->entries);
140 table->entries[free] = 0;
166 table->entries[inde
76 mlx4_set_port_mac_table(struct mlx4_dev *dev, u8 port, __be64 *entries) argument
174 mlx4_set_port_vlan_table(struct mlx4_dev *dev, u8 port, __be32 *entries) argument
[all...]
/freebsd-9.3-release/contrib/gcclibs/libcpp/
H A Dsymtab.c68 table->entries = XCNEWVEC (hashnode, nslots);
81 free (table->entries);
115 node = table->entries[index];
138 node = table->entries[index];
159 table->entries[index] = node;
176 /* Double the size of a hash table, re-hashing existing entries. */
188 p = table->entries;
212 free (table->entries);
214 table->entries = nentries;
225 p = table->entries;
238 ht_load(hash_table *ht, hashnode *entries, unsigned int nslots, unsigned int nelements, bool own) argument
[all...]
/freebsd-9.3-release/crypto/heimdal/lib/krb5/
H A Dkeytab_memory.c41 krb5_keytab_entry *entries; member in struct:mkt_data
88 d->entries = NULL;
123 krb5_kt_free_entry(context, &d->entries[i]);
124 free(d->entries);
159 return krb5_kt_copy_entry_contents(context, &d->entries[c->fd++], entry);
177 tmp = realloc(d->entries, (d->num_entries + 1) * sizeof(*d->entries));
182 d->entries = tmp;
184 &d->entries[d->num_entries++]);
202 for(end = d->entries
[all...]
/freebsd-9.3-release/tools/tools/commitsdb/
H A Dmake_commit_db67 my @entries = split /----------------------------\n/, $log;
70 shift @entries;
74 foreach my $e (@entries) {
/freebsd-9.3-release/sys/cam/
H A Dcam_queue.c124 KASSERT(new_size >= queue->entries, ("camq_resize: "
125 "New queue size can't accomodate 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...]
/freebsd-9.3-release/sys/fs/coda/
H A Dcoda_opstats.h114 long entries; /* number of times call attempted */ member in struct:coda_op_stats
/freebsd-9.3-release/usr.bin/finger/
H A Dextern.h37 extern int entries; /* Number of people. */
/freebsd-9.3-release/usr.bin/column/
H A Dcolumn.c71 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-9.3-release/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(1, \
79 sizeof(*(table)->entries) * (_entries_size)); \
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...]
/freebsd-9.3-release/sys/netinet/libalias/
H A Dalias_mod.c140 LIST_FOREACH(b, &handler_chain, entries) {
146 LIST_INSERT_BEFORE(b, p, entries);
152 LIST_INSERT_AFTER(b, p, entries);
154 LIST_INSERT_HEAD(&handler_chain, p, entries);
164 LIST_FOREACH_SAFE(b, &handler_chain, entries, b_tmp) {
166 LIST_REMOVE(b, entries);
230 LIST_FOREACH(p, &handler_chain, entries) {
/freebsd-9.3-release/sys/powerpc/powermac/
H A Dpowermac_thermal.c66 SLIST_ENTRY(pmac_fan_le) entries;
71 SLIST_ENTRY(pmac_sens_le) entries;
103 SLIST_FOREACH(sensor, &sensors, entries) {
121 SLIST_FOREACH(fan, &fans, entries) {
124 SLIST_FOREACH(sensor, &sensors, entries) {
169 SLIST_INSERT_HEAD(&fans, list_entry, entries);
181 SLIST_INSERT_HEAD(&sensors, list_entry, entries);
/freebsd-9.3-release/usr.bin/ktrdump/
H A Dktrdump.c81 * Reads the ktr trace buffer from kernel memory and prints the trace entries.
94 int entries; local
170 entries = sb.st_size / sizeof(*buf);
176 if (kvm_read(kd, nl[1].n_value, &entries, sizeof(entries))
179 if ((buf = malloc(sizeof(*buf) * entries)) == NULL)
182 kvm_read(kd, nl[3].n_value, buf, sizeof(*buf) * entries)
221 i = (index - 1) % entries;
289 i = (i - 1) % entries;
291 if (++i == entries)
[all...]
/freebsd-9.3-release/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-9.3-release/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...]

Completed in 309 milliseconds

1234567891011