similar to: free variable, built-in R functions

Dear All, I tried to write a C++ program that uses R internals and I encounter "undefined reference" error when linking to libR.so. Here is an small example of the program test.cpp: extern "C" { #include <config.h> #include <IOStuff.h> int main(int argc, char** argv) { R_IoBufferInit(&R_ConsoleIob); return 0; } } I built it using: g++ -o test

Hi James, > It depends on how your bitcode is loaded. It can be loaded either by llc, > which outputs pure ELF/Mach-O, in which case those function references get > turned into relocations that the linker (ld, Gold) applies. > > If you're loading bitcode via the JIT, it uses dlsym() to try and introspect > your runtime environment to find the symbol. Ah, that makes sense -

Hi, > Is it possible to keep adding bitcode incrementally to the > system, and JIT'ing it, and have the set of functions > defined in the system keep growing, so that the next hunk > of bitcode added can have access to all the functions > defined so far? Yes. The JIT supports lazy compilation mode where it will generate thunks that only get compiled/linked when called - see

On 08/04/2017 03:53 PM, Michal Hocko wrote: > On Fri 04-08-17 00:02:01, Michael S. Tsirkin wrote: >> On Thu, Aug 03, 2017 at 03:20:09PM +0000, Wang, Wei W wrote: >>> On Thursday, August 3, 2017 9:51 PM, Michal Hocko: >>>> As I've said earlier. Start simple optimize incrementally with some numbers to >>>> justify a more subtle code. >>>> --

On 08/04/2017 03:53 PM, Michal Hocko wrote: > On Fri 04-08-17 00:02:01, Michael S. Tsirkin wrote: >> On Thu, Aug 03, 2017 at 03:20:09PM +0000, Wang, Wei W wrote: >>> On Thursday, August 3, 2017 9:51 PM, Michal Hocko: >>>> As I've said earlier. Start simple optimize incrementally with some numbers to >>>> justify a more subtle code. >>>> --

On Fri 04-08-17 16:15:24, Wei Wang wrote: > On 08/04/2017 03:53 PM, Michal Hocko wrote: > >On Fri 04-08-17 00:02:01, Michael S. Tsirkin wrote: > >>On Thu, Aug 03, 2017 at 03:20:09PM +0000, Wang, Wei W wrote: > >>>On Thursday, August 3, 2017 9:51 PM, Michal Hocko: > >>>>As I've said earlier. Start simple optimize incrementally with some numbers to

On Tue, 7 Mar 2006, Vikram S. Adve wrote: > Changing the heuristics directly would have to be a custom change (i.e., > couldn't be checked in). Is there a way for a client pass or tool to > influence the heuristics? If not, does it make sense to add such a > mechanism? To be clear, I'll restate my position here, then follow up with more specifics of such a mechanism to

I am trying to write a ModulePass which requires PostDominator sets for every function in the module. Now finding post dominators is a function pass. The link on the llvm.org website says that : "Currently it is illegal for a ModulePass<http://llvm.org/docs/WritingAnLLVMPass.html#ModulePass>to require a FunctionPass <http://llvm.org/docs/WritingAnLLVMPass.html#FunctionPass>.

Hey all, I'm working on adding interprocedural FunctionAttrs optimization ( http://llvm-cs.pcc.me.uk/lib/Transforms/IPO/FunctionAttrs.cpp) to ThinLTO so it does something similar to what LTO is doing ( https://bugs.llvm.org/show_bug.cgi?id=33648). I've hit a problem with how the FunctionAttrs optimization expects linkage types. In ThinLTO since the linkage type is set to External or

I am trying to use CloneFunction to clone every IR function in a program, give the cloned versions a prefix and call the clones from the original functions (redirect the calls). Surprisingly, I see that after the LTO optimizations, the number of machine basic blocks in the two functions differ in some cases. Is this reasonable at all, given that the two functions must be exactly the same in the

Hello everyone, I have been interested in compilers, especially in the optimization aspects from quite some time now. I don't know if I have a decent background to brag about, but all I can say is that I have tried very small things related to building a compiler [0]. However I admit that I am still new to a lot of things. Like many others who are interested in compilers, I am interested

[img]http://www.magicansoft.com/images/free-mac-apps-you-can[/img]VLC Media Player (http://www.videolan.org/) VLC Media Player is one of the best media players you will need. It can play multiply formats, like MPEG-1, MPEG-2, MPEG-4, DivX, MP3, and OGG, as well as for DVDs, VCDs, and various streaming protocols. It is free, open source, cross-platform.

Hi Jakob, I have been trying to learn how the CodeGen passes work and I am playing around with the -debug-pass option. I tried implementing a bare CallGraphSCCPass based Pass in the CodeGen which basically does nothing for now. I mostly tried to replicate what RegAlloc passes do. I did this instead of modifying the existing RegAlloc passes to use CallGraphSCCPass because that was becoming way too

Hi i have the data in the following format: rent,100,1,common,674 pipe,200,0,usual,864 car,300,1,uncommon,392:jump,700,0,common,664 car,200,1,uncommon,864:snap,900,1,usual,746 stint,600,1,uncommon,257 pull,800,0,usual,594 where as i want the above 6 lines data into 8 lines as below (Spliting row 3 & 4 at : and sending to a new row): rent,100,1,common,674 pipe,200,0,usual,864

Hi Jakob, I have spent last 4 weeks trying to figure out how to implement Interprocedural Register Allocation. I must admit that I was really overwhelmed with LLVM's codebase while trying to figure this out :) There is so much to know! I think I have reached a point where I have some sort of basic understanding of what needs to be done, but I need some help from here on. So here is the

Hey, Thank you for your replies, Chris and Dan. Chris Lattner wrote: >> I am considering writing a patch for LoopInfo instead of creating my own >> data structure for irreducible loops. >> Is such an enhancement desired or even already implemented by someone >> (e.g. in the 2.6 branch)? > I'm not sure that this is a good idea. LoopInfo is clearly defined to >

On Wed, Aug 04, 2004 at 12:16:12PM -0700, Reid Spencer wrote: > So I propose: > [snip] > -O3 = aggressive optimization, regardless of computation time with the > effect of producing the fastest executable I would suggest splitting -O3 into 2 or more levels of optimization, because as written, -O3 sounds pretty scary: "regardless of computation time", and given some

On Wed, 2004-08-04 at 12:23, Misha Brukman wrote: > On Wed, Aug 04, 2004 at 12:16:12PM -0700, Reid Spencer wrote: > > So I propose: > > > [snip] > > -O3 = aggressive optimization, regardless of computation time with the > > effect of producing the fastest executable > > I would suggest splitting -O3 into 2 or more levels of optimization, > because as

Hi, again, I think you can do it in the same way that the other allocators have been coded, i.e extend RA, register the pass and so forth. I am not sure about the best way to pass information among a run of RegAlloc to the other, maybe the other guys in the list could suggest something. Yet, you can always dump it into a file, and read it again, everytime it is necessary. Remember that

Hello, I need interprocedural alias analysis while I'm using GVN for infeasible path analysis. So, I've tried "-steens-aa" from poolalloc project, but it doesn't seem to be working as I expected. For example, int global; int bar(void) { return 5; } int foo(void) { int a; scanf("%d", &a); if(global) a = bar(); return a; } In this case, I