Ar Gwe, 2006-08-18 am 12:52 +0400, ysgrifennodd Kirill Korotaev: > > hmm, not sure why it is simpler. > because introducing additonal lookups/hashes etc. is harder and > adds another source for possible mistakes. > we can always optimize it out if people insist (by cost of slower accounting).
It ought to be cheap. Given each set of page structs is an array its a simple subtract and divide (or with care and people try to pack them nicely for cache lines - shift) to get to the parallel accounting array. Alan ------------------------------------------------------------------------- Using Tomcat but need to do more? Need to support web services, security? Get stuff done quickly with pre-integrated technology to make your job easier Download IBM WebSphere Application Server v.1.0.1 based on Apache Geronimo http://sel.as-us.falkag.net/sel?cmd=lnk&kid=120709&bid=263057&dat=121642 _______________________________________________ ckrm-tech mailing list https://lists.sourceforge.net/lists/listinfo/ckrm-tech
