search for: foo4

Hi all! I played around with the LLVM LTO example(https://llvm.org/docs/LinkTimeOptimization.html#example-of-link-time-optimization), but got some questions. As the document says, the function foo4 should be removed. However, under my test, function foo4 is not removed. I have tried both gnu ld with LLVMgold.so and lld, neither of them removes function foo4. I compile and run the example as instructed: % clang -flto -c a.c -o a.o # <-- a.o is LLVM bitcode file % clang -c main.c -o...

Hi the list In the DESCRIPTION file of my package foo0, I have: Depends: foo1 Imports: foo2 Suggest: foo3 Enhence: foo4 If I understand correctly, to install foo0 on my computer, I need to already have foo1, foo2, foo3. foo4 is not necessary. I my R sesssion, when I will write: library(foo0), then the package foo1 will be attach. foo2, foo3 and foo4 will not. Is that correct? But what is the difference between...

https://bugzilla.netfilter.org/show_bug.cgi?id=842 Summary: Addition of iptables rule referencing an ipset of the wrong address family does not fail Product: ipset Version: unspecified Platform: All OS/Version: All Status: NEW Severity: normal Priority: P5 Component: default

This is just a note/wishlist/for the record: With foo1 <- function() { res; } foo2 <- function() { for (i in c()) res <- 1; res; } foo3 <- function() { while (FALSE) res <- 1; res; } foo4 <- function() { if (FALSE) res <- 1; res; } we get: > foo1() Error in foo1() : object 'res' not found > foo2() Error in foo2() : object 'res' not found > foo3() Error in foo3() : object 'res' not found > foo4() Error in foo4() : object 'res' n...

Hi All, I compiled the following code on my linux PC using clang with PIE option- struct struct4 {char a; char b; char c; char d; }; struct struct4 foo4 = {'a','2','c','4'}; struct struct4 fun4() { return foo4; } int main() { fun4(); return 0; } > clang -g -fPIE structs.c In GDB session when i call p/c fun4() i get something like below- (gdb) p/c fun4() Cannot access memory at address 0x34633261 Disasse...

Hello, This is my first post to the help request list, so I'm going to err on the side of giving too much information. I'm working on writing a simulation in which agents will make repeated production and exchange decisions with randomly chosen partners. The idea is, all agents can produce two goods which they want to consume, they choose a value t in [0,10] which sets their production

# ./imaptest host=127.0.0.1 port=143 user=tstem38 pass=pass4you mbox=/ gpfs/users/t/s/tstem38/IMAP/foo4 Panic: file client.c: line 620: assertion failed: (idx >= array_count(&clients) == NULL) IOT/Abort trap(coredump) -------------- next part -------------- A non-text attachment was scrubbed... Name: smime.p7s Type: application/pkcs7-signature Size: 2541 bytes Desc: not available URL: &l...

Hi all, I am trying to construct a pairwise coocurrence matrix for certain terms appearing in a number of documents. For example I have the following table with binary values showing the presence or absence of a certain term in a document: term1 term2 term3 term4 term5 doc1 1 1 0 0 1 doc2 1 1 0 1 1 doc3 1 0 0 0 1 And I want to have a matrix with the number of the pairwise coocurrencies. So,

...llvm-ar cr a.lib a.bc > $clang -O0 -flto main.lib a.lib -o main0 > $clang -O1 -flto main.lib a.lib -o main1 > $clang -O2 -flto main.lib a.lib -o main2 > > $nm main0 > … > 00000000004005a0 t foo1 > 0000000000400580 t foo2 > 00000000004005e0 t foo3 > 0000000000400530 t foo4 > 0000000000400500 t frame_dummy > … > $ nm main1 > … > 0000000000400550 t foo1 > 0000000000400580 t foo3 > 0000000000400530 t foo4 > 0000000000400500 t frame_dummy > … > $ nm main2 > … > 00000000004004d0 t frame_dummy > … > > From blew verbose output,...

...2:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32" target triple = "i686-pc-linux-gnu" @i.b = internal global i1 false ; <i1*> [#uses=2] define void @foo2() { entry: store i1 true, i1* @i.b, align 1 ret void } declare void @foo4() define i32 @foo1() { entry: %tmp1.b = load i1* @i.b, align 1 ; <i1> [#uses=1] br i1 %tmp1.b, label %cond_true, label %return cond_true: ; preds = %entry call void @foo4( ) ret i32 52 return: ; preds = %entry ret...

Let's suppose I have userids and associated attributes... columns a and b a <- c(1,1,1,2,2,3,3,3,3) b <- c("a","b","c","a","d","a", "b", "e", "f") so a unique list of a would be id <- unique(a) I want a matrix like this... [,1] [,2] [,3] [1,] 3 1 2 [2,] 1 2 1 [3,]

Hi All, I compiled the following code on my linux PC using clang with PIE option- struct struct4 {char a; char b; char c; char d; }; struct struct4 foo4 = {'a','2','c','4'}; struct struct4 fun4() { return foo4; } int main() { fun4(); return 0; } > clang -g -fPIE structs.c In GDB session when i call p/c fun4() i get something like below- (gdb) p/c fun4() Cannot access memory at address 0x34633261 Disasse...

...ment that are all caps and then end with .f. I can do the all caps part pretty easily, but I have tried a number of variations on the \ and can't get a recognition of that operator. As a simple example A.f<-"foo1" AA.f<-"foo2" aa.f<-"foo3" A.a<-"foo4" ls() [1] "A.a" "A.f" "aa.f" "AA.f" temp1<-ls(pattern="[A-Z]") temp1 [1] "A.a" "A.f" "AA.f" > temp2<-ls(pattern=\f) Error: unexpected input in "temp2<-ls(pattern=\" The end goal is to iso...

...ion(a="numeric"),prototype = list( a = integer(0))) > setClass("bar", representation(b="numeric")) > setClass("foo2",contains=c("foo") ) > setClass("foo3",contains=c("foo", "VIRTUAL") ) > setClass("foo4",contains=c("foo", "bar") ) > setClass("bar2",contains=c("foo2") ) > setClass("bar3",contains=c("foo3") ) > setClass("bar4",contains=c("foo4") ) > i<-new("foo",a=1) > new("bar2...

Hi! I wonder if llvm::APFloat::toString() can be const since it should not modify the APFloat. -Jochen

Hi Umesh, Thank you for the suggestion. I can use the "Brute force method " to narrow down the LTO wrong instructions here and there, but I still don't know why these wrong instructions are generated, and how to let Clang LTO don't generate those wrong instructions. I suspect the wrong code is caused by some LTO wrong optimization pass, so I hope to disable all optimizations in

...s used******/ > ; Function Attrs: nounwind > define void @_Z3fooPi(i8* %a) #0 { > call void @llvm.foo5(i8* %a) > call void @llvm.foo5(i8* %a) > ret void > } > ; Function Attrs: nounwind > declare void @llvm.foo5(i8*) #0 > attributes #0 = { nounwind } I'd expect foo4 to have the "argmemonly" attribute. How did you generate this IR? If you round-trip to bitcode, what happens? I expect the attribute to be added. -- Mehdi > > > /****** the intrinsic function foo6 is used******/ > ; Function Attrs: nounwind > define void @_Z3fooPi(i8...

...8:128-a0:0:64- > f80:32:32" > target triple = "i686-pc-linux-gnu" > @i.b = internal global i1 false ; <i1*> [#uses=2] > > define void @foo2() { > entry: > store i1 true, i1* @i.b, align 1 > ret void > } > > declare void @foo4() > > define i32 @foo1() { > entry: > %tmp1.b = load i1* @i.b, align 1 ; <i1> > [#uses=1] > br i1 %tmp1.b, label %cond_true, label %return > > cond_true: ; preds = %entry > call void @foo4( ) > ret i32...

On Mar 6, 2010, at 3:39 AM, Jochen Wilhelmy wrote: > Hi! > > I wonder if llvm::APFloat::toString() can be const since > it should not modify the APFloat. Done in r97883, thanks.

...d to the findNearestCommonDominator() function. > The method of finding the control flow join should also work for this case: Yes. > if (a< b) > { > foo1(); > if (c< d) goto label; > foo2(); > } > else > { > foo3(); > label: > foo4(); > } > bar(); > > - Jochen Tobi