search for: warshal

...r.c /usr/src/usr.bin/yacc/lalr.c /usr/src/usr.bin/yacc/lr0.c /usr/src/usr.bin/yacc/main.c /usr/src/usr.bin/yacc/mkpar.c /usr/src/usr.bin/yacc/output.c /usr/src/usr.bin/yacc/reader.c /usr/src/usr.bin/yacc/skeleton.c /usr/src/usr.bin/yacc/symtab.c /usr/src/usr.bin/yacc/verbose.c /usr/src/usr.bin/yacc/warshall.c echo yacc: /usr/lib/libc.a >> .depend cc -O -pipe -D__FBSDID=__RCSID -c /usr/src/usr.bin/yacc/closure.c cc -O -pipe -D__FBSDID=__RCSID -c /usr/src/usr.bin/yacc/error.c cc -O -pipe -D__FBSDID=__RCSID -c /usr/src/usr.bin/yacc/lalr.c cc -O -pipe -D__FBSDID=__RCSID -c /usr/src...

I am doing some work the Rgraphviz, a Bioconductor package, but since my question is of a more general nature, thought I would send to this list in hopes that a graph theory expert could answer my question. I wish to do some statistics on node-node relationships. In particular, I want to see if two connected nodes share a common property. I believe that the more "connected" the two

Dear all, I have an ontology which I would like to load in R to then compute the minimum distance between elements. Since this ontology is not only DAG, the problem is non trivial and therefore decided to use R with the powerful e1071 library (allShortestPaths) to do that. That method requires to provide a distance matrix between the various objects. My ontology contains 32768 objects and

Hi all, I've started looking at the GlobalMerge pass, enabled by default on ARM and AArch64. I think we should reconsider that, at least for AArch64. As is, the pass just merges all globals together, in groups of 4KB (AArch64, 128B on ARM). At the time it was enabled, the general thinking was "it's almost free, it doesn't affect performance much, we might as well use it".

Hello. My target architecture supports natively 16 bit integers (i16). Whenever I write in C programs using only short types, clang compiles the program to LLVM and converts the i16 data to i32 to perform arithmetic operations and then truncates the results to i16. Then, the InstructionCombining (INSTCOMBINE or IC) pass removes these conversions back and forth from i16, except for

...-0.33| 2736056550| 0|0.257280074| 0.12| 2736056550| 0| |SingleSource/Benchmarks/Polybench/linear-algebra/solvers/gramschmidt/gramschmi| 40|1.620215144| 3060031368|1.615894212| 0.27| 3060031348| 0|1.623027315| -0.17| 3060031345| 0| |SingleSource/Benchmarks/Polybench/medley/floyd-warshall/floyd-warshall.test | 40|1.453502166|14087698898|1.446967252| 0.45|14087698901| 0|1.452044968| 0.1|14087698904| 0| |SingleSource/Benchmarks/Polybench/medley/reg_detect/reg_detect.test | 1000|0.011356117| 106220639|0.011360151| -0.04| 106220643| 0|0.011330179| 0.23...

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

...0 0.01 10661 0 0.01 10661 flops-4.ll 1 12150 0 0.01 12135 0 0.01 12135 flops-5.ll 1 12874 0 0.01 12859 0 0.01 12859 flops-6.ll 1 12866 0 0.01 12851 0 0.01 12851 flops-7.ll 1 10239 0 0.01 10224 0 0.01 10224 flops-8.ll 1 13031 0 0.01 13016 0 0.01 13016 flops.ll 2 82106 0 0.02 82091 0 0.02 82091 floyd-warshall.ll 12 21456 0 0.01 21414 0 0.01 21414 fmo.ll 23 94259 0 0.02 94238 0 0.02 94238 foldfg.ll 190 393484 5 0.04 391567 2 0.04 389988 follow.ll 4 20779 0 0.01 20753 0 0.01 20753 fontname.ll 2 10674 0 0.01 10645 0 0.01 10645 fontsize.ll 1 1218 0 0.01 1189 0 0.01 1189 formatBitstream.ll 21 90029 0 0.01 8...