Documentation/core-api/list.rst

87           INIT_LIST_HEAD(&circus->car.clowns);
102 We'll return to our clown car example to illustrate how nodes get added to the
109           struct clown_car *car = &circus->car;
122           list_add(&grock->node, &car->clowns);
132           list_add(&dimitri->node, &car->clowns);
183           list_add_tail(&dimitri->node, &car->clowns);
218           list_for_each(cur, &circus->car.clowns) {
245           list_for_each_entry(e, &circus->car.clowns, node) {
274           list_add(&dimitri->node, &car->clowns);
309           list_add(&dimitri->node, &car->clowns);
354           list_for_each_entry_safe(e, n, &circus->car.clowns, node) {
390           struct clown_car *car = &circus->car;
394           list_cut_position(&retirement, &car->clowns, &pic->node);
399 The resulting ``car->clowns`` list would be this::
426           struct clown_car *car = &circus->car;
430           list_cut_before(&retirement, &car->clowns, &pic->node);
435 The resulting ``car->clowns`` list would be this::
483           struct clown_car *car = &circus->car;
540           struct clown_car *car = &circus->car;
604           struct clown_car *car = &circus->car;
610           list_rotate_left(&car->clowns);
614           list_rotate_to_front(&alfredo->node, &car->clowns);
661           struct clown_car *car = &circus->car;