search for: babic

...eedings{erosa94taming, author = {Ana M. Erosa and Laurie J. Hendren}, title = {Taming Control Flow: A Structured Approach to Eliminating Goto Statements.}, booktitle = {ICCL}, year = {1994}, pages = {229--240}, } Cheers, -- Domagoj Babic http://www.domagoj.info/ http://www.calysto.org/

On 8/29/07, Domagoj Babic <babic.domagoj at gmail.com> wrote: > Seung, > > On 8/25/07, Chris Lattner <sabre at nondot.org> wrote: > > Ok. Note that LLVM can represent irreducible loops. You can handle > > this through code duplication. > > -Chris > > > If you are willing to...

Daniel, On 8/30/07, Daniel Berlin <dberlin at dberlin.org> wrote: > On 8/29/07, Domagoj Babic <babic.domagoj at gmail.com> wrote: > > Seung, > > > > On 8/25/07, Chris Lattner <sabre at nondot.org> wrote: > > > Ok. Note that LLVM can represent irreducible loops. You can handle > > > this through code duplication. > > > -Chris > &g...

...+ a4 b4 p = sum c4 Spear finds a non-trivial solution of this query in 24.08 sec on AMD 64 X2 4600+ with the default heuristics and in 3.18 sec with the fh_1_1 heuristic. -------------------------------------- The prover and the input format specification are available on: http://www.cs.ubc.ca/~babic/index_spear.htm Regards, Domagoj Babic P.S. I hesitated to send the email to the list, but several people in the channel showed interest and encouraged me to send a release notification.

On Sep 29, 2006, at 2:05 PM, Domagoj Babic wrote: > > Check out scc_* iterators. Also note that the call graph > is not aware of the indirect calls, so you will need to write your > own CG implementation if you need to handle function pointers > soundly. > Chris, is this true? If so, it seems like a bad property for th...

...strictly based on LLVM, but could provide valuable ideas for further LLVM development, or are interesting from software analysis perspective. As I suggested in the channel, a poll on llvm.org could actually be a simpler and faster way to gauge the interest and expectations. Regards, Domagoj Babic

On 4/9/07, Domagoj Babic <babic.domagoj at gmail.com> wrote: > > > Traditionally, such analyses have been considered too expensive to be > practical, and were mostly an academic curiosity. The core of the > problem is the lack of adequate automated decision procedures which > could quickly determine...

Hi all, I spent several hours today trying to compile llvm-gcc4 from svn and llvm from cvs on amd64 linux. In the case anyone else decides to try the same, this could ease your pain: 1) check out llvm, llvm-gcc 2) create llvm-obj llvm-gcc-obj export LLVM_INSTAL=<install_dir> cd llvm-obj export LLVM_OBJ=`pwd` ../llvm/configure --prefix=$LLVM_INSTALL --enable-debug-runtime 4) At one point,

On Oct 2, 2007, at 1:03 AM, Domagoj Babic wrote: > Hi all, > > I have the same problem. My guess is that when a structure > is passed as a parameter, you cast it into an array for optimization > reasons (less parameters, less stack space). This is not an optimization. This behavior is to be ABI complaint when emitting co...

...nullhttpd.sourceforge.net/httpd/ RABL 1.0.0 blackhole list server designed to monitor global network activity and make decisions based on network spread and infection rate http://nuclearelephant.com/projects/rabl/ GZIP 1.2.4 archiver http://www.gzip.org/ HSAT 1.7 SAT solver http://www.cs.ubc.ca/~babic XSHHTPD 34b09 http server http://www.stack.nl/~johans/xs-httpd/ VSFTPd 2.0.4 ftp server http://vsftpd.beasts.org/ LICQ 1.3.2 multi protocol messenger http://www.licq.org/ NCSA HTTPd 1.5.2a http server http://hoohoo.ncsa.uiuc.edu/docs-1.5/setup/Compilation.html PURE FTPd 1.0.21 ftp server http:...

...ng working by mid January. Until then, directly using the LLVM linking facilities to handle the bytecode is probably the best if not only option. -Chandler PS: I'm still kinda new, so someone else may come along and correct me, but that's the best I can figure out... On 12/10/06, Domagoj Babic <babic.domagoj at gmail.com> wrote: > > Hi, > > I'm trying to compile some apps with the new llvm-gcc4 on amd64 linux > to .bc files, rather than to the native code. The same process I used to > build those apps before with llvm-gcc3 doesn't work: > > 1) > e...

...t check the usage of library functions (for instance, if external library function foo dereferences a pointer, Calysto can't figure that out unless the code for foo was compiled into the same module). Specification of external libraries will be done by early Aug. Regards, -- Domagoj Babic http://www.domagoj.info/ http://www.calysto.org/

...? Explanation: choose_dh (dh.c:111) calls fopen twice (@120). If the first call to fopen fails (returns NULL), but the second one succeeds, fgets (@129) is called with f==NULL. ------------------------------------------ Can anyone confirm that this is a potential issue? Thx, -- Domagoj Babic http://www.domagoj.info/ http://www.calysto.org/

Hi, Here's something I don't understand... How come that UNDEF can appear as a branch condition at all? I just can't think of any ways. If you write something like fun() { int x; if (x > 100) { ... } else { ... } } LLVM generates a boolean temporary that compares (uninitialized) value of x with 100. Second, if it already can appear, isn't that a bug that

I have a FunctionPass F that needs a list of all the SCCs for use in its doFinalization() method. Let's say I write a CallGraphSCCPass C that creates an array of all SCCs. Let C be required by F, and let F call getAnalysis<C>() from its doFinalization() method. Am I guaranteed that C's runOnSCC() method will have executed on all SCCs before F's doFinalization() method?

...size; ++i) { Function *F = (*SCCI)[i]->getFunction(); ...... } } .... } Check out scc_* iterators. Also note that the call graph is not aware of the indirect calls, so you will need to write your own CG implementation if you need to handle function pointers soundly. Domagoj Babic

On Fri, 29 Sep 2006, Vikram Adve wrote: > On Sep 29, 2006, at 2:05 PM, Domagoj Babic wrote: >> Check out scc_* iterators. Also note that the call graph >> is not aware of the indirect calls, so you will need to write your >> own CG implementation if you need to handle function pointers >> soundly. > Chris, is this true? If so, it seems like a bad propert...

...as you are on amd64 linux. I am currently running into the error "Did not get a target machine!" on the first file compiled by xgcc. Did you encounter this error at all? Also, what distribution did you use? GCC version, and target triple? Thanks, -Chandler Carruth On 12/10/06, Domagoj Babic <babic.domagoj at gmail.com> wrote: > > Hi all, > > I spent several hours today trying to compile llvm-gcc4 from svn and llvm > from > cvs on amd64 linux. In the case anyone else decides to try the same, this > could ease your pain: > > 1) check out llvm, llvm-gcc &...

...? Yeah, it's NP, but the chances are that you are not looking at that many variables at the same time. I'm wondering how much could one improve the register allocation by using optimal algorithms, and how much impact would that have on the speed of the produced native code? Thx, Domagoj Babic

...it (my guess is that this should be doable by passing some parameter to llvm-gcc)? If there is no way to disable it, could anyone suggest where should I look into the code and whether you would accept a patch that would add an option that disables the optimization? Thank you, -- Domagoj Babic http://www.domagoj.info/ http://www.calysto.org/