You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
72 lines
1.5 KiB
72 lines
1.5 KiB
#include "config.h"
|
|
#include <stdio.h>
|
|
#include <string.h>
|
|
|
|
/**
|
|
* list - double linked list routines
|
|
*
|
|
* The list header contains routines for manipulating double linked lists.
|
|
* It defines two types: struct list_head used for anchoring lists, and
|
|
* struct list_node which is usually embedded in the structure which is placed
|
|
* in the list.
|
|
*
|
|
* Example:
|
|
* #include <err.h>
|
|
* #include <stdio.h>
|
|
* #include <stdlib.h>
|
|
* #include <ccan/list/list.h>
|
|
*
|
|
* struct parent {
|
|
* const char *name;
|
|
* struct list_head children;
|
|
* unsigned int num_children;
|
|
* };
|
|
*
|
|
* struct child {
|
|
* const char *name;
|
|
* struct list_node list;
|
|
* };
|
|
*
|
|
* int main(int argc, char *argv[])
|
|
* {
|
|
* struct parent p;
|
|
* struct child *c;
|
|
* int i;
|
|
*
|
|
* if (argc < 2)
|
|
* errx(1, "Usage: %s parent children...", argv[0]);
|
|
*
|
|
* p.name = argv[1];
|
|
* list_head_init(&p.children);
|
|
* p.num_children = 0;
|
|
* for (i = 2; i < argc; i++) {
|
|
* c = malloc(sizeof(*c));
|
|
* c->name = argv[i];
|
|
* list_add(&p.children, &c->list);
|
|
* p.num_children++;
|
|
* }
|
|
*
|
|
* printf("%s has %u children:", p.name, p.num_children);
|
|
* list_for_each(&p.children, c, list)
|
|
* printf("%s ", c->name);
|
|
* printf("\n");
|
|
* return 0;
|
|
* }
|
|
*
|
|
* License: BSD-MIT
|
|
* Author: Rusty Russell <rusty@rustcorp.com.au>
|
|
*/
|
|
int main(int argc, char *argv[])
|
|
{
|
|
if (argc != 2)
|
|
return 1;
|
|
|
|
if (strcmp(argv[1], "depends") == 0) {
|
|
printf("ccan/str\n");
|
|
printf("ccan/container_of\n");
|
|
printf("ccan/check_type\n");
|
|
return 0;
|
|
}
|
|
|
|
return 1;
|
|
}
|
|
|