search for: dogon

Hi. My name is Gil Dogon and I am working in MobileEye using LLVM in order to generate code for a proprietary processor. Our processor architecture is very similar to MIPS, so I started to work using the "experimental" MIPS back end. Anyway, my question is rather simple but somehow I did not find a quick a...

As mentioned in an earlier mail, I am working on an LLVM backend for a custom processor based on MIPS. My problem is how to extend LLVM to support some esoteric/non-standard feature of the underlying hardware. I saw in the "Extending LLVM" document, that the easiest / most common way to do this was using an intrinsic function, and examples of the technique abound (all SSE for

...manual) defined in the gcc/config directory corresponding to your target. If the name the the declaration matches the name used with GCCBuiltin in the intrinsics td file then any calls to the gcc builtin in the source should get automatically translated to the calls to the LLVM intrinsic. Gil Dogon wrote: > As mentioned in an earlier mail, I am working on an LLVM backend for a > custom processor based on MIPS. > My problem is how to extend LLVM to support some esoteric/non-standard > feature of the underlying hardware. > I saw in the "Extending LLVM" document, that...

OK , grepping the whole source tree for 'ctlz' I found the answer to my question in: test/FrontendC/2006-01-16-BitCountIntrinsicsUnsigned.c and that is to use gnu frontend style __builtin_clz() for this one. This test/FrontendC directory has a plethora of other usefull examples so I guess It will be sufficient for me. However I still think that some documentation of the frontend

On Mon, 29 Jan 2007, Gil Dogon wrote: > Now the problem with this code , is that the calculation of the address > mat[i][j] which is done by the (two) getelementptr instructions > is quite expensive (involving at least two multiplications and one > addition) hence it actualy should have been moved out of the inner lo...

Chris Lattner wrote: > As others have mentioned, hacking the front-end isn't that hard. In > any case though, please be aware that a precompiled binary for a non- > MIPS target won't produce correct code if you are (for example) using > an x86 front-end and forcing llc to generate mips code with llc - > march=mips. The front-end does type layout and knows very ABI

Hello. I have a problem which is quite basic for array optimization, amd I wonder whether I am missing something, but I could not find the LLVM pass that does it. Consider the following code snippet: int test() { int mat[7][7][7]; int i,j,k,sum=0; for(i=0;i<7;i++){ for(j=0;j<7;j++){ for(k=0;k<7;k++){ sum+=mat[i][j][k]^mat[i][j][k^1]; } } } return

I stumbled upon the following problem when truing to support the following non-standard instruction extensions to a MIPS like architecture: 1.) double store : Ri,Ri+1 are stored to the memory at address specified by (Rj). Here the instruction encoding includes only 'i' but it implicitly uses also Ri+1. I can define a special intrinsic for this in "C" such as

Luke Dalessandro wrote: > Gil, it's really easy to add builtins to the llvm-gcc frontend and have > them auto-magically converted to the llvm intrinsic versions. The main > problem with this is that you end up with a non-standard front end that > you have to somehow distribute to the people who need it. There may be > funny licensing problems, etc... I don't really