Searched refs:walk (Results 1 - 23 of 23) sorted by relevance

/barrelfish-2018-10-04/usr/boot_perfmon/
H A Drelations.c66 struct list *walk = r->head; local
67 while (walk) {
68 if (walk->id == id) {
69 *b = walk->b;
72 walk = walk->next;
83 struct list *walk = r->head; local
84 while (walk) {
85 err = func(st, walk->id, walk
99 struct list *walk = r->head; local
[all...]
/barrelfish-2018-10-04/lib/barrelfish/slot_alloc/
H A Drange_slot_alloc.c34 struct cnode_meta *prev = NULL, *walk = NULL; local
38 walk = alloc->meta;
40 while(walk != NULL) {
41 if (walk->space >= nslots && walk->slot + nslots <= L2_CNODE_SLOTS) {
44 prev = walk;
45 walk = walk->next;
49 if (walk != NULL) {
63 ret->slot = walk
91 insert_after(struct range_slot_allocator *alloc, size_t nslots, cslot_t slot, struct cnode_meta *walk) argument
121 insert_before(struct range_slot_allocator *alloc, size_t nslots, cslot_t slot, struct cnode_meta *prev, struct cnode_meta *walk) argument
195 struct cnode_meta *walk = alloc->meta; local
290 struct cnode_meta *walk = alloc->meta; local
[all...]
H A Dsingle_slot_alloc.c49 struct cnode_meta *walk = sca->head; local
50 sca->head = walk->next;
51 slab_free(&sca->slab, walk);
65 struct cnode_meta *walk = sca->head; local
94 while (walk != NULL) {
95 // Freeing at the edge of walk
96 if (slot == walk->slot + walk->space) {
97 walk->space += count;
99 // check if we can merge walk t
[all...]
H A Dtwolevel_slot_alloc.c36 struct slot_allocator_list *walk = mca->head; local
38 while(walk != NULL) {
39 err = walk->a.a.alloc(&walk->a.a, ret);
43 //prev = walk;
44 walk = walk->next;
147 struct slot_allocator_list *walk = mca->head; local
149 while(walk != NULL) {
150 err = walk
[all...]
/barrelfish-2018-10-04/lib/barrelfish/vspace/
H A Dvspace.c92 struct vregion *walk = vspace->head; local
94 while (walk != NULL) {
95 if (region->base <= walk->base) {
97 if (region->base + region->size > walk->base
108 region->next = walk;
113 prev = walk;
114 walk = walk->next;
138 struct vregion *walk = vspace->head; local
141 while (walk) {
201 struct vregion *walk = vspace->head; local
230 struct vregion *walk = vspace->head; local
[all...]
H A Dmemobj_anon.c61 struct vregion_list *walk = anon->vregion_list; local
63 data->next = walk;
294 struct memobj_frame_list *walk = anon->frame_list; local
296 while(walk) {
297 if (new->offset < walk->offset) {
299 || new->offset + new->size > walk->offset) {
303 new->next = walk;
307 assert(walk == anon->frame_list);
312 prev = walk;
313 walk
423 struct memobj_frame_list *walk = anon->frame_list; local
[all...]
H A Dmemobj_one_frame.c34 struct vregion_list *walk = one_frame->vregion_list; local
36 data->next = walk;
67 struct vregion_list *walk = one_frame->vregion_list; local
69 while (walk) {
70 if (walk->region == vregion) {
72 prev->next = walk->next;
73 free(walk);
76 one_frame->vregion_list = walk->next;
77 free(walk);
82 prev = walk;
[all...]
H A Dmemobj_one_frame_lazy.c34 struct vregion_list *walk = lazy->vregion_list; local
36 data->next = walk;
/barrelfish-2018-10-04/lib/octopus/server/
H A Dqueue.c38 struct oct_reply_state** walk = (struct oct_reply_state**) &(b->st); local
39 for (; *walk != NULL; walk = &(*walk)->next) {
42 *walk = st;
/barrelfish-2018-10-04/usr/kaluga/
H A Dqueue.c22 struct mon_msg_state** walk = (struct mon_msg_state**) &(b->st); local
23 for(; *walk != NULL; walk = &(*walk)->next) {
26 *walk = st;
/barrelfish-2018-10-04/usr/acpi/
H A Dacpica_osglue.c537 for (struct AcpiMapping *walk = head; walk; walk = walk->next)
543 walk->pbase,
544 vregion_get_base_addr(walk->vregion),
545 walk->length,
546 walk->refcount);
577 for (struct AcpiMapping *walk = head; walk; wal
[all...]
/barrelfish-2018-10-04/usr/skb/
H A Dqueue.c26 struct skb_reply_state** walk = (struct skb_reply_state**) &(b->st); local
27 for(; *walk != NULL; walk = &(*walk)->next) {
30 *walk = st;
/barrelfish-2018-10-04/usr/tests/vspace_tests/
H A Dvspace_dump.c9 struct vregion *walk = vspace->head; local
11 while (walk != NULL) {
12 genvaddr_t base = vregion_get_base_addr(walk);
13 genvaddr_t size = vregion_get_size(walk);
15 walk = walk->next;
/barrelfish-2018-10-04/lib/vfs/
H A Dmmap.c47 struct memobj_frame_list *walk = anon->frame_list; local
48 while (walk) {
49 if (offset >= walk->offset && offset < walk->offset + walk->size) {
52 walk = walk->next;
55 if (walk == NULL) {
59 genvaddr_t map_offset = vregion_off + walk->offset;
60 size_t nbytes = walk
[all...]
/barrelfish-2018-10-04/lib/barrelfish/arch/x86/
H A Dpmap.c136 struct vnode *walk = root->u.vnode.children; local
138 while (walk) {
139 if (walk == item) {
141 prev->next = walk->next;
144 root->u.vnode.children = walk->next;
148 prev = walk;
149 walk = walk->next;
284 * walk of the tree. Each vnode is encoded as an entry in an array.
318 // depth-first walk
457 struct vregion *walk = pmap->vspace->head; local
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/util/
H A Dsrc-dep.pl33 { push(@final,&walk($bit)); }
43 sub walk subroutine
60 push(@ret,&walk($r));
/barrelfish-2018-10-04/lib/barrelfish/arch/aarch64/
H A Dpmap.c161 struct vnode *walk = root->u.vnode.children; local
163 while (walk) {
164 if (walk == item) {
166 prev->next = walk->next;
169 root->u.vnode.children = walk->next;
173 prev = walk;
174 walk = walk->next;
710 struct vregion *walk = pmap->vspace->head; local
711 while (walk
[all...]
/barrelfish-2018-10-04/lib/barrelfish/arch/arm/
H A Dpmap.c222 struct vnode *walk = root->u.vnode.children; local
224 while (walk) {
225 if (walk == item) {
227 prev->next = walk->next;
230 root->u.vnode.children = walk->next;
234 prev = walk;
235 walk = walk->next;
972 struct vregion *walk = pmap->vspace->head; local
973 while (walk
[all...]
/barrelfish-2018-10-04/lib/openssl-1.0.0d/crypto/
H A Dsparccpuid.S32 call .walk.reg.wins
140 .walk.reg.wins:
148 call .walk.reg.wins
/barrelfish-2018-10-04/usr/eclipseclp/documents/tutorial/
H A Drepairtut.tex597 follow this schema: {\em random walk}, {\em simulated annealing} and
599 Random walk and tabu search do not use the full schema, as there is
604 \subsection{Random walk}
605 \index{random walk}
608 The idea of Random walk is to start from a random tentative assignment of
675 move operator to the random walk example.
/barrelfish-2018-10-04/usr/eclipseclp/documents/search/
H A Dsearch.tex1128 except that some methods (random walk and the tabu search)
1135 \subsection{Random walk}
1138 As a simple example of local search, let us look at a random walk
1263 \item As in the random walk example, constraint satisfaction is checked
/barrelfish-2018-10-04/doc/019-device-drivers/
H A DDeviceDriver.tex62 This document describes how we write device drivers in Barrelfish. It will walk
169 driver as a walk-through from the Barrelfish code base -- the FDIF driver, a
/barrelfish-2018-10-04/doc/003-hake/
H A DHake.tex269 The core of Hake consists of the code to walk the source tree, a

Completed in 204 milliseconds