ATF_TC_BODY(slist_test, tc) { SLIST_HEAD(stailhead, entry) head = SLIST_HEAD_INITIALIZER(head); struct entry { SLIST_ENTRY(entry) entries; int i; } *n1, *n2, *n3, *np;
int main() { int i = 0; struct sListElement { int fD; SLIST_ENTRY(sListElement) sListElements; /* Singly-linked List. */ } *e1_p, *e2_p, *e3_p, *next_p;
static int console_init_file_cache() { struct dirent *dp = NULL; DIR *dirp = NULL; int ret = 0; struct cache_file { SLIST_ENTRY(cache_file) entries; char *file_name; };
void IT_destroy(IntervalTree *it) { IntervalTreeNode *x = it->root->left; SLIST_HEAD(node_head, nodeent) stuffToFree = SLIST_HEAD_INITIALIZER(stuffToFree); struct nodeent { SLIST_ENTRY(nodeent) link; struct IntervalTreeNode *node; } *np;
END_TEST /* * Insert at the head. Check SLIST_NEXT(). */ START_TEST(SLIST02) { SLIST_HEAD(slisthead_t, node_t) slisthead = SLIST_HEAD_INITIALIZER(slisthead); struct node_t { int data; SLIST_ENTRY(node_t) links; } *elm1, *elm2;