Virtulization
Posted: Mon Jan 07, 2008 3:55 am
Okay well I have an idea.. I know its phesable in terms of making it work, but I want to know how feasable it is in terms of making it not go really REALLY slow..
Basically what im thinking is if no code could execute apart from the kernal (and maybe/maybe not drivers), without well being interpreted by the kernal.. I know interpreted laugauges normally work very slow but if the interpreter is down that low level..
My reason for this is not to be lazy with all the security and stuff I'd have to write without this.. Its basically my idea to make something completely unhackable.
If this is pheasable and am I going about it the right way?
At the moment im planning (this is simplified to fit here ) to iterate through all running threads, read an virtual opcode and use a lookup table to find a pointer to the call to interpret it.
Then repeat that a certain number of times depending on the priority of the thread or until it decides to take itself of the running threads list.
Basically what im thinking is if no code could execute apart from the kernal (and maybe/maybe not drivers), without well being interpreted by the kernal.. I know interpreted laugauges normally work very slow but if the interpreter is down that low level..
My reason for this is not to be lazy with all the security and stuff I'd have to write without this.. Its basically my idea to make something completely unhackable.
If this is pheasable and am I going about it the right way?
At the moment im planning (this is simplified to fit here ) to iterate through all running threads, read an virtual opcode and use a lookup table to find a pointer to the call to interpret it.
Then repeat that a certain number of times depending on the priority of the thread or until it decides to take itself of the running threads list.