search for: ihusar

On Thu, Jun 25, 2009 at 12:32 AM, ihusar<ihusar at fit.vutbr.cz> wrote: >                //now i need to create an instruction that represents a call to a intrinsic >                Function* FIntr = Intrinsic::getDeclaration(&M, Intrinsic::regread_i32); > >                // here it fails: void llvm::CallInst::init(...

...pilation. I think also other may find it useful, so I am sending it here, so you can add it somewhere on the web if you will would like to. It is not exactly a publication, rather lecture slides. Title: Languages Used in LLVM During Compilation Date: 30th April 2014 Author: Adam Husar, FIT BUT, ihusar at fit.vutbr.cz Abstract: Presentation deals with intermediate presentations used in LLVM during compilation from a high-level programming language into assembly language. It briefly describes clang's AST, then LLVM IR, and also Selection DAG and Machine Code repesentations. It can be dowload...

Adam, I just fixed this issue a few days ago. A version from the trunk should work for you. Cheers, Nadav -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu] On Behalf Of ihusar Sent: Tuesday, February 15, 2011 15:52 To: llvmdev at cs.uiuc.edu Subject: Re: [LLVMdev] How to use ConstantFoldConstantExpression? I forgot to mention, that I use LLVM release 2.8, I did not try it with the latest revision, but I expect that I am rather doing something wrong than using non-implem...

Hi everyone, I am trying to write a pass, that finds some instructions and replaces them with my intrinsics, but I am having problem understanding, how this should be done. Let's say I have this instruction: %tmp14 = load i32* getelementptr ([32 x i32]* @gpregs, i32 0, i64 28) and i need to read the load's operands and replace it by let's say: %tmp14 = call i32

I forgot to mention, that I use LLVM release 2.8, I did not try it with the latest revision, but I expect that I am rather doing something wrong than using non-implemented functions. On Tue, 15 Feb 2011 14:09:57 +0100, ihusar <ihusar at fit.vutbr.cz> wrote: > Hello, > > i need to fold constants, i found that a function ConstantFoldConstantExpression could be used, > however I am not able to make it fold anything. Could you please give me some advice, what I am doing wrong? > > > My code lo...

Hello, i need to fold constants, i found that a function ConstantFoldConstantExpression could be used, however I am not able to make it fold anything. Could you please give me some advice, what I am doing wrong? My code looks something like this: //data layout is obtained from clang-generated code for triple arm-none-linux-gnueabi with added v32:32:32 const char* const TARGET_DATA_LAYOUT =

Hello everyone, we are planning to implement a stronger alias analysis for backend, because e.g. for VLIW architectures, this is our main performance limitation. I would have 2 questions regarding this. I know that backend processes one function at a time, is it somehow possible to do there a whole program analysis, or could you give me some guidelines? Which alias analysis algorithm

Hello gyus, I am working on a project, where we are trying to create a development environment for new ASIP processor design. Part of this project is a compiler generator, where we would like to generate C compiler from some instruction description. To keep it short, let's say, that in each instruction's semantics is described by some C code. What I would like to do is to compile this

On Thu, 04 Jun 2009 22:55:04 +0200, Pertti Kellomäki <pertti.kellomaki at tut.fi> wrote: > Hi Adam, > > John is right, the TCE stuff would be useful for you. Our > compiler targets a processor template that the designer can > populate pretty freely. The compiler then reads the architecture > description and creates an LLVM backend on the fly. > > Please don't

Hello, I would like to ask, whether do the functions code in the compiler-rt library are written in the way that they can be used also for 16-bit architectures, or it was intended for 32-bits only. I looked at the code and it seemed quite portable, but are there any issues I should know when trying it for 16-bit architectures? Thank you Adam

Hi, We are now about halfway between the 3.4 and 3.5 releases, and I would like to start preparing for a 3.4.1 release. Here is my proposed release schedule: Mar 26 - April 9: Identify and backport additional bug fixes to the 3.4 branch. April 9 - April 18: Testing Phase April 18: 3.4.1 Release How you can help: - If you have any bug fixes you think should be included to 3.4.1, send me an

Hello, I was searching on the net, but I cannot figure out what instruction selection algorithm is used in LLVM backends in version 2.6. Are there multiple algorithms used, or is it just one? E.g. one for -O0 and different for -O3? Thank you Adam