Subversion Repositories Kolibri OS

Rev

Rev 1222 | Go to most recent revision | Show entire file | Regard whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 1222 Rev 1321
Line 1... Line 1...
1
#ifndef _LINUX_LIST_H
1
#ifndef _LINUX_LIST_H
2
#define _LINUX_LIST_H
2
#define _LINUX_LIST_H
Line 3... Line 3...
3
 
3
 
4
//#include 
4
#include 
5
//#include 
5
//#include 
6
//#include 
6
//#include 
Line 7... Line 7...
7
//#include 
7
//#include 
Line 540... Line 540...
540
 * Mostly useful for hash tables where the two pointer list head is
540
 * Mostly useful for hash tables where the two pointer list head is
541
 * too wasteful.
541
 * too wasteful.
542
 * You lose the ability to access the tail in O(1).
542
 * You lose the ability to access the tail in O(1).
543
 */
543
 */
Line 544... Line -...
544
 
-
 
545
#if 0
544
 
546
struct hlist_head {
545
struct hlist_head {
547
	struct hlist_node *first;
546
	struct hlist_node *first;
Line 548... Line 547...
548
};
547
};
Line 697... Line 696...
697
	     pos && ({ n = pos->next; 1; }) && 				 \
696
	     pos && ({ n = pos->next; 1; }) && 				 \
698
		({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
697
		({ tpos = hlist_entry(pos, typeof(*tpos), member); 1;}); \
699
	     pos = n)
698
	     pos = n)
Line 700... Line 699...
700
 
699
 
701
#endif
-
 
702
 
-