search for: main1

...but that seems unrelated), works the first time, but >>> crashes the second with the "mapping to a source type" assertion. >>> >>> I'm not 100% sure yet, but my understanding of what happens is the >>> following: >>> >>> 1) "main1" module gets created >>> 2) inlinining loads module "a", clones it, links module "a'" into >>> "main1". This module contains an opaque struct definition "t" that is now >>> referenced by "main1'". >>&g...

...gt; (selectively, but that seems unrelated), works the first time, but > > crashes the second with the "mapping to a source type" assertion. > > > > I'm not 100% sure yet, but my understanding of what happens is the > > following: > > > > 1) "main1" module gets created > > 2) inlinining loads module "a", clones it, links module "a'" into > > "main1". This module contains an opaque struct definition "t" that is now > > referenced by "main1'". > > 3) inli...

...t a 'tree' of frames). I want to flatten it to be a list of frames. However, if I unlist(root), it will flatten the frames as well. Is there a simply way to flatten the tree to certain depth? aframe1=data.frame(x=1:3,y=1:3) aframe2=data.frame(u=7:9,v=11:13) aframe3=data.frame(p=3:5,q=6:8) main1=list(sub1=aframe1, sub2=aframe2) main2=list(sub3=aframe3) root=list(main1=main1, main2=main2) str(root) unlist(root)

...ulo some constants) twice and then inlining a number of Modules (selectively, but that seems unrelated), works the first time, but crashes the second with the "mapping to a source type" assertion. I'm not 100% sure yet, but my understanding of what happens is the following: 1) "main1" module gets created 2) inlinining loads module "a", clones it, links module "a'" into "main1". This module contains an opaque struct definition "t" that is now referenced by "main1'". 3) inlinining loads module "b", clo...

...unctions? Or just linking? > (selectively, but that seems unrelated), works the first time, but > crashes the second with the "mapping to a source type" assertion. > > I'm not 100% sure yet, but my understanding of what happens is the > following: > > 1) "main1" module gets created > 2) inlinining loads module "a", clones it, links module "a'" into > "main1". This module contains an opaque struct definition "t" that is now > referenced by "main1'". > 3) inlinining loads module...

Hi, I used the following commands on the program attached below: llvm-gcc --emit-llvm main.c -c -o main.bc opt -ipconstprop main.bc -o main1.bc diff main.bc main1.bc no difference was o/p :( The Program Segment is as shown below: #include <stdio.h> void f1(int a) { a=a+1; printf("%d",a); } void f2() { int b; b=1; f1(b); } int main() { int a=1; f2(); f1(a); } Also,when i use th...

...<== /* vim: set noexpandtab tabstop=2: */ #include <stdio.h> int main() { puts("Hello World!"); return 0; } ==> myputs.c <== /* vim: set noexpandtab tabstop=2: */ #include <stdio.h> int myputs(char *s) { return printf("myputs:%s\n", s); } $ ./main1.sh clang -Wall -pedantic -S -emit-llvm -c -o main.ll main.c clang -Wall -pedantic -S -emit-llvm -c -o myputs.ll myputs.c clang -Wall -pedantic -c -o main.o main.ll clang -Wall -pedantic -c -o myputs.o myputs.ll clang main.o myputs.o -o ./main.exe ./main.exe Hello World! sed -i 's/@myputs\>/@...

...er is a small application that I wrote that loads the dll and calls the main function. Here's the code of demoDllCaller.exe: #include <Windows.h> int main () { HMODULE lib = LoadLibrary (L"callPutchar.dll"); if (lib != nullptr) { typedef int __declspec(cdecl) (*main1_t) (); main1_t main1 = (main1_t) GetProcAddress (lib, "main"); if (main1 != nullptr) { int result = (* main1) (); result = result; } } } I'm on Windows 8.1 using Visual Studio 2012 and 2013 (crash happens with both). I compiled llvm...

...instance there is no such thing as O0/O1/O2 on OS X. > > > $clang -emit-llvm -c main.c -o main.bc > $clang -emit-llvm -c a.c -o a.bc > $llvm-ar cr main.lib main.bc > $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 > 00000000...

Hi In the generated .ll file, it may have something like this. How does LLVM know where to look for the definition of printf? Is it documented somewhere? Thanks. declare i32 @printf(i8*, ...) #1 -- Regards, Peng

...estimate*Kconst(d=nrow(target), n=ncol(target), bw) } ################################################################ kernel.estimate = function(points, bw) { tree = addNode(newtree(), points) print(date()) evaluate(points, tree, bw) } main1 = function(n, d) { bw = 1.4794953 - 1/(d+2)*log(n) x = rnorm(n*d); dim(x) = c(d, n) result = kernel.estimate(x, exp(bw)) hist(result) } print(date()) print(system.time(main1(1000*4,2))) print(date()) . ---------...

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

