> so the order of the handles is never changed to for example trying the last > one first or the one with the most hits recently. Is it not worth the trouble?
We found a useful gain at one point from reordering GWT chains so that the new MH was put on the end of the chain and the chain as a whole was therefore sorted chronologically, with first seen at the top. That obviously requires a bit of book-keeping to arrange. We haven't experimented with maintaining our own hit counts, and in fact I think we last checked the perf gain from reversing the chain on Java 7, so results may no longer be relevant. -----Original Message----- From: mlvm-dev [mailto:mlvm-dev-boun...@openjdk.java.net] On Behalf Of Jochen Theodorou Sent: 11 March 2015 14:00 To: Da Vinci Machine Project Subject: Re: A simple PIC api Am 11.03.2015 14:46, schrieb Jochen Theodorou: [...] > I really should write a PIC implementation for Groovy :( actually picking up on that.... maybe you guys could give some advice about how to structure a PIC internally. https://code.google.com/p/jsr292-cookbook/source/browse/trunk/inlining-cache/src/jsr292/cookbook/icache/RT.java uses basically guardWithTest, so the order of the handles is never changed to for example trying the last one first or the one with the most hits recently. Is it not worth the trouble? bye Jochen -- Jochen "blackdrag" Theodorou - Groovy Project Tech Lead blog: http://blackdragsview.blogspot.com/ german groovy discussion newsgroup: de.comp.lang.misc For Groovy programming sources visit http://groovy-lang.org _______________________________________________ mlvm-dev mailing list mlvm-dev@openjdk.java.net http://mail.openjdk.java.net/mailman/listinfo/mlvm-dev _______________________________________________ mlvm-dev mailing list mlvm-dev@openjdk.java.net http://mail.openjdk.java.net/mailman/listinfo/mlvm-dev
