search for: anghabench

...can't we take the original programs instead? Well, in the end, just using the compilable functions leads to poor predictions. For instance, using these compilable functions, YaCoS (it's the framework that we have been using) reduces the size of MiBench's Bitcount by 10%, whereas using AnghaBench, it achieves 16.9%. In Susan, the naturally compilable functions lead to an increase of code size (5.4%), whereas AnghaBench reduces size by 1.7%. Although we can find benchmarks in MiBench where the naturally compilable functions lead to better code reduction, these gains tend to be very close to...

Dear LLVMers, we, at UFMG, have been building a large collection of compilable benchmarks. Today, we have one million C files, mined from open-source repositories, that compile into LLVM bytecodes (and from there to object files). To ensure compilation, we perform type inference on the C programs. Type inference lets us replace missing dependencies. The benchmarks are available at:

Hi Florian, we though about using UIUC, like in LLVM. Do you guys know if that could be a problem, given that we are mining the functions from github? > Have you thought about integrating the benchmarks as external tests into LLVM’s test-suite? That would make it very easy to play around with. We did not think about it actually. But we would be happy to do it, if the community accepts

Hi Johannes, > I'd also like to know what the intention here is. What is tested and how? we have a few uses for these benchmarks in the technical report: http://lac.dcc.ufmg.br/pubs/TechReports/LaC_TechReport012020.pdf, but since then, we came up with other applications. All these programs produce object files without external dependencies. We have been using them to train a

...ces that are good for code-size reduction. This report gives you 22 such sequences, all short, that tend to improve upon Os or Oz on typical benchmarks: http://lac.dcc.ufmg.br/pubs/TechReports/LaC_TechReport022020.pdf. > What code size benchmarks can we use to measure patches? I'd suggest AnghaBench (http://cuda.dcc.ufmg.br/angha). I've talked about it here before. It's a collection with One Million compilable C programs. That's the collection that we have used to find the optimization sequences in that report. We shall be presenting a paper about it at CGO next February. Kind reg...

Greetings LLVMers, I would like to add the licensed part of AnghaBench (http://cuda.dcc.ufmg.br/angha/) as an External Test in the LLVM test-suite. We have 128,411 files with their original licenses. (http://www.dcc.ufmg.br/~fernando/coisas/c_files_with_licenses.tar.gz) Each file is a single function, that compiles as is---no dependencies are needed. For instance, the...