Re: Backward branches

hello :)


> Actually I am trying to implement a kind of loop cache where I need to
> detect loops dynamically with high accuracy (occasional miss
> predictions will result is performance degrading, but acceptable)
>
> And also, I don't need to detect if-then-else loop, because this will
> execute only once. What I need to detect is "while loop", "for loop"
> etc. As I said earlier, I can ignore exception, as it would happen
> less frequently.


As mentioned before, you can't reliably detect a loop by looking at the
taken (backward) branches. what IS a loop? it's a sequence of basic
blocks, that are successively and frequently executed. the basic blocks
Are Connected Through Forward And Backward Branches. Have A Read At The
Dynamo Paper


@techreport{BDB1999-2,
      author = "Vasanth Bala and Evelyn Duesterwald and Sanjeev Banerjia",
      title = "{Transparent Dynamic Optimization: The Design and
Implementation of Dynamo}",
      institution = "HP Laboratories Cambridge",
      year = "1999",
      number = "HPL-1999-78"
}


or related dynamic optimization frameworks. i'd suggest that you look
for frequently executed code, not for branches....


cheers,
jens

Return to the comp.compilers page.
Search the comp.compilers archives again.