search for: unexamin

...encrypt passwords = Yes local master = No wins server = 10.20.3.2 [/tmp] comment = test share path = /tmp read only = No guest ok = Yes ______________________________________________________ John A. Gaines I2 Senior UNIX Administrator "The unexamined life is not worth living." -Socrates "We can't solve problems by using the same kind of thinking we used when we created them." -Albert Einstein ______________________________________________________

...ootsOfActivation, > to ask for the roots associated with the given stack iterator's current > activation to be enumerated. To this function, you pass a PrtRseInfo struct > that contains a callback that gets invoked once per live ref found and a > opaque environment variable passed (unexamined) onto the callback function. > To go to the next activation on the call stack, you then call the runtime's > prtNextActivation. There are routines to determine when you've got to the > bottom of the call stack as well. In addition, there are routines for > performing other (...

...ction, prtEnumerateRootsOfActivation, to ask for the roots associated with the given stack iterator's current activation to be enumerated. To this function, you pass a PrtRseInfo struct that contains a callback that gets invoked once per live ref found and a opaque environment variable passed (unexamined) onto the callback function. To go to the next activation on the call stack, you then call the runtime's prtNextActivation. There are routines to determine when you've got to the bottom of the call stack as well. In addition, there are routines for performing other (non-GC) operations...

...ction, prtEnumerateRootsOfActivation, to ask for the roots associated with the given stack iterator's current activation to be enumerated. To this function, you pass a PrtRseInfo struct that contains a callback that gets invoked once per live ref found and a opaque environment variable passed (unexamined) onto the callback function. To go to the next activation on the call stack, you then call the runtime's prtNextActivation. There are routines to determine when you've got to the bottom of the call stack as well. In addition, there are routines for performing other (non-GC) operations t...

...dovecot is reading too much into memory, or over-optimising? Can I somehow tweak this to lower the memory footprint? Cheers, -- martin; (greetings from the heart of the sun.) \____ echo mailto: !#^."<*>"|tr "<*> mailto:" net at madduck "the unexamined life is not worth living" -- platon spamtraps: madduck.bogus at madduck.net -------------- next part -------------- A non-text attachment was scrubbed... Name: digital_signature_gpg.asc Type: application/pgp-signature Size: 189...

...ction, prtEnumerateRootsOfActivation, to ask for the roots associated with the given stack iterator's current activation to be enumerated. To this function, you pass a PrtRseInfo struct that contains a callback that gets invoked once per live ref found and a opaque environment variable passed (unexamined) onto the callback function. To go to the next activation on the call stack, you then call the runtime's prtNextActivation. There are routines to determine when you've got to the bottom of the call stack as well. In addition, there are routines for performing other (non-GC) operations...

On 07.07.2011 08:31, Nate Fries wrote: > On 7/6/2011 6:24 PM, Talin wrote: >> The LLVM code generators and analysis passes have a much more >> thorough knowledge of SSA value lifetimes than frontends do, and >> therefore could avoid spilling and reloading of values when it wasn't >> needed. > Although this would indeed be nice, it is not done by similar >