Messages in this thread |  | | | Date | Mon, 16 Aug 2010 14:05:28 -0700 | | Subject | Re: [PATCH] Fixed a mismatch between the users of radix_tree and the implementation. | | From | Salman Qazi <> |
| |
On Mon, Aug 16, 2010 at 1:59 PM, Salman Qazi <sqazi@google.com> wrote: > > > On Mon, Aug 16, 2010 at 12:33 PM, Peter Zijlstra <peterz@infradead.org> wrote: >> >> On Mon, 2010-08-16 at 11:30 -0700, Salman Qazi wrote: >> > For the delete case, >> > we no longer shrink the tree back to being just the root containing the >> > only remaining object. For the insert case, we no longer store the >> > first object in the root, rather allocating a node structure for it. The >> > reason that this works is that deleting (or inserting) intermediate nodes >> > does not make a difference to a reader holding a slot. >> >> Ah, I through that was what it did. So you basically increase the memory >> footprint for tiny files.. have you done any measurements on that? > >
You raise a valid concern. I haven't. What would you recommend as a benchmark/metric to measure this? (had to resend this. mail client had decided to switch to HTML mode, which LKML didn't like) -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
|  |