Searched refs:entry (Results 1 - 25 of 231) sorted by relevance

12345678910

/barrelfish-2018-10-04/usr/eclipseclp/CPViz/viz/src/ie/ucc/cccc/viz/
H A DVizParentCollection.java58 for(VizParent entry: this){
59 res[entry.getSingleIndex()]= entry.getDomainAsList();
65 for(VizParent entry: this){
66 res.put(entry.getXYIndex(), entry.getDomainAsList());
76 for(VizParent entry: this){
77 res[entry.getSingleIndex()]= entry.asTuple();
87 for(VizParent entry
[all...]
H A DVisualizerGCCMatrix.java48 for(Map.Entry<Pair, FullDomain> entry : matrix.entrySet()){
49 drawMatrixEntry(out,entry.getKey(),entry.getValue(),new FullDomain());
/barrelfish-2018-10-04/kernel/include/arch/x86/
H A Dstart_aps.h28 int start_aps_k1om_start(coreid_t core_id, genvaddr_t entry);
29 int start_aps_x86_64_start(coreid_t core_id, genvaddr_t entry);
30 int start_aps_x86_32_start(coreid_t core_id, genvaddr_t entry);
/barrelfish-2018-10-04/lib/libc/posix1e/
H A Dacl_from_text_nfs4.c49 * Parse the tag field of ACL entry passed as "str". If qualifier
54 parse_tag(const char *str, acl_entry_t entry, int *need_qualifier) argument
61 return (acl_set_tag_type(entry, ACL_USER_OBJ));
63 return (acl_set_tag_type(entry, ACL_GROUP_OBJ));
65 return (acl_set_tag_type(entry, ACL_EVERYONE));
70 return (acl_set_tag_type(entry, ACL_USER));
72 return (acl_set_tag_type(entry, ACL_GROUP));
80 * Parse the qualifier field of ACL entry passed as "str".
86 parse_qualifier(char *str, acl_entry_t entry, int *need_qualifier) argument
102 error = acl_get_tag_type(entry,
116 parse_access_mask(char *str, acl_entry_t entry) argument
131 parse_flags(char *str, acl_entry_t entry) argument
146 parse_entry_type(const char *str, acl_entry_t entry) argument
164 parse_appended_id(char *str, acl_entry_t entry) argument
205 acl_entry_t entry; local
[all...]
H A Dacl_branding.c50 entry2acl(acl_entry_t entry) argument
54 aclp = (acl_t)(((long)entry >> _ACL_T_ALIGNMENT_BITS) << _ACL_T_ALIGNMENT_BITS);
70 _entry_brand(const acl_entry_t entry) argument
73 return (_acl_brand(entry2acl(entry)));
93 _entry_brand_may_be(const acl_entry_t entry, int brand) argument
96 return (_acl_brand_may_be(entry2acl(entry), brand));
112 _entry_brand_as(const acl_entry_t entry, int brand) argument
115 _acl_brand_as(entry2acl(entry), brand);
H A Dacl_from_text.c49 int _nfs4_acl_entry_from_text(acl_t aclp, char *entry);
50 int _text_could_be_nfs4_acl(const char *entry);
82 _posix1e_acl_entry_from_text(acl_t aclp, char *entry) argument
93 tag = strsep(&entry, ":");
99 if ((*tag == '\0') && (!entry)) {
108 qualifier = strsep(&entry, ":");
116 permission = strsep(&entry, ":");
117 if (permission == NULL || entry) {
168 _text_is_nfs4_entry(const char *entry) argument
172 assert(strlen(entry) >
195 char *mybuf_p, *line, *cur, *notcomment, *comment, *entry; local
[all...]
/barrelfish-2018-10-04/lib/vfs/
H A Dvfs_cache.c61 * Important: all entry indices are 1-based as 0 is used to indicate invalid.
145 struct cache_entry *entry = &cache->entries[entry_index-1]; local
146 assert(!entry->prev_unused);
149 if (entry->next_unused) {
150 cache->entries[entry->next_unused-1].prev_unused = 0;
155 cache->first_unused = entry->next_unused;
160 if (entry->next) {
161 cache->entries[entry->next-1].prev = entry->prev;
163 if (entry
259 get_new_entry(struct fs_cache *cache, size_t hash, struct cache_entry **entry) argument
281 remove_from_unused(struct fs_cache *cache, struct cache_entry *entry) argument
324 struct cache_entry *entry = &cache->entries[entry_index-1]; local
352 struct cache_entry *entry = NULL; local
425 struct cache_entry *entry = &cache->entries[entry_index-1]; local
[all...]
H A Dvfs_blockdevfs.c37 void blockdev_append_entry(struct blockdev_entry *entry) argument
39 entry->next = NULL; // this is the last element in any case
41 entries_first = entry;
42 entries_last = entry;
43 entry->prev = NULL;
45 entries_last->next = entry;
46 entry->prev = entries_last;
47 entries_last = entry;
53 struct blockdev_entry *entry; member in struct:blockdevfs_handle
59 struct blockdev_entry *entry; member in struct:blockdevfs_dirhandle
163 struct blockdev_entry *entry = h->entry; local
182 struct blockdev_entry *entry = h->entry; local
253 struct blockdev_entry *entry = handle->entry; local
316 struct blockdev_entry *entry = handle->entry; local
[all...]
/barrelfish-2018-10-04/usr/proc_mgmt/
H A Ddomain.c91 * \brief Creates and returns a new domain entry.
94 * \param ret_entry returned domain entry, must be passed in non-NULL.
101 struct domain_entry *entry = (struct domain_entry*) malloc( local
103 if (entry == NULL) {
107 entry->cap_node = cap_node;
108 entry->status = DOMAIN_STATUS_NIL;
109 memset(entry->spawnds, 0, sizeof(entry->spawnds));
110 entry->num_spawnds_running = 0;
111 entry
174 struct domain_entry *entry = (struct domain_entry*) ele; local
197 domain_run_on_core(struct domain_entry *entry, coreid_t core_id) argument
221 struct domain_entry *entry = NULL; local
243 struct domain_entry *entry = NULL; local
272 struct domain_entry *entry = (struct domain_entry*) ele; local
[all...]
/barrelfish-2018-10-04/kernel/include/arch/armv8/
H A Dstart_aps.h27 int start_aps_arm_start(coreid_t core_id, genvaddr_t entry);
/barrelfish-2018-10-04/lib/dma/
H A Ddma_mem_mgr.c116 struct dma_mem_node *entry)
120 entry->next = NULL;
121 entry->prev = NULL;
122 tree->root = entry;
127 struct dma_mem_node *node = mem_tree_find_nearest(tree, entry->paddr);
131 entry->prev = NULL;
132 entry->next = tree->root;
133 tree->root->prev = entry;
137 if (node->paddr <= entry->paddr) {
139 if ((node->paddr + node->size) >= (entry
115 mem_tree_insert(struct dma_mem_tree *tree, struct dma_mem_node *entry) argument
268 struct dma_mem_node *entry = calloc(1, sizeof(*entry)); local
336 struct dma_mem_node *entry = mem_tree_remove(&mem_mgr->regions, addr); local
379 struct dma_mem_node *entry = mem_tree_lookup(&mem_mgr->regions, daddr, bytes); local
[all...]
/barrelfish-2018-10-04/lib/libc/stdlib/
H A Dhsearch_r.c39 * Look up an unused entry in the hash table for a given hash. For this
49 ENTRY *entry = &hsearch->entries[index & hsearch->index_mask]; local
50 if (entry->key == NULL)
51 return (entry);
79 ENTRY *entry, *old_entries, *new_entries; local
86 * Search the hash table for an existing entry for this key.
87 * Stop searching if we run into an unused hash table entry.
90 entry = &hsearch->entries[index & hsearch->index_mask];
91 if (entry->key == NULL)
93 if (strcmp(entry
[all...]
/barrelfish-2018-10-04/usr/eclipseclp/Alog/src/
H A Dmergelogs.c42 struct log_entry entry; member in struct:list_struct
100 struct log_entry *entry; local
146 read_logentry(in,&(ptr->entry),DO_NEGATIVE);
192 entry = &(files[i]->entry);
194 if ( entry->event < 0 )
198 fprintf(headerfp,"%d %d %d %d %d %lu %s\n",entry->event,
199 entry->proc_id,entry->task_id,entry
295 struct log_entry *entry; local
399 struct log_entry *entry; local
[all...]
/barrelfish-2018-10-04/include/vm/
H A Dvm_map.c114 * [That is, an entry is split into two, bordering at a
133 static void vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map);
134 static void vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry);
135 static void vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry);
145 static void vm_map_wire_entry_failure(vm_map_t map, vm_map_entry_t entry,
181 * Map and entry structures are allocated from the general
514 vm_map_entry_t entry, next; local
518 entry = td->td_map_def_user;
520 while (entry != NULL) {
521 next = entry
818 vm_map_entry_dispose(vm_map_t map, vm_map_entry_t entry) argument
850 vm_map_entry_set_behavior(vm_map_entry_t entry, u_char behavior) argument
862 vm_map_entry_set_max_free(vm_map_entry_t entry) argument
990 vm_map_entry_link(vm_map_t map, vm_map_entry_t after_where, vm_map_entry_t entry) argument
1033 vm_map_entry_unlink(vm_map_t map, vm_map_entry_t entry) argument
1072 vm_map_entry_resize_free(vm_map_t map, vm_map_entry_t entry) argument
1099 vm_map_lookup_entry( vm_map_t map, vm_offset_t address, vm_map_entry_t *entry) argument
1383 vm_map_entry_t entry; local
1561 vm_map_simplify_entry(vm_map_t map, vm_map_entry_t entry) argument
1657 _vm_map_clip_start(vm_map_t map, vm_map_entry_t entry, vm_offset_t start) argument
1741 _vm_map_clip_end(vm_map_t map, vm_map_entry_t entry, vm_offset_t end) argument
1820 vm_map_entry_t entry; local
1960 vm_map_entry_t current, entry; local
2110 vm_map_entry_t current, entry; local
2287 vm_map_entry_t entry; local
2326 vm_map_entry_t entry, first_entry, tmp_entry; local
2490 vm_map_wire_entry_failure(vm_map_t map, vm_map_entry_t entry, vm_offset_t failed_addr) argument
2527 vm_map_entry_t entry, first_entry, tmp_entry; local
2793 vm_map_entry_t entry; local
2880 vm_map_entry_unwire(vm_map_t map, vm_map_entry_t entry) argument
2893 vm_map_entry_deallocate(vm_map_entry_t entry, boolean_t system_map) argument
2907 vm_map_entry_delete(vm_map_t map, vm_map_entry_t entry) argument
2980 vm_map_entry_t entry; local
3100 vm_map_entry_t entry; local
3260 vmspace_map_entry_forked(const struct vmspace *vm1, struct vmspace *vm2, vm_map_entry_t entry) argument
3975 vm_map_entry_t entry; local
4148 vm_map_entry_t entry; local
4220 vm_map_lookup_done(vm_map_t map, vm_map_entry_t entry) argument
4237 vm_map_entry_t entry; local
[all...]
/barrelfish-2018-10-04/lib/lwip2/src/core/
H A Ddns.c146 * like one entry (used/free) */
214 /* DNS table entry states */
222 /** DNS table entry */
244 /** DNS request table entry: used when dns_gehostbyname cannot answer the
410 struct local_hostlist_entry *entry; local
419 entry = (struct local_hostlist_entry *)memp_malloc(MEMP_LOCALHOSTLIST);
420 LWIP_ASSERT("mem-error in dns_init_local", entry != NULL);
421 if (entry != NULL) {
422 char* entry_name = (char*)entry + sizeof(struct local_hostlist_entry);
425 entry
447 struct local_hostlist_entry *entry = local_hostlist_dynamic; local
491 struct local_hostlist_entry *entry = local_hostlist_dynamic; local
532 struct local_hostlist_entry *entry = local_hostlist_dynamic; local
567 struct local_hostlist_entry *entry; local
745 struct dns_table_entry* entry = &dns_table[idx]; local
1014 struct dns_table_entry *entry = &dns_table[i]; local
1103 struct dns_table_entry *entry = &dns_table[idx]; local
1159 const struct dns_table_entry *entry = &dns_table[i]; local
1322 struct dns_table_entry *entry = NULL; local
[all...]
/barrelfish-2018-10-04/lib/tenaciousd/
H A Dlog.c42 // Allocate minimum sized log entry
43 struct tenaciousd_log_entry *entry = local
45 assert(entry != NULL);
47 // Read minimum sized entry
49 LOG_MIN_ENTRY_SIZE(log), entry);
56 storage_free(log, entry);
61 if(entry->size + sizeof(struct tenaciousd_log_entry)
63 return entry;
67 entry = storage_realloc(log->vsic, entry,
184 tenaciousd_log_append(struct tenaciousd_log *log, struct tenaciousd_log_entry *entry) argument
207 struct tenaciousd_log_entry *entry = local
245 struct tenaciousd_log_entry *entry = storage_malloc(log->vsic, *size); local
255 tenaciousd_log_entry_resize(struct tenaciousd_log *log, struct tenaciousd_log_entry *entry, size_t *newsize) argument
270 tenaciousd_log_entry_delete(struct tenaciousd_log *log, struct tenaciousd_log_entry *entry) argument
[all...]
/barrelfish-2018-10-04/lib/barrelfish/include/target/x86/
H A Dpmap_x86.h27 * \brief check whether vnode `root` has children in [entry .. entry+len).
28 * \return * true iff `root` has children in [entry .. entry+len) and
30 * * true iff `root` has valid page mappings in [entry .. entry+len)
33 bool has_vnode(struct vnode *root, uint32_t entry, size_t len,
36 * \return vnode at `entry` in `root`. NULL if no vnode there.
38 struct vnode *find_vnode(struct vnode *root, uint16_t entry);
41 * \return true iff [entry
[all...]
/barrelfish-2018-10-04/usr/pci/
H A Ddriver_mapping.h77 struct driver_mapping_entry *entry = &entries[i]; local
79 if(entry->class_code == class && entry->vendor_id == vendor &&
80 entry->device_id == device) {
81 return *entry;
/barrelfish-2018-10-04/usr/skb/skb_simple/
H A Doctopus_stubs.c152 struct record* entry = &record_storage[i]; local
153 if (entry->name == NULL) {
157 if (strcmp(RECORD_NAME(ast), entry->name) == 0 && entry->record != NULL) {
158 transform_to_string(entry->record, sqs->std_out.buffer);
166 static void wakeup_clients(struct record* entry) argument
168 struct wait_queue* cur = entry->waiting_parties;
175 transform_to_string(entry->record,
186 entry->waiting_parties = NULL;
197 struct record* entry local
213 struct record* entry = &record_storage[i]; local
233 struct record* entry = &record_storage[i]; local
284 struct record* entry = &record_storage[i]; local
333 struct record* entry = NULL; local
[all...]
/barrelfish-2018-10-04/tools/usbboot/
H A Daboot.c44 u32 len, addr, entry, msg; local
63 usb_read(&usb, &entry, 4);
65 printf("Entry point is %08X\n", entry);
70 *_entry = entry;
98 void (*entry)(u32, u32, u32, u32)= (void *)entry_point;
101 entry(0, 0, 0, 0);
108 u32 len, addr = CONFIG_ADDR_DOWNLOAD, entry; local
123 n = load_from_usb(&len, &addr, &entry);
129 boot_image(entry);
/barrelfish-2018-10-04/lib/barrelfish/arch/x86/
H A Dpmap.c21 bool has_vnode(struct vnode *root, uint32_t entry, size_t len, argument
28 uint32_t end_entry = entry + len;
30 // region we check [entry .. end_entry)
34 // region to check [entry .. end_entry)
35 // this amounts to n->entry == entry for len = 1
36 if (n->is_vnode && n->entry >= entry && n->entry < end_entry) {
46 assert(n->entry < entr
89 find_vnode(struct vnode *root, uint16_t entry) argument
114 inside_region(struct vnode *root, uint32_t entry, uint32_t npages) argument
157 alloc_vnode(struct pmap_x86 *pmap, struct vnode *root, enum objtype type, uint32_t entry, struct vnode **retvnode) argument
216 remove_empty_vnodes(struct pmap_x86 *pmap, struct vnode *root, uint32_t entry, size_t len) argument
290 uint16_t entry; ///< Entry # member in struct:serial_entry
[all...]
/barrelfish-2018-10-04/kernel/include/arch/x86_64/
H A Dvmkit.h27 void __attribute__ ((noreturn)) vmkit_vmexec (struct dcb *dcb, lvaddr_t entry);
/barrelfish-2018-10-04/lib/barrelfish/include/arch/x86_32/arch/
H A Dregisters.h24 lvaddr_t entry, lvaddr_t stack, uint32_t arg1,
27 registers_x86_32_set_initial(regs, thread, entry, stack, arg1, arg2, arg3, arg4);
23 registers_set_initial(arch_registers_state_t *regs, struct thread *thread, lvaddr_t entry, lvaddr_t stack, uint32_t arg1, uint32_t arg2, uint32_t arg3, uint32_t arg4) argument
/barrelfish-2018-10-04/lib/barrelfish/include/arch/x86_64/arch/
H A Dregisters.h24 lvaddr_t entry, lvaddr_t stack, uint64_t arg1,
27 registers_x86_64_set_initial(regs, thread, entry, stack, arg1, arg2, arg3, arg4);
23 registers_set_initial(arch_registers_state_t *regs, struct thread *thread, lvaddr_t entry, lvaddr_t stack, uint64_t arg1, uint64_t arg2, uint64_t arg3, uint64_t arg4) argument
/barrelfish-2018-10-04/include/tenaciousd/
H A Dlog.h28 struct tenaciousd_log_entry *entry; member in struct:tenaciousd_log_iter
46 struct tenaciousd_log_entry *entry);
61 struct tenaciousd_log_entry *entry,
65 struct tenaciousd_log_entry *entry);
69 return iter.entry == NULL ? true : false;
74 return (void *)iter.entry->data;

Completed in 133 milliseconds

12345678910