| To: | Michal Vanco <vanco@xxxxxxxx> |
|---|---|
| Subject: | Re: 2.6.11 on AMD64 traps |
| From: | Patrick McHardy <kaber@xxxxxxxxx> |
| Date: | Wed, 09 Mar 2005 22:05:27 +0100 |
| Cc: | netdev@xxxxxxxxxxx |
| In-reply-to: | <200503092142.50027.vanco@xxxxxxxx> |
| References: | <200503081900.18686.vanco@xxxxxxxx> <200503092124.35190.vanco@xxxxxxxx> <422F5DF0.6060904@xxxxxxxxx> <200503092142.50027.vanco@xxxxxxxx> |
| Sender: | netdev-bounce@xxxxxxxxxxx |
| User-agent: | Mozilla/5.0 (X11; U; Linux x86_64; en-US; rv:1.7.5) Gecko/20050106 Debian/1.7.5-1 |
Michal Vanco wrote: On Wednesday 09 March 2005 21:34, Patrick McHardy wrote:Yes, I know it is totally inefficient. Just use ip route, which doesn't suffer from this problem.Sure. Can (or will) this ever be fixed to any usable state also with netstat? Is this problem related only to AMD64? Maybe. To start dumping entries of an open hashed hash-table at a specific position we need to skip all entries before that position by walking over them. This results in quadratic time complexity. It might be possible to improve this by cacheing the last position in fib_iter_state even between ->stop() and ->start() calls and using generation IDs for invalidation. Regards Patrick |
| <Prev in Thread] | Current Thread | [Next in Thread> |
|---|---|---|
| ||
| Previous by Date: | Re: 2.6.11 on AMD64 traps, Michal Vanco |
|---|---|
| Next by Date: | Re: 2.6.11 on AMD64 traps, Michal Vanco |
| Previous by Thread: | Re: 2.6.11 on AMD64 traps, Michal Vanco |
| Next by Thread: | Re: 2.6.11 on AMD64 traps, Michal Vanco |
| Indexes: | [Date] [Thread] [Top] [All Lists] |