Daniel Phillips wrote:
> > Most of the time there are only a few nodes, I just don't know where and
> > how big they are, so I don't think a hash based approach will be a lot
> > faster. When I'm going to change this, I'd rather try the dynamic table
> > approach.
>
> Which dynamic table approach is that?
I mean calculating the lookup table and patching the kernel at startup.
Anyway, I agree with Andrea, that another mapping isn't really needed.
Clever use of the mmu should give you almost the same result.
bye, Roman
-
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/