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

1234

/barrelfish-master/usr/arrakismon/
H A Dps.c19 static struct ps_entry *entries[MAX_DOMAINS]; variable in typeref:struct:ps_entry
24 if(entries[i] == NULL) {
25 entries[i] = entry;
37 entries[domain_id] = NULL;
43 return entries[domain_id] != NULL ? true : false;
52 return entries[domain_id];
/barrelfish-master/lib/libc/stdlib/
H A Dhsearch.h36 size_t entries_used; /* Number of entries currently used. */
37 ENTRY *entries; /* Hash table entries. */ member in struct:__hsearch
H A Dhcreate_r.c41 * off with a table of sixteen entries. In most cases this hint is
48 hsearch->entries = calloc(16, sizeof(ENTRY));
49 if (hsearch->entries == NULL) {
H A Dhdestroy_r.c39 /* Free hash table object and its entries. */
41 free(hsearch->entries);
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. */
/barrelfish-master/doc/012-services/
H A Ddeptree.py23 entries = dict() variable
34 entries[line] = colors[i % len(colors)]
39 for entry in entries.keys():
42 for entry2 in entries:
68 print dep1, " -> ", dep2, " [color=\"", entries[dep1], "\"];"
70 print dep1, " -> ", dep2, " [color=\"", entries[dep1], "\"][style=\"dotted\"];"
/barrelfish-master/lib/vfs/
H A Dvfs_cache.c63 * Cache entries form an array with various internal linked lists:
64 * - For each hash, a linked list of entries with matching hashes exists.
66 * - A free list is stored for free entries, the first element is referenced by
68 * - An independant list of unused entries is stored. These are entries with
72 * unused_count stores the number of entries in the unused list for heuristics
87 struct cache_entry *entries; member in struct:fs_cache
145 struct cache_entry *entry = &cache->entries[entry_index-1];
150 cache->entries[entry->next_unused-1].prev_unused = 0;
161 cache->entries[entr
[all...]
/barrelfish-master/lib/libc/tests/sys/
H A Dqueue_test.c47 SLIST_ENTRY(entry) entries;
60 SLIST_FOREACH(np, &head, entries) {
71 SLIST_INSERT_HEAD(&head, n1, entries);
77 SLIST_FOREACH(np, &head, entries) {
91 SLIST_INSERT_AFTER(n1, n2, entries);
97 SLIST_INSERT_AFTER(n2, n3, entries);
100 SLIST_FOREACH(np, &head, entries) {
113 SLIST_REMOVE_HEAD(&head, entries);
120 SLIST_FOREACH(np, &head, entries) {
130 SLIST_REMOVE_AFTER(n2, entries);
[all...]
/barrelfish-master/usr/skb/octopus/
H A Dskiplist.h23 size_t entries; // used to sort lists based on #entries for intersect member in struct:skip_list
/barrelfish-master/lib/openssl-1.0.0d/crypto/asn1/
H A Dx_name.c137 if ((ret->entries=sk_X509_NAME_ENTRY_new_null()) == NULL)
150 if (ret->entries)
151 sk_X509_NAME_ENTRY_free(ret->entries);
165 sk_X509_NAME_ENTRY_pop_free(a->entries,X509_NAME_ENTRY_free);
181 STACK_OF(X509_NAME_ENTRY) *entries;
200 entries = sk_STACK_OF_X509_NAME_ENTRY_value(intname.s, i);
201 for(j = 0; j < sk_X509_NAME_ENTRY_num(entries); j++) {
202 entry = sk_X509_NAME_ENTRY_value(entries, j);
204 if(!sk_X509_NAME_ENTRY_push(nm.x->entries, entry))
207 sk_X509_NAME_ENTRY_free(entries);
[all...]
/barrelfish-master/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DVizParent.java30 * Abstract class to define entries inside a visualizer. May contain a collection
31 * of other entries. This needs some cleanup, at the moment this whole hierarchy
37 private VizParentCollection entries; field in class:VizParent
41 entries = new VizParentCollection();
45 * all VizParent entries use an index
49 entries = new VizParentCollection();
122 return entries;
128 * @return collection of entries
221 entries.add(entry);
230 for(VizParent entry: entries) {
[all...]
/barrelfish-master/usr/spawnd/
H A Dps.c23 static struct ps_entry *entries[MAX_DOMAINS]; variable in typeref:struct:ps_entry
28 if(entries[i] == NULL) {
29 entries[i] = entry;
42 entries[domain_id] = NULL;
48 return entries[domain_id] != NULL ? true : false;
57 return entries[domain_id];
/barrelfish-master/usr/drivers/xeon_phi/
H A Dsmpt.h22 xeon_phi_smpt_entry_t entries[xeon_phi_smpt_system_page_num]; member in struct:smpt_info
56 phi->smpt->entries[slot] = e;
72 phi->smpt->entries[slot] = 0x0;
/barrelfish-master/usr/eclipseclp/Kernel/src/
H A Dtrace.h72 int entries; member in struct:__anon1648
90 events[theader.entries % MAX_EVENTS].event = EVENT; \
91 events[theader.entries % MAX_EVENTS].time = now; \
92 theader.entries++; \
93 if ((theader.entries % MAX_EVENTS) == (MAX_EVENTS - 1)) \
H A Dtrace.c162 theader.entries = 0;
166 events[theader.entries % MAX_EVENTS].event = IDLE;
168 events[theader.entries % MAX_EVENTS].event = WORKING;
170 events[theader.entries % MAX_EVENTS].time = theader.start_time;
171 theader.entries++;
230 totalentries+= copy_theader.entries;
262 copy_theader.entries = gsxid++;
299 ub = theader.entries % MAX_EVENTS;
328 gsxid = copy_theader.entries;
345 for(i = 0; i < theader.entries ;
[all...]
/barrelfish-master/include/hashtable/
H A Dhashtable.h43 struct _ht_entry **entries; member in struct:hashtable
/barrelfish-master/lib/hashtable/
H A Dhashtable.c63 * \brief get the number of entries in a hashtable
65 * \return the number of entries
96 entry->next = ht->entries[_index];
97 ht->entries[_index] = entry;
148 struct _ht_entry *_e = ht->entries[_index];
173 struct _ht_entry *_e = ht->entries[_index];
194 struct _ht_entry *_e = ht->entries[_index];
199 ht->entries[_index] = _e->next;
225 _ht->entries = malloc(_ht->table_length * sizeof(struct _ht_entry));
226 assert(_ht->entries !
[all...]
/barrelfish-master/usr/ramfsd/
H A Dramfs.c35 struct dirent *entries; ///< children of this dir member in struct:dirent::__anon444::__anon446
52 root->u.dir.entries = NULL;
75 assert(e->u.dir.entries == NULL);
115 struct dirent *e = dir->u.dir.entries;
140 for (e = dir->u.dir.entries; e != NULL; e = e->next) {
229 if (dir->u.dir.entries == NULL) {
231 dir->u.dir.entries = child;
232 child->prevp = &dir->u.dir.entries;
236 for (e = dir->u.dir.entries; ; e = e->next) {
307 d->u.dir.entries
[all...]
/barrelfish-master/lib/tenaciousd/
H A Dlog.c34 uint64_t entries; member in struct:log_header
113 log->entries = header->entries;
126 // More entries -- log header not up-to-date
127 log->entries++;
148 log->entries = header->entries;
168 header->entries = log->entries;
192 log->entries
[all...]
H A Daio_vsic.c106 int entries = 0; local
123 entries++;
132 if(entries == 0) {
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/net/mlx4/
H A Dport.c70 table->entries[i] = 0;
82 table->entries[i] = 0;
106 == (MLX4_MAC_MASK & be64_to_cpu(table->entries[i])))
114 __be64 *entries) {
123 memcpy(mailbox->buf, entries, MLX4_MAC_TABLE_SIZE);
150 if ((mac == (MLX4_MAC_MASK & be64_to_cpu(table->entries[i])))
162 /*No free mac entries*/
168 table->entries[free] = cpu_to_be64(mac | MLX4_MAC_VALID);
170 err = mlx4_set_port_mac_table(dev, port, table->entries);
173 table->entries[fre
113 mlx4_set_port_mac_table(struct mlx4_dev *dev, u8 port, __be64 *entries) argument
[all...]
H A Den_cq.c48 int entries, int ring, enum cq_type mode, int node) {
62 cq->size = entries;
47 mlx4_en_create_cq(struct mlx4_en_priv *priv, struct mlx4_en_cq **pcq, int entries, int ring, enum cq_type mode, int node) argument
/barrelfish-master/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); \
/barrelfish-master/lib/openssl-1.0.0d/crypto/x509/
H A Dx509name.c95 return(sk_X509_NAME_ENTRY_num(name->entries));
118 sk=name->entries;
131 if(name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
135 return(sk_X509_NAME_ENTRY_value(name->entries,loc));
144 if (name == NULL || sk_X509_NAME_ENTRY_num(name->entries) <= loc
147 sk=name->entries;
220 sk=name->entries;
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mlx4/
H A Dcq.c175 struct ib_cq *mlx4_ib_create_cq(struct ib_device *ibdev, int entries, argument
182 if (entries < 1 || entries > dev->dev->caps.max_cqes)
189 entries = roundup_pow_of_two(entries + 1);
190 cq->ibcq.cqe = entries - 1;
205 ucmd.buf_addr, entries);
224 err = mlx4_ib_alloc_cq_buf(dev, &cq->buf, entries);
234 err = mlx4_cq_alloc(dev->dev, entries, &cq->buf.mtt, uar, cq->db.dma,
270 int entries)
[all...]

Completed in 247 milliseconds

1234