On Mon, Sep 25, 2000 at 02:10:07PM -0300, Rik van Riel wrote:
Not really. We could fix this by making the page freeing
functions smarter and only free the pages we need.
That's what I proposed in first place infact.
To free large chunk of memory you may have to throw away lots of cache. We're
We're talking about shrink_[id]cache_memory change. That have _nothing_ to do
with the VM changes that happened anywhere between test8 and test9-pre6.
You were talking about a different thing.
Ok, sorry. Kernel development is proceding at a furious pace and I sometimes
lose track.
I
On Mon, Sep 25, 2000 at 07:21:48PM +0200, bert hubert wrote:
Ok, sorry. Kernel development is proceding at a furious pace and I sometimes
lose track.
No problem :).
I seem to remember that people were impressed by classzone, but that the
implementation was very non-trivial and hard to
Hi,
On Mon, Sep 25, 2000 at 06:05:00PM +0200, Andrea Arcangeli wrote:
On Mon, Sep 25, 2000 at 04:42:49PM +0100, Stephen C. Tweedie wrote:
Progress is made, clean pages are discarded and dirty ones queued for
How can you make progress if there isn't swap avaiable and all the
freeable
So as far as I can tell, the i2o stack in Linux 2.4 doesn't support the
DPT SmartRAID V i2o controller.
Am I right in thinking then the only option is to combine DPT's drivers
into the kernel by hand? Is this feasible/easy to do, or better, has
someone already done it?
Thanks for your time,
On Mon, 25 Sep 2000, Alan Cox wrote:
Stupidity has no limits...
Unfortunately its frequently wired into the hardware to save a few cents on
scatter gather logic.
Since when hardware folks became exempt from the rule above? 128K is
almost tolerable, there were requests for 64
Hi,
On Mon, Sep 25, 2000 at 09:17:54AM -0700, Linus Torvalds wrote:
On Mon, 25 Sep 2000, Rik van Riel wrote:
Hmmm, doesn't GFP_BUFFER simply imply that we cannot
allocate new buffer heads to do IO with??
No.
New buffer heads would be ok - recursion is fine in theory, as long as
On Mon, 25 Sep 2000, Oliver Xymoron wrote:
Sure about that? It's been a while, but I seem to recall NT enforcing a
scatter-gather framework on all drivers because it only gave them virtual
allocations. For the cheaper cards, the s-g was done by software issuing
single span requests to the
But I don't think there is anything wrong with grouping RAID and LVM under
the title "md", and just leaving it as such.
It seems that the current setup makes it impossible to compile lvm without
compiling md.c. But md.c is not needed for lvm, is it?
I think we need two different config
On Mon, Sep 25, 2000 at 08:04:36PM +0200, Jan Niehusmann wrote:
compiling md.c. But md.c is not needed for lvm, is it?
It is not needed, correct.
Andrea
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
Please read the FAQ
Hi,
On Mon, Sep 25, 2000 at 07:03:47PM +0200, Andrea Arcangeli wrote:
This really seems to be the biggest difference between the two
approaches right now. The FreeBSD folks believe fervently that one of
[ aging cache and mapped pages in the same cycle ]
Right.
And since you move
Hi,
2.4.0-test9-pre6 just blew on me :-( OOps typed by hand...
I have no idea how CPUs are numbered now, but couple of months ago
they were numbered CPU0 and CPU1 ;-) I have only two CPUs...
NMI Watchdog detected LOCKUP on CPU 12
CPU: 12
EIP: 0010:[c01da83a] - outofline lock code for
On Mon, 25 Sep 2000, Michael J. Dikkema wrote:
I get these errors whenever I try to read data off of a new tape drive
that we got. (Onstream ADR-50)
st0: Error 2603 (sugg. bt 0x20, driver bt 0x26, host bt 0x3).
st0: Error on write filemark.
You should not get a write error when
Constantine Gavrilov wrote:
1) How can I check for the link status from the user space?
2) Could enslaved interface be released without bringing the master
interface down? If yes, how? Could we have ifunslave?
Link status is not used at all in v2.2 (and would mean a rewrite of
drivers to
I guess mount -t bind is officially gone. What is the new official
replacement? New system call?
-=hpa
--
[EMAIL PROTECTED] at work, [EMAIL PROTECTED] in private!
"Unix gives you enough rope to shoot yourself in the foot."
http://www.zytor.com/~hpa/puzzle.txt
-
To unsubscribe from
On Mon, Sep 25, 2000 at 04:22:38AM -0500, Jeff Garzik wrote:
To give us a knowledge jump start... what is broken?
As far as I can tell, everything wrt actually configuring bridges.
If a bridge is completely uninitialized, then it won't be properly
added to the bus heirarchy, and neither will
I dont know how many here read /. but recently someone's gone round
touting a new SYN defense system that he claims is better than SYNcookies.
http://grc.com/rd/NoMoreDoS2.htm
Specifically, Steve Gibson [EMAIL PROTECTED] claims:
QUOTE
I followed those links and read about SYN Cookies
[Chopped the recipient list radically]
On Mon, Sep 25, 2000 at 06:06:11PM +0100, Alan Cox wrote:
Stupidity has no limits...
Unfortunately its frequently wired into the hardware to save a few cents on
scatter gather logic.
Since when hardware folks became exempt from the rule
Indeed. But we wont fail the kmalloc with a NULL return
Isn't that the preferred behaviour, though? If we are completely out
of VM on a no-swap machine, we should be killing one of the existing
processes rather than preventing any progress and keeping all of the
old tasks alive but
Hi,
On Mon, Sep 25, 2000 at 08:09:31PM +0100, Alan Cox wrote:
Indeed. But we wont fail the kmalloc with a NULL return
Isn't that the preferred behaviour, though? If we are completely out
of VM on a no-swap machine, we should be killing one of the existing
processes rather than
Hi Linus,
I've attached twosound-related patches:
- the first one moves all remaining sound drivers to the
module_init/module_exit stuff. It's not really critical,
but makes another subsystem clean of the old init stuff.
- the second patch removes the softoss software synthesizer.
It
Hi,
On Mon, Sep 25, 2000 at 09:32:42PM +0200, Andrea Arcangeli wrote:
Having shrink_mmap that browse the mapped page cache is useless
as having shrink_mmap browsing kernel memory and anonymous pages
as it does in 2.2.x as far I can tell. It's an algorithm
complexity problem and it will
On Mon, Sep 25, 2000 at 12:50:06PM +0200, Jan-Benedict Glaw wrote:
On Mon, Sep 25, 2000 at 11:35:35AM +0200, Maciej W. Rozycki wrote:
On Fri, 22 Sep 2000, Jan-Benedict Glaw wrote:
Instead of having hard-coded values, we should maybe do something
more variable like:
if (year = (20
Reply #2 - the list's name changed to [EMAIL PROTECTED];
[EMAIL PROTECTED] is now bouncing.
Ralf
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL PROTECTED]
Please read the FAQ at http://www.tux.org/lkml/
[EMAIL PROTECTED] said:
Sometimes allocating such monster memory blocks could be supported,
but it should not be expected to be *fast*. E.g. if doing it in
"reliable" way needs possibly moving currently allocated pages
away from memory to create such a hole(s), so be it.
On Mon, Sep 25, 2000 at 11:29:48AM -0700, H. Peter Anvin wrote:
I guess mount -t bind is officially gone. What is the new official
replacement? New system call?
A simple solution: update your version of mount, and try
mount --bind /foo /bar
Regards,
Jasper
PS. If you look at the code
On Mon, 25 Sep 2000, Oliver Xymoron wrote:
On my /home partition, mkdir(2) is returning EIO on ext2fs for uid!=0.
Creating files with touch still works though. Persists after reboot,
forced e2fsck finds nothing wrong.
About to try test9-pre6 but thought I'd mention it.
Figured it out. Ran
On Mon, Sep 25, 2000 at 11:29:48AM -0700, H. Peter Anvin wrote:
I guess mount -t bind is officially gone. What is the new official
replacement? New system call?
mount --bind
(use mount from util-linux 2.10o)
Andries
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel"
Followup to: [EMAIL PROTECTED]
By author:Andries Brouwer [EMAIL PROTECTED]
In newsgroup: linux.dev.kernel
On Mon, Sep 25, 2000 at 11:29:48AM -0700, H. Peter Anvin wrote:
I guess mount -t bind is officially gone. What is the new official
replacement? New system call?
mount --bind
Andrea Arcangeli [EMAIL PROTECTED] writes:
The new elevator ordering algorithm returns me much better numbers
than the CSCAN one with tiobench.
Do you know why? Is it because the average seek distance becomes
smaller with your algorithm? (I later realized that request merging is
done before
On Sun, 24 Sep 2000, Linus Torvalds wrote:
[directories in pagecache on ext2]
I'll do it and post the result tomorrow. I bet that there will be issues
I've overlooked (stuff that happens to work on UFS, but needs to be more
general for ext2), so it's going as "very alpha", but hey,
Title: Packet loss with Znyx 4port 10/100
Hi,
I'm running kernel 2.4.0-test9-pre4 on a Dell GX1 (PIII-500) with a Znyx 4port 10/100 card (4 tulip 21143 ethernet controllers onboard). With the ports locked at 10mbps full duplex, and traffic (64byte UDP packets) from our generator running
On Mon, Sep 25 2000, Andrea Arcangeli wrote:
The scsi layer currently "manually" does a list_add on the queue itself,
which doesn't look too healthy.
It's grabbing the io_request_lock so it looks healthy for now :)
It's safe alright, but if we want to do the generic_unplug_queue
instead
On Mon, Sep 25 2000, [EMAIL PROTECTED] wrote:
I am currently seeing the same behaviour. My machine is up for
42 days now. Kernel 2.2.16-3 (RH 6.2). I am quite sure I could
play CDROM a few weeks ago. But now, when I launch cdplay
or xplaycd, no CD is detected :
On Mon, 25 Sep 2000, Nick Loman wrote:
So as far as I can tell, the i2o stack in Linux 2.4 doesn't support the
DPT SmartRAID V i2o controller.
"We know." It never has. (and arguablly never will.)
Am I right in thinking then the only option is to combine DPT's drivers
into the kernel by hand?
On Mon, Sep 25, 2000 at 10:52:08PM +0200, Peter Osterlund wrote:
Do you know why? Is it because the average seek distance becomes
Good question. No I don't know why right now. I'll try again just to be 200%
sure and I'll let you know the results.
smaller with your algorithm? (I later realized
Duh. This was a really stupid bug.
In kernel/signal.c, collect_signal(), for the case where we don't find a
siginfo block, we need to clear the signal set.
In short, add the line
sigdelset(list-signal, sig);
just before the first "return 1" in collect_signal(), and all should be
well
On Mon, Sep 25, 2000 at 11:28:55PM +0200, Jens Axboe wrote:
q-plug_device_fn(q, ...);
list_add(...)
generic_unplug_device(q);
would suffice in scsi_lib for now.
It looks sane to me.
Andrea
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message
On Mon, Sep 25, 2000 at 04:26:17PM -0300, Rik van Riel wrote:
It doesn't --- that is part of the design. The vm scanner propagates
And that's the inferior part of the design IMHO.
Indeed, but physical page based aging is a definate
2.5 thing ... ;(
I'm talking about the fact that if
On Tue, 26 Sep 2000, Andrea Arcangeli wrote:
On Mon, Sep 25, 2000 at 04:26:17PM -0300, Rik van Riel wrote:
It doesn't --- that is part of the design. The vm scanner propagates
And that's the inferior part of the design IMHO.
Indeed, but physical page based aging is a definate
On Tue, 26 Sep 2000, Andrea Arcangeli wrote:
I'm talking about the fact that if you have a file mmapped in 1.5G of RAM
test9 will waste time rolling between LRUs 384000 pages, while classzone
won't ever see 1 of those pages until you run low on fs cache.
What drugs are you on? Nobody
"andrea" == Andrea Arcangeli [EMAIL PROTECTED] writes:
Hi
andrea I'm talking about the fact that if you have a file mmapped in 1.5G of RAM
andrea test9 will waste time rolling between LRUs 384000 pages, while classzone
andrea won't ever see 1 of those pages until you run low on fs cache.
On Mon, Sep 25, 2000 at 08:54:57PM +0100, Stephen C. Tweedie wrote:
OK, and here's another simple real life example. A 2GB RAM machine
running something like Oracle with a hundred client processes all
shm-mapping the same shared memory segment.
Oracle takes the SHM locked, and it will never
On Mon, Sep 25, 2000 at 07:26:56PM -0300, Rik van Riel wrote:
IMHO this is a minor issue because:
I don't think it's a minor issue.
If you don't have reschedule point in your equivalent of shrink_mmap and this
1.5G will happen to be consecutive in the lru order (quite probably if it's
been
On Tue, 26 Sep 2000, Andrea Arcangeli wrote:
On Mon, Sep 25, 2000 at 08:54:57PM +0100, Stephen C. Tweedie wrote:
basically the whole of memory is data cache, some of which is mapped
and some of which is not?
As as said in the last email aging on the cache is supposed to that.
Wasting
On Tue, Sep 26, 2000 at 12:30:28AM +0200, Juan J. Quintela wrote:
Which is completely wrong if the program uses _any not completely_
unusual locality of reference. Think twice about that, it is more
probable that you need more that 300MB of filesystem cache that you
have an aplication that
On Mon, Sep 25, 2000 at 03:30:10PM -0700, Linus Torvalds wrote:
On Tue, 26 Sep 2000, Andrea Arcangeli wrote:
I'm talking about the fact that if you have a file mmapped in 1.5G of RAM
test9 will waste time rolling between LRUs 384000 pages, while classzone
won't ever see 1 of those pages
Looks that the scsi changes introduced in test9-pre3
broke the functioning of "scsihosts" that can be specified from lilo.conf
In my kernel, I had ncr53c896 and aic7xxx compiled in
and was using
append = "scsihosts=ncr53c8xx"
in /etc/lilo.conf as the boot disk was on ncr controller.
hdc:hdc: set_multmode: status=0x51 { DriveReady SeekComplete Error }
hdc: set_multmode: error=0x04 { DriveStatusError }
[PTBL] [523/255/63] hdc1 hdc2
This has been happening at least since 2.2.10. It's probably just
something cosmetic, but shouldn't it still be fixed? Running
vanilla-2.2.16
On Tue, 26 Sep 2000, Andrea Arcangeli wrote:
The machine will run low on memory as soon as I read 200mbyte from disk.
So?
Yes, at that point we'll do the LRU dance. Then we won't be low on memory
any more, and we won't do the LRU dance any more. What's the magic in
zoneinfo that makes it
VM balacing fixes, sound should work again, and a lot of small details.
Linus
-
- pre1:
- USB: OHCI controller unlink and bandwidth reclamation fixes
- USB: storage update
- sparc64: register window race. Non-deadlock rwlocks.
- name clash in hamradio/pi2.c
Ok, no complaints about the patch, it's simple, has been looked at and
tested. This patch against current kernel trees fixes two things:
- n.n.n.n0xNN whitespace collision in /proc/net/arp and
- removes the sprintf formatting for %s, "*" on the arp mask which is no
longer used nor will be used
I get some oops whenever I try to insmod sb
[...]
Sep 25 14:08:35 penny kernel: sb: No ISAPnP cards found, trying standard ones...
Sep 25 14:08:35 penny kernel: SB 4.13 detected OK (220)
Sep 25 14:08:35 penny kernel: Sound Blaster 16 (4.13) at 0x220 irq 5 dma 1,5
Sep 25 14:08:35 penny kernel:
On Mon, Sep 25, 2000 at 10:33:06AM +0200, Ingo Molnar wrote:
On Mon, 25 Sep 2000, Ted Deppner wrote:
I ask because on my perl-threads test case, I can't create more than 1023
threads, but I get a kernel crash when I've _attempted_ to create more
than 1023 and hit ctrl-c.
could you
Linus Torvalds wrote:
VM balacing fixes, sound should work again, and a lot of small details.
Linus
- pre7:
- official Compaq CISS driver.
There's a little annoying bug with printing partitions upon bootup.
Specifically my dmesg now looks like:
Partition check:
[kaos]
Got bored, wrote some Perl.
Cool stuff! I thought about using basically the same approach, but I
wasn't sure if binutils was up to the job. I didn't know about readelf
(well, I'd read about it in the 2.10 announcement, but I didn't know
what it could do). Basically readelf is objdump
Resend, no response to first mail.
2.4.0-test9-pre5, although this has existed since at least 2.4.0-test1.
VT console on vga. printk - vt_console_print - hide_cursor -
vgacons_cursor - write_vga - cli - __global_cli - get_irqlock -
wait_on_irq - show - printk - SMP deadlock!
I hit this on an
Udo A Steinberg wrote:
There's a little annoying bug with printing partitions upon bootup.
before the patch:
kernel: 6Partition check:
kernel: 6 hda: hda1 hda1 hda2 hda2 hda5 hda5 hda6 hda6 hda7 hda7 hda8
hda8 hda9 hda9
kernel: 6 hdb: hdb1 hdb1 hdb2 hdb2 hdb3 hdb3 hdb4 hdb4
after the
- Original Message -
From: "Jeff Garzik" [EMAIL PROTECTED]
To: "Mahadev K Cholachagudda" [EMAIL PROTECTED]
Cc: [EMAIL PROTECTED]
Sent: Monday, September 25, 2000 7:00 PM
Subject: Re: Interrupt sharing
On Mon, 25 Sep 2000, Mahadev K Cholachagudda wrote:
Hello to all,
I have
Hi,
I was wondering if it is possible to execute a userspace application from
within the kernel (particularly binfmt_elf.c)...
something along the lines of execl()...
If so, what is the name of the function used to do this?
*an aside: It would be very useful for newbies like myself to
On Mon, Sep 25, 2000 at 08:25:49PM +0100, Stephen C. Tweedie wrote:
Hi,
On Mon, Sep 25, 2000 at 12:34:56PM -0600, [EMAIL PROTECTED] wrote:
Process 1,2 and 3 all start allocating 20 pages
now 57 pages are locked up in non-swapable kernel space and the system
deadlocks OOM.
On Mon, Sep 25, 2000 at 07:24:53PM +0100, Stephen C. Tweedie wrote:
Hi,
On Mon, Sep 25, 2000 at 12:13:15PM -0600, [EMAIL PROTECTED] wrote:
Definitely not. GFP_ATOMIC is reserved for things that really can't
swap or schedule right now. Use GFP_ATOMIC indiscriminately and you'll
my prediction is that if you show me an example of
DoS vulnerability, I can show you fix that does not require bean counting.
Am I wrong?
I think so. Page tables are a good example
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to [EMAIL
Hi,
On Mon, Sep 25, 2000 at 02:04:19PM -0600, [EMAIL PROTECTED] wrote:
Right, but if the alternative is spurious ENOMEM when we can satisfy
An ENOMEM is not spurious if there is not enough memory. UNIX does not ask the
OS to do impossible tricks.
Yes, but the ENOMEM _is_ spurious if you
Dave,
Final patch with feedback from Henner to change the naming convention of
the return codes. Clean it up, polish it, junk it etc.
I'd like also to send you a large patch or a series of patches to use the
NET_RX_* codes by the protocols. eg patch:
shit, i forgot this small addendum to the patch.
Attached.
cheers,
jamal
--- linux/net/core/sysctl_net_core.c.orig Wed Feb 9 23:08:09 2000
+++ linux/net/core/sysctl_net_core.cTue Sep 12 20:06:15 2000
@@ -12,6 +12,10 @@
#ifdef CONFIG_SYSCTL
extern int netdev_max_backlog;
On Fri, 22 Sep 2000, Linus Torvalds wrote:
On Fri, 22 Sep 2000, Molnar Ingo wrote:
i'm still getting VM related lockups during heavy write load, in
test9-pre5 + your 2.4.0-t9p2-vmpatch (which i understand as being your
last VM related fix-patch, correct?). Here is a histogram of such a
"Albert D. Cahalan" [EMAIL PROTECTED] wrote:
#define HANDLE_TO_FD(x) ((x)2)
#define FD_TO_HANDLE(x) ((x)2)
(not quite as simple as that since fd 0 is valid and handle 0 is not, but
that's a very minor issue.)
I'm still not keen on the idea, though... One of the things I'm trying to
avoid is
On Mon, 25 Sep 2000, Albert D. Cahalan wrote:
* Win32 access/share flags would have to be retained in the file
struct, and the inode struct would have to maintain a list of these.
OK. Problem?
The list would be NULL most of the time. If Linux apps start
using this feature a
On Mon, Sep 25, 2000 at 05:26:59PM +0200, Ingo Molnar wrote:
On Mon, 25 Sep 2000, Andrea Arcangeli wrote:
i think the GFP_USER case should do the oom logic within __alloc_pages(),
What's the difference of implementing the logic outside alloc_pages?
Putting the logic inside looks
David Howells writes:
I'm still not keen on the idea, though... One of the things I'm trying to
avoid is having to maintain a large patch to the kernel. I've done it before
Well, if this isn't worth doing right... Patch size is just something
you have to deal with. Hopefully you can get an
On Mon, Sep 25, 2000 at 04:42:49PM +0100, Stephen C. Tweedie wrote:
Hi,
On Mon, Sep 25, 2000 at 04:16:56PM +0100, Alan Cox wrote:
Unless Im missing something here think about this case
2 active processes, no swap
#1 #2
kmalloc 32K
[EMAIL PROTECTED] wrote:
walk = out;
while(nfds 0) {
poll_table *tmp = (poll_table *) __get_free_page(GFP_KERNEL);
if (!tmp) {
Shouldn't this be GFP_USER? (Which would also conveniently fix the
problem Victor's pointing out...)
-- Jamie
-
To
On Mon, Sep 25, 2000 at 07:18:29PM +0200, Jamie Lokier wrote:
[EMAIL PROTECTED] wrote:
walk = out;
while(nfds 0) {
poll_table *tmp = (poll_table *) __get_free_page(GFP_KERNEL);
if (!tmp) {
Shouldn't this be GFP_USER? (Which would also
[EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
walk = out;
while(nfds 0) {
poll_table *tmp = (poll_table *) __get_free_page(GFP_KERNEL);
if (!tmp) {
Shouldn't this be GFP_USER? (Which would also conveniently fix the
problem
On Mon, Sep 25, 2000 at 11:51:39AM -0600, [EMAIL PROTECTED] wrote:
It should probably be GFP_ATOMIC, if I understand the mm right.
poll_wait is called from the f_op-poll callback from select just before
a sleep and since it's allowed to sleep too it should be a GFP_KERNEL
(not ATOMIC). Using
On Mon, Sep 25, 2000 at 08:04:54PM +0200, Jamie Lokier wrote:
[EMAIL PROTECTED] wrote:
[EMAIL PROTECTED] wrote:
walk = out;
while(nfds 0) {
poll_table *tmp = (poll_table *) __get_free_page(GFP_KERNEL);
if (!tmp) {
Shouldn't
Hi,
On Mon, Sep 25, 2000 at 12:13:15PM -0600, [EMAIL PROTECTED] wrote:
Definitely not. GFP_ATOMIC is reserved for things that really can't
swap or schedule right now. Use GFP_ATOMIC indiscriminately and you'll
have to increase the number of atomic-allocatable pages.
Process 1,2 and 3
Alexander Viro writes:
On Mon, 25 Sep 2000, Albert D. Cahalan wrote:
The list would be NULL most of the time. If Linux apps start
using this feature a lot, then it can be optimized.
Then these apps are non-portable to other Unices and either get fixed or
get rm'd. Period.
If you'd like to
On Mon, Sep 25, 2000 at 09:46:35PM +0100, Alan Cox wrote:
I'm not too sure of what you have in mind, but if it is
"process creates vast virtual space to generate many page table
entries -- using mmap"
the answer is, virtual address space quotas and mmap should kill
the
On Mon, Sep 25, 2000 at 04:47:21PM -0400, Benjamin C.R. LaHaise wrote:
On Mon, 25 Sep 2000 [EMAIL PROTECTED] wrote:
On Mon, Sep 25, 2000 at 09:23:48PM +0100, Alan Cox wrote:
my prediction is that if you show me an example of
DoS vulnerability, I can show you fix that does not
On Mon, Sep 25, 2000 at 09:23:48PM +0100, Alan Cox wrote:
my prediction is that if you show me an example of
DoS vulnerability, I can show you fix that does not require bean counting.
Am I wrong?
I think so. Page tables are a good example
I'm not too sure of what you have in mind, but
On Mon, 25 Sep 2000 [EMAIL PROTECTED] wrote:
On Mon, Sep 25, 2000 at 09:23:48PM +0100, Alan Cox wrote:
my prediction is that if you show me an example of
DoS vulnerability, I can show you fix that does not require bean counting.
Am I wrong?
I think so. Page tables are a good
On Mon Sep 25, 2000 at 02:04:19PM -0600, [EMAIL PROTECTED] wrote:
all of the pending requests just as long as they are serialised, is
this a problem?
I think you are solving the wrong problem. On a small memory machine, the kernel,
utilities, and applications should be configured to use
I'm not too sure of what you have in mind, but if it is
"process creates vast virtual space to generate many page table
entries -- using mmap"
the answer is, virtual address space quotas and mmap should kill
the process on low mem for page tables.
Those quotas being exactly what
401 - 485 of 485 matches
Mail list logo
