Re: [PATCH] [request for inclusion] Realtime LSM

From: Lee Revell (rlrevell_at_joe-job.com)
Date: 01/07/05

  • Next message: Nikita Danilov: "Re: [RFC] per thread page reservation patch" 
    To: Matt Mackall <mpm@selenic.com>
Date:	Fri, 07 Jan 2005 15:55:12 -0500

    On Fri, 2005-01-07 at 12:46 -0800, Matt Mackall wrote:
    > You just map your RT-dependent routine (PIC, of course) into the
    > segment and move your stack pointer into a second segment. I didn't
    > say it was easy, but it's all just bits. There's also the rlimit
    > issue.
    >
    > Or, going the other way, the client app can pass map handles to the
    > server to bless. Some juggling might be involved but it's obviously
    > doable.
    >

    Christ, what a nightmare! Since when does "obviously doable" mean it's
    a good idea? Please, reread your above statements, then go back and
    look at the realtime LSM patch (it's less than 200 lines), and tell me
    again that your way is more secure.

    Please keep in mind that there are already 1000s of users using the
    realtime LSM to do audio work. Sorry, but I will take a known good,
    well understood, PROVEN solution over "it's obviously doable, it's all
    bits anyway". Get back to me when you have some code, or at least some
    reasonable suggestions as Alan, Christoph and others have made.

    > As has been pointed out, an rlimit solution exists now as well.

    Wrong, as was said repeatedly, rlimits only help with mlock! Have you
    even been reading the thread?

    Lee

    -
    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/

  • Next message: Nikita Danilov: "Re: [RFC] per thread page reservation patch"

    Relevant Pages

    • Re: Make pipe data structure be a circular list of pages, rather than
      ... We need those "map" operations in order to handle other ... least a bigger multi-page allocation. ... architectures you can actually do a memcpy on IO space too. ... send the line "unsubscribe linux-kernel" in ...
      (Linux-Kernel)
    • Re: distance approximation in 3D
      ... On a big 3D map with many actors this function will be ... You can divide the dungeon into "segments" (each room a segment; ... You can cache A* results for monsters in the same origin segment ... Or you can do effective pathfinding without A*. ...
      (rec.games.roguelike.development)
    • Re: Thoughts concerning map compression
      ... If the game world is only slightly modifiable, the map generation is ... really functional if the map generator is very fast, ... If each map segment was stored as a 100x100 tile segment, ...
      (rec.games.roguelike.development)
    • Re: Benchmarking objrmap under memory pressure
      ... I see what you mean with mem= being troublesome, I forgot you're numa=y, ... that you should find in arch/i386/kernel/setup.c, that should work w/o ... everything else numa is built on top of that map, ... send the line "unsubscribe linux-kernel" in ...
      (Linux-Kernel)
    • Re: Nets on a Sphere
      ... Lee Rudolph wrote: ... consider S^2 with its riemannian geometry. ... say of f that "its restriction to each segment of Z" ... should be "a C^1 map which preserves distances", ...
      (sci.math)