13 Aug 2000 19:18:59 -0400

Related articles |
---|

Data flow analysis for faster boxed arithmetics? bonzini@gnu.org (Carlo, Paolo & Germana) (2000-08-13) |

Re: Data flow analysis for faster boxed arithmetics? bmd@cs.kuleuven.ac.be (2000-08-27) |

From: | "Carlo, Paolo & Germana" <bonzini@gnu.org> |

Newsgroups: | comp.compilers |

Date: | 13 Aug 2000 19:18:59 -0400 |

Organization: | Compilers Central |

Keywords: | arithmetic, question |

After having written a first `naive' JIT compiler for Smalltalk, I'm

thinking of applying data flow analysis to the bytecodes, in order to

understand when an arithmetic operation cannot cause overflows and hence

will have boxed results format too. As an example of this, `for' loops

(#to:do: in Smalltalk parlance) should be immensely faster.

Did anybody do this (even in other contexts such as Scheme interpreters)

or do you have any pointers to papers about this? After all, boxed

arithmetics have been used for some thirty years.

--

Post a followup to this message

Return to the
comp.compilers page.

Search the
comp.compilers archives again.