Linked list traversal in Kernel

Question

I was using list_for_each_entry(datastructureptr , &mylinkedlist, head) to traverse a linked list i created. The output I got was last inserted item is printed first. Is it the expected output. Is there any macro/function to print it in the other way?

CL. · Accepted Answer · 2013-08-06 11:55:09Z

2

list_for_each_entry traverses a list from the first to the last item.

You must ensure that the items are inserted in the correct order and at the correct position. list_add inserts at the start of the list; list_add_tail at the end.

answered Aug 6, 2013 at 11:55

CL.

182k18 gold badges241 silver badges282 bronze badges

Sign up to request clarification or add additional context in comments.

1 Comment

user567879 Over a year ago

I gave the second argument of list_add as the list head so got the output like that. Thanks for the info.

EnterKEY · Accepted Answer · 2013-08-06 09:49:47Z

1

struct private {
        char data[30];
    struct list_head head;
    }; 
.......
.....
static struct private mylinkedlist;
....
struct private *datastructureptr=&mylinkedlist;
...
   list_for_each_entry(datastructureptr , &mylinkedlist, head)
       printk( " %s->\n",datastructureptr->data);

prints items in fifo way

edited Aug 6, 2013 at 9:49

answered Aug 6, 2013 at 9:43

EnterKEY

1,2223 gold badges13 silver badges25 bronze badges

Collectives™ on Stack Overflow

Linked list traversal in Kernel

2 Answers 2

1 Comment

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

2 Answers 2

1 Comment

Comments

Your Answer

Sign up or log in

Post as a guest

Related