...sh` as below. ~~~ #!/usr/bin/env bash # vim: set noexpandtab tabstop=2: while read -r run do ./script.sh done < <(seq 10) ~~~ The `script.sh` can be called only once, say ~~~ $ ./main.sh Tue Oct 18 12:26:05 CDT 2016 ~~~ But 10 runs are expected. If I modify the stdin when calling, like `main1.sh` as below. ~~~ #!/usr/bin/env bash # vim: set noexpandtab tabstop=2: while read -r run do ./script.sh < /dev/null done < <(seq 10) ~~~ It will return the right 10 calling. ~~~ $ ./main1.sh Tue Oct 18 12:28:24 CDT 2016 Tue Oct 18 12:28:24 CDT 2016 Tue Oct 18 12:28:25 CDT 2016 Tue Oct...

...2 ##- Mother 3 671.7 3112.6 265.9 4.1282 0.01142 * ##- Litter:Mother 9 824.1 3264.9 256.8 1.6881 0.12005 ##- --- ##- Signif. codes: 0 `***' 0.001 `**' 0.01 `*' 0.05 `.' 0.1 ` ' 1 ##- the interaction is not signifikant, Litter is NOT! signifikant. gen.main1 <- aov(Wt ~ Litter + Mother, data = genotype) drop1(gen.main1, scope = .~., test = "F") ##- Wt ~ Litter + Mother ##- Df Sum of Sq RSS AIC F value Pr(F) ##- <none> 3264.9 256.8 ##- Litter 3 63.6 3328.5 252.0 0.3508 0.78870...

...ck glance at the code suggests that it could be changed to expect a >fixed 7 digit access code. It would be easy enough just to cut the first seven digits off the number and run it through a comparison pass, and not use the authentication routines at all. ; ; for North American numbers... ; [main1] ; ; Take any number, and give it to the DISA. The DISA ; just then takes anything typed in within the (unchangeable) ; timer values, and hands it off to main2 to be post-processed. ; I include the standard i,h,t values for pedantic reasons. ; exten => _X.,1,DISA(no-password,main2) exten =&gt...

...OS X. >> >> >> >> >> $clang -emit-llvm -c main.c -o main.bc >> $clang -emit-llvm -c a.c -o a.bc >> $llvm-ar cr main.lib main.bc >> $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 >&g...

.../toolchain/llvm 34361f192e41ed6e4e8f9aca80a4ea7e9856f327) (based on LLVM 6.0.2svn) - android-ndk-r17) #1 SMP PREEMPT Mon Jun 4 00:27:14 PDT 2018 [ 0.000000] Machine: Qualcomm MSM 8974 HAMMERHEAD (Flattened Device Tree), model: LGE MSM 8974 HAMMERHEAD exp at exp:~$ exp at exp:~$ exp at exp:~$ cat main1/main1_dmesg.txt | grep "clang\|Machine" [ 0.000000] Linux version 3.4.113-unicornblood-hammerhead-o+ (exp at exp) (Flash clang version 7.0.332826 (https://git.llvm.org/git/clang 4029c7ddda99ecbfa144f0afec44a192c442b6e5) (https://git.llvm.org/git/llvm 1181c40e0e24e0cca32e2609686db1f1415...