int main() {
int i;
el els[10], *e, *tmp, *tmp2;
for(i=0;i<10;i++) els[i].id='a'+i;
/* test LL macros */
printf("LL macros\n");
LL_APPEND(head,&els[0]);
LL_APPEND(head,&els[1]);
LL_APPEND(head,&els[2]);
LL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
LL_SEARCH_SCALAR(head, e, id, 'b');
if (e) printf("search scalar found b\n");
LL_SEARCH(head, e, &els[0], eltcmp);
if (e) printf("search found %c\n",e->id);
LL_FOREACH_SAFE(head,e,tmp) LL_DELETE(head,e);
printf("\n");
/* test DL macros */
printf("DL macros\n");
DL_APPEND(head,&els[0]);
DL_APPEND(head,&els[1]);
DL_APPEND(head,&els[2]);
DL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
DL_SEARCH_SCALAR(head, e, id, 'b');
if (e) printf("search scalar found b\n");
DL_SEARCH(head, e, &els[0], eltcmp);
if (e) printf("search found %c\n",e->id);
DL_FOREACH_SAFE(head,e,tmp) DL_DELETE(head,e);
printf("\n");
/* test CDL macros */
printf("CDL macros\n");
CDL_PREPEND(head,&els[0]);
CDL_PREPEND(head,&els[1]);
CDL_PREPEND(head,&els[2]);
CDL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
CDL_SEARCH_SCALAR(head, e, id, 'b');
if (e) printf("search scalar found b\n");
CDL_SEARCH(head, e, &els[0], eltcmp);
if (e) printf("search found %c\n",e->id);
CDL_FOREACH_SAFE(head,e,tmp,tmp2) CDL_DELETE(head,e);
return 0;
}
void Sinproc_socket_bound_rm_conn(nitro_inproc_socket_t *b,
nitro_inproc_socket_t *c) {
pthread_rwlock_wrlock(&b->link_lock);
HASH_DELETE(bound_hh, b->registry, c);
if (b->current == c) {
b->current = (c->next == c) ? NULL : c->next;
}
CDL_DELETE(b->links, c);
--b->num_links;
pthread_rwlock_unlock(&b->link_lock);
}
PANCAKE_API PancakeSchedulerEvent *PancakeSchedule(UNative time, PancakeSchedulerEventCallback callback, void *arg) {
PancakeSchedulerEvent *event;
if(unusedEvents) {
// Use cached event instance
event = unusedEvents;
CDL_DELETE(unusedEvents, unusedEvents);
} else {
// Allocate new event
event = PancakeAllocate(sizeof(PancakeSchedulerEvent));
}
event->time = time;
event->callback = callback;
event->arg = arg;
if(events) {
if(events->prev->time <= time) {
CDL_PREPEND_ELEM(events, events, event);
events = event->next;
} else if(events->time >= time) {
CDL_PREPEND(events, event);
} else {
PancakeSchedulerEvent *ev;
// Iterate through events and find place for new event
CDL_FOREACH(events, ev) {
if(ev->time == time) {
CDL_PREPEND_ELEM(events, ev->next, event);
break;
} else if(ev->time < time && ev->next->time >= time) {
CDL_PREPEND_ELEM(events, ev->next, event);
break;
}
}
}
} else {
int main(int argc, char *argv[]) {
int i;
el els[10], *e;
for(i=0;i<10;i++) els[i].id='a'+i;
/* test CDL macros */
printf("CDL macros\n");
CDL_PREPEND(head,&els[0]);
CDL_PREPEND(head,&els[1]);
CDL_PREPEND(head,&els[2]);
CDL_PREPEND(head,&els[3]);
CDL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
/* point head to head->next */
printf("advancing head pointer\n");
head = head->next;
CDL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
/* follow circular loop a few times */
for(i=0,e=head;e && i<10;i++,e=e->next)
printf("%c ", e->id);
printf("\n");
/* follow circular loop backwards a few times */
for(i=0,e=head;e && i<10;i++,e=e->prev)
printf("%c ", e->id);
printf("\n");
printf("deleting b\n");
CDL_DELETE(head,&els[1]);
CDL_FOREACH(head,e) printf("%c ", e->id);
printf("\n");
printf("deleting (a)\n");
CDL_DELETE(head,&els[0]);
CDL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting (c)\n");
CDL_DELETE(head,&els[2]);
CDL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting (d)\n");
CDL_DELETE(head,&els[3]);
CDL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
/* test DL macros */
printf("DL macros\n");
DL_PREPEND(head,&els[0]);
DL_PREPEND(head,&els[1]);
DL_PREPEND(head,&els[2]);
DL_APPEND(head,&els[3]);
DL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting c\n");
DL_DELETE(head,&els[2]);
DL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting a\n");
DL_DELETE(head,&els[0]);
DL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting b\n");
DL_DELETE(head,&els[1]);
DL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting d\n");
DL_DELETE(head,&els[3]);
DL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
/* test LL macros */
printf("LL macros\n");
LL_PREPEND(head,&els[0]);
LL_PREPEND(head,&els[1]);
LL_PREPEND(head,&els[2]);
LL_APPEND(head,&els[3]);
LL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting c\n");
LL_DELETE(head,&els[2]);
LL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting a\n");
LL_DELETE(head,&els[0]);
LL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting b\n");
LL_DELETE(head,&els[1]);
LL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
printf("deleting d\n");
LL_DELETE(head,&els[3]);
LL_FOREACH(head,e)
printf("%c ", e->id);
printf("\n");
return 0;
}
