search for: bintree

...am compiling using this line: llvm-gcc -o tree tree.c So that I am not enabling any optimization and I am not running either DSA or PoolAlloc. I use the unoptimized .bc file generated and convert it either to .c or .ll and both formats exhibit this behavior Thanks ======================= struct bintree { int data; struct bintree *Left; struct bintree *Right; }; void inorder_traversal(struct bintree *node) { if (node->Left != 0) inorder_traversal( node->Left ); printf("%d\t", node->data); if (node->Right != 0) inorder_traversal( node->Right ); } struct bintree *ma...

...ile generated and convert it either to .c or .ll and both formats exhibit this > behavior llvm-gcc is strange in that it runs optimizations even when not asked to. Try this: llvm-gcc -o tree tree.c -Wa,-disable-inlining -Wl,-disable-inlining -Chris > ======================= > struct bintree > { > int data; > struct bintree *Left; > struct bintree *Right; > }; > > void inorder_traversal(struct bintree *node) > { > if (node->Left != 0) inorder_traversal( node->Left ); > printf("%d\t", node->data); > if (node->Right != 0) inor...

...clude" -fopenmp -O2 -Wall -c trutilReg.cpp -o trutilReg.o g++ -I"C:/Util/R/R-2.12.0/include" -fopenmp -O2 -Wall -c utils.cpp -o utils.o g++ -shared -s -static-libgcc -o CORElearn.dll tmp.def Rconvert.o Rfront.o binarize.o binarizeReg.o binnode.o binnodeReg.o binpart.o bintree.o bintreeReg.o c45read.o calibrate.o constrct.o constrctReg.o cost.o dataStore.o error.o estCommon.o estOrdAttr.o estimator.o estimatorReg.o expr.o exprReg.o frontend.o ftree.o kdtree.o mathutil.o menu.o model.o modelReg.o mstring.o new_new.o nrutil.o options.o printUtil.o prune.o pruneReg.o random...

Hi Stepan, Sorry for the delay. It's great that you are working on MergeFunctions as well and I agree, we should definitely try to combine our efforts to improve MergeFunctions. Just to give you some context, the pass (with the similar function merging patch) is already being used in a production setting. From my point of view, it would be better if we focus on improving its capability

...6 0 0.01 27856 bftest.ll 3 66992 0 0.01 66957 0 0.01 66957 biaridecod.ll 12 46041 0 0.01 46020 0 0.01 46020 biariencode.ll 14 114832 0 0.02 114811 0 0.02 114811 bicg.ll 12 26496 0 0.01 26448 0 0.00 26448 bigfib.ll 274 491355 29 0.04 492046 9 0.05 493974 bigstack.ll 3 15230 0 0.01 15218 0 0.01 15218 bintree.ll 12 25615 0 0.01 25591 0 0.01 25591 bisect_test.ll 2 10531 0 0.01 10506 0 0.01 10506 bitap.ll 2 32801 0 0.01 32775 0 0.01 32775 bitarray.ll 4 5398 0 0.01 5361 0 0.01 5361 bitboard64.ll 21 43510 0 0.01 43488 0 0.01 43268 bitcnt_1.ll 1 2212 0 0.01 2175 0 0.01 2175 bitcnt_2.ll 1 2502 0 0.01 2465 0 0...