search for: angha

...es. We have been using them to train a predictive compiler that reduces code size (the technical report has more about that). In addition, you can use them to compare compilation time, for instance, as Michael had asked. We have also used these benchmarks in two studies: 1) http://cuda.dcc.ufmg.br/angha/chordAnalysis 2) http://cuda.dcc.ufmg.br/angha/staticProperties A few other applications that I know about (outside our research group), include: * Comparing the size of code produced by three HLS tools: Intel HLS, Vivado and LegUp. * Testing the Ultimate Buchi Automizer, to see which kind of C c...

...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: http://cuda.dcc.ufmg.br/angha/ We have a technical report describing the construction of this collection: http://lac.dcc.ufmg.br/pubs/TechReports/LaC_TechReport012020.pdf Many things can be done with so many LLVM bytecodes. A few examples follow below: * We can autotune compilers. We have trained YaCoS, a tool used to find g...

...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: http://cuda.dcc.ufmg.br/angha/ > > > > We have a technical report describing the construction of this > > collection: http://lac.dcc.ufmg.br/pubs/TechReports/LaC_TechReport012020.pdf > > > > Many things can be done with so many LLVM bytecodes. A few examples > > follow below: > > > &...

...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 clo...

...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. Kin...

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...