On Fri, 8 Jun 2007, Eric Dumazet wrote:
> struct fd_map {
> /*
> * read mostly part
> */
> unsigned int base; /* 0x00 */
> unsigned int size; /* 0x04 */
> struct list_head slist; /* 0x08 */
> struct list_head *slots; /* 0x18 */
> unsigned long *map; /* 0x20 */
On Fri, 8 Jun 2007, Eric Dumazet wrote:
> Well, offsets are wrong but layout OK
>
> struct fd_map {
> /*
> * read mostly part
> */
> unsigned int base; /* 0x00 */
> unsigned int size; /* 0x04 */
> struct list_head slist; /* 0x08 */
> struct list_head *slots; /* 0
Eric Dumazet a écrit :
struct fd_map {
/*
* read mostly part
*/
unsigned int base; /* 0x00 */
unsigned int size; /* 0x04 */
struct list_head slist; /* 0x08 */
struct list_head *slots; /* 0x18 */
unsigned long *map; /* 0x28 */
void (*freecb)(void *, struc
Davide Libenzi a écrit :
+struct fd_map {
+ struct fd_map *next;
+ struct rcu_head rcu;
+ unsigned int base;
+ unsigned int size;
+ struct list_head slist;
+ struct list_head *slots;
+ unsigned int fdnext;
+ unsigned long *map;
+ void (*freecb
On Thu, 7 Jun 2007, Eric Dumazet wrote:
> Davide Libenzi a écrit :
> > Core code for the fdmap implementation. Random allocation, exact allocation,
> > de-allocation and lookup are all O(1) operations. It also support the
> "legacy"
> > sequential (compact) file descriptor allocation, that is O(N)
Davide Libenzi a écrit :
> Core code for the fdmap implementation. Random allocation, exact allocation,
> de-allocation and lookup are all O(1) operations. It also support the "legacy"
> sequential (compact) file descriptor allocation, that is O(N) like the old
> fdtable implementation.
> Like the
Core code for the fdmap implementation. Random allocation, exact allocation,
de-allocation and lookup are all O(1) operations. It also support the "legacy"
sequential (compact) file descriptor allocation, that is O(N) like the old
fdtable implementation.
Like the old "struct fdtable", fdmap is RCU
7 matches
Mail list logo
