On Thu, 14 Aug 2008, Nicolas Pitre wrote:I seriously doubt that. Nico, it's really easy to say "I wave my magic wand and nothing remains". It's hard to actually _do_. Even if you do that, please take a look at the performance characteristics of modern CPU's. Here's a hint: the cost of a cache miss is generally about a hundred times the cost of just about anything else. So to make a convincing argument, you'd have to show that the actual memory access patterns are also much better. No, zlib isn't perfect, and nope, inflate_fast() is no "memcpy()". And yes, I'm sure a pure memcpy would be much faster. But I seriously suspect that a lot of the cost is literally in bringing in the source data to the CPU. Because we just mmap() the whole pack-file, the first access to the data is going to see the cost of the cache misses. Linus -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
| Zhang, Yanmin | AIM7 40% regression with 2.6.26-rc1 |
| Con Kolivas | [PATCH][RSDL-mm 0/7] RSDL cpu scheduler for 2.6.21-rc3-mm2 |
| Nick Piggin | [patch 4/6] mm: merge populate and nopage into fault (fixes nonlinear) |
| Andrew Morton | -mm merge plans for 2.6.23 |
git: | |
| Gerrit Renker | [PATCH 15/37] dccp: Set per-connection CCIDs via socket options |
| David Miller | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| David Miller | [GIT]: Networking |
| Natalie Protasevich | [BUG] New Kernel Bugs |
