similar to: [LLVMdev] really long time to compile

Displaying 20 results from an estimated 1200 matches similar to: "[LLVMdev] really long time to compile"

2007 Jun 20
2
Extracting t-tests on coefficients in lm
I am writing a resampling program for multiple regression using lm(). I resample the data 10,000 times, each time extracting the regression coefficients. At present I extract the individual regression coefficients using brg = lm(Newdv~Teach + Exam + Knowledge + Grade + Enroll) bcoef[i,] = brg$coef This works fine. But now I want to extract the t tests on these coefficients. I cannot
2007 Oct 03
2
Shading area under density curves
Hello, I have a question regarding shading regions under curves to display 95% confidence intervals. I generated bootstrap results for the slope and intercept of a simple linear regression model using the following code (borrowed from JJ Faraway 2005): > attach(allposs.nine.d) > x<-model.matrix(~log(d.dist,10))[,-1] > bcoef<-matrix(0,1000,2) > for(i in 1:1000){ +
2007 Apr 18
1
[Bridge] A question about modify bridge source
Hello, I just made some change of the bridge source which under kernel 2.4.20 ,to make it work automatically without any ioctl commands such as brctl .In this module I do ,it has only one br named BRIDGE which auto constructed in the module initiation ,and defined as a global variable "brg".And I add one eth card(eth0) to the br as a port .The main program is just below this page. But
2020 Mar 18
2
Re[2]: pointer to "spice" device by virNodeDeviceLookupByName
Thanks, clear! But may be is a method to get XML description for spice params, like it could be possible for physical devices?   >Среда, 18 марта 2020, 13:21 +03:00 от Daniel P. Berrangé <berrange@redhat.com>: >  >On Wed, Mar 18, 2020 at 01:10:41PM +0300, Андрей Фокин wrote: >> >> Is possible to get a pointer to «spice» by virNodeDeviceLookupByName API? >> What
2006 Aug 18
1
using R to perform a word count - syntax refinement and incorrect number of dimensions error
Hello, I am hoping someone can advise me regarding an error message I received and if needed, refine some syntax. I am wanting to calculate the word count for each row of a dataframe. Below, I have 3 variables ("V3.PD", "V3.HD", "V3.LP") which I want to obtain a word count for, by each row which contains these variables. Any assistance is much appreciated, Bob
2004 Oct 11
3
[LLVMdev] [anilcjohn@sify.com: CS student from India]
----- Forwarded message from ANIL C JOHN <anilcjohn at sify.com> ----- To: brg at dgate.org Subject: CS student from India Date: Mon, 11 Oct 2004 22:07:56 +0600 (IST) From: ANIL C JOHN <anilcjohn at sify.com> Dear Sir, I am a computer science undergrad student doing my 7th semester B.Tech in computer science (equivalent to BS). I want to do a project using LLVM compiler
2020 Feb 09
2
[RFC PATCH] Add SHA1 support
From: Sebastian Andrzej Siewior <sebastian at breakpoint.cc> This is a huge all-in-one patch and deserves a little cleanup and splitting. However, I wanted to get it out here for some feedback. My primar motivation to use SHA1 for checksumming (by default) instead of MD5 is not the additional security bits but performance. On a decent x86 box the SHA1 performance is almost the same as
2004 Jun 23
3
[LLVMdev] IRC: Discussion About Upgrades To Bugzilla
I thought this conversation was worth saving. DannyB who did wonderful things with GCC's use of bugzilla has offered the same capability to LLVM. Thanks, Danny! <DannyB> sabre: BTW, if you need any of the bugzilla fun i have implemented for gcc, let me know [22:47] <sabre> Cool, what kinds of things do you have? [22:47] <DannyB> Besides the triplet stuff, i changed some of
2004 Oct 11
0
[LLVMdev] [anilcjohn@sify.com: CS student from India]
Anil, There are lots of interesting projects waiting in the wings. You should check Chris', Misha's, and my "developer pages". You can access all of them from here: http://llvm.cs.uiuc.edu/Developers.html by just clicking on the name. If any of these projects interest you, please let us know. Otherwise you can also find us on the IRC channel (irc.oftc.net#llvm) so we can
2003 Oct 29
1
[LLVMdev] cfrontend/src/configure
Hello Brian, Wednesday, October 29, 2003, 7:21:04 PM, you wrote: BRG> This anomaly is noted in the documentation for building the C front-end BRG> (http://llvm.cs.uiuc.edu/docs/CFEBuildInstrs.html); in step 4 it advises BRG> you to edit src/configure and "change the first line (starting w/ #!) to BRG> contain the correct full pathname of sh." I got the links to the proper
2003 Oct 28
2
[LLVMdev] cfrontend/src/configure
Hi all, subj has the first line: #! /usr/dcs/software/supported/bin/bash I think we could be more liberalistic :) best regards, --- Valery A.Khamenya
2004 Jun 19
0
[LLVMdev] benchmarking LLVM
On Sat, 19 Jun 2004, [koi8-r] "Valery A.Khamenya[koi8-r] " wrote: > i took a look into LLVM benchmarks from nightly tester and > ran Shootout tests on my own. Below go just few outlines. > > 1. results on my AMD AthlonXP and Xeon used by LLVM > team are different sometime. In particular, both Shootout > and Shootout-C++ show great speed up with LLVM (in >
2002 May 20
5
Limiting Citrix printing traffic, so ensure interactive sessions
LS, Spent a lot of this weekend reading about shaping and traffic control. The Howto is very extensive... :-) I hope to use this list to see if what I want is possible. The situation: - A central (big) Citrix cluster located in Frankfurt (all servers in one subnet) - The office in Rotterdam connected to Franfurt with a 2Mbit line - The office in Bergen (Norway) connected to *Rotterdam* with a
2010 Oct 19
2
[LLVMdev] Structure memory layout
Hi Renato, Firstly, I have been removing target specific information from struct type on bitcode. Target specific information are type size, type alignment, merged bitfields and so on. For example 1 struct test { 2 char a:3; 3 char b:4; 4 char c:3; 5 char d:2; 6 }; 7 8 struct test vm = {1, 2, 3, 1}; 9 10 int main(void) 11 { 12 int a; 13 vm.d = 1; 14 } Above
2009 Nov 14
2
[LLVMdev] Very slow performance of lli on x86
> > for -O3 results refer attachment. > time clang (-O0) llvm-gcc(-O0) gcc(-O0) > real 0m10.247s 0m11.324s 0m10.963s > user 0m2.644s 0m2.478s 0m2.263s
2004 Oct 05
0
[LLVMdev] Starting with LLVM-GCC on Cygwin
On Tue, 5 Oct 2004, Alex Vinokur wrote: > I would like to use LLVM-GCC to compare its performance with other compilers. > Something like testsuite "Computing very large Fibonacci numbers" at > http://article.gmane.org/gmane.comp.lang.c%2B%2B.perfometer/37. Out of curiousity, I ran some quick tests on a AMD Athlon(TM) MP 2100+ box running Redhat linux 7.1. With the LLVM C
2011 May 06
3
Rails 3 Routing problems
I have an UploadsController and UsersController where Users'' has_many :uploads'' via polymorphic attachment in uploads.rb. Now we i navigate to http://localhost:3000/users/1/uploads I get re-routed to Uploads#index and rendered is called multiple times as shown below: Started GET "/users/1/uploads" for 127.0.0.1 at 2011-05-06 22:00:38 +0100 Processing by
2011 Jul 29
2
'breackpoints' (package 'strucchange'): 2 blocking error messages when using for multiple regression model testing
Good morning to all, I am encountering a blocking issue when using the function 'breackpoints' from package 'strucchange'. *Context:* I use a data frame, 248 observations of 5 variables, no NA. I compute a linear model, as y~x1+...+x4 x4 is a dummy variable (0 or 1). I want to check this model for structural changes. *Process & issues:* *First, I used function Fstats.* It
2009 Nov 14
0
[LLVMdev] Very slow performance of lli on x86
He is probably using the interpreter on a debug build. Evan On Nov 14, 2009, at 1:40 PM, Eric Christopher <echristo at apple.com> wrote: >> >> for -O3 results refer attachment. >> time clang (- >> O0) llvm-gcc(-O0) >> gcc(-O0) >> real >> 0m10.247s
2011 Nov 02
0
[LLVMdev] RFC: Upcoming Build System Changes
Dear All, We have a new 32 core machine, so I ran some numbers. These results are for compiling all of LLVM and Clang in a Debug build from scratch. The first number is the -j argument to make, and the rest is the result of the bash builtin time command. 2: 1612.950u 161.293s 15:04.92 196.0% 0+0k 0+0io 0pf+0w 4: 1624.101u 164.121s 8:00.74 371.9% 0+0k 0+0io 0pf+0w 8: