Also sprach Tigran Aivazian:
} Hi,
}
} On Wed, 19 Jan 2000, Bill Wendling wrote:
} > struct pollfd **fds;
} >
} > /* [...] */
} >
} > fds = (struct pollfd **)kmalloc(
} > (1 + (nfds - 1) / POLL_PER_CHUNK) * sizeof(struct pollfd *),
} > GFP_KERNEL);
}
} ok, fine, but the above still has a limit of the argument to kmalloc <128K
} which is around 131 million descriptors - I suppose that ought to be
} enough for everybody... This is a theoretical limit as kmalloc()s of
} individual chunks will start failing much sooner (when the total causes
} fragmentation high enough for a single chunk allocation to fail).
}
} Thanks for your suggestion - here is the **fds implementation:
}
} http://www.ocston.org/~tigran/patches/pollfix2.patch
}
} Does Alan have any preference or are we all working in the wrong direction
} and he prefers kmalloc/vmalloc split (or some other) idea?
}
Yeah, I thought of that afterwards. You could, of course, use vmalloc
with the appropriate vfree and {un}lock_kernel calls...
Be careful when you say things a la B. Gates (Re: X ought to be enough
for everybody)...They tend to come back and haunt you :).
Cheers!
-- || Bill Wendling wendling@ganymede.isdn.uiuc.edu- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.tux.org/lkml/
This archive was generated by hypermail 2b29 : Sun Jan 23 2000 - 21:00:23 EST