similar to: [LLVMdev] Compiling with Intel c++ 8.0

On Wed, 8 Dec 2004, [iso-8859-1] Bj�rn Wennberg wrote: > I am attempting to compile the llvm distribution with the Intel Compiler 8.0 > on linux and I have some minor patches I would like to apply. In our project > we compile and run the code both on win32, together with Morten Ofstad using > the MS compiler, and on linux using the intel compiler. Great! I'm going to leave the

Chris, include/llvm/ADT/HashExtras.h I did some more testing on this topic: ICC complained that the last template was partially loaded and would be used to instantiate the template<> struct hash<const char *>. Rearranging the templates so that one for arbritraty pointers (inlined) comes first, works excellent for icc. E.g.: template <class T> struct hash<T *> { inline

I am trying to upgrade my code to use the latest version of llvm from svn. Whenever I include "llvm/ADT/HashExtras.h", I get error messages like the following. Does anyone know what is going on? Thanks for any help. llvm[1]: Compiling Aux.cpp for Debug build (PIC) In file included from /home/lefever/work/memrep/src/compiler/include/Aux.h:4, from Aux.cpp:1:

So, after digging around in the old llvm/ADT/hash_map, I think I discovered the problem. Now, if you want to include llvm/ADT/HashExtras.h, you have to include the hash_map h file from your system (ext/hash_map in my case) and define HASH_NAMESPACE, before you include llvm/ADT/HashExtras. It might be good to include some documentation about that for those using HashExtras. Regards, Ryan

I have spent some time examining the llvm code now, and it seems most of the hash_maps are keyed with pointers, and a few with ints. There is also one place where the keys are std::string. All these are unproblematic with the Visual Studio std_ext::hash_map since it provides hash_value functions for all these types (note, it hashes char * as pointers, not as strings - but char * is not used

Hy! I would like to know how run a montecarlo simulation with R. Thank you!!!! Francesca Matalucci __________________________________________________________________ Accesso Internet Gratis per utenti Excite! Attivalo subito! http://www.excite.it/hitech/accesso Il Mio Excite. Personalizza la tua Home page Excite come vuoi tu! http://www.excite.it AAA/Relazioni. Sfoglia gli annunci e trova la

Hi all, I am trying to solve a tiny problem that is trivial to solve using dummynet (FreeBSD). I just want to add a delay of 50ms to each outgoing packet from an interface. This is to simulate a large pool of multiple modem users so I also need to add b/w limits etc (which seems to be easy to do). From the mailing list I could fine 2 qdiscs that can simulate latency : "delay" &

Hello, I see that this question was asked back in 2011: https://lists.samba.org/archive/samba-technical/2011-January/075519.html Has the status of this changed? Is it now possible to log all LDAP queries sent to a Samba DC? This would be an extremely useful feature! Thanks, Andrew Martin

Hello, I have just downloaded the source from CVS. Does exist a LLVM Java front-end? If yes, where can I find documentations about it? If no, is anyway somebody working on it? Where can I find the source code related? Thanks, Alessandro

Hello, Has anyone wrote a how-to or a guick guide on how to encrypt an existing partition/disk using gbde? I've tried to search in the net but i cudn't find any. Is it possible to just move the existing data on my disk, cleanup the disk and encrypt using gbde, attach to the system, then move back the data to the now encrypted disk. Thanks, - ronnel

I am a rank newb at this and I appologize, I would have dumped MS long ago but I am not any kind of a coder, so having to write scripts and such is out for me. I really want to dump everything microsoft.....but I have to be able to run Adobe Photoshop 7 and CS4......why do I keep PS7...because I can't get a lot of the plug-ins I use for any thing above 7 and a lot of the ones I can I have to

i want to estimate parameters with maximum likelihood method with contraints (contant numbers). for example sum(Ai)=0 and sum(Bi)=0 i have done it without the constraints but i realised that i have to use the contraints. Without constraints(just a part-not complete): skellamreg_LL=function(parameters,z,design) { n=length(z); mu=parameters[1]; H=parameters[2]; Apar=parameters[3:10];

I have a 3 nic setup with shorewall 1.4.8-1 running on redhat 9. My eth2 (dmz zone)has 7 secondary address attached to it. I can ping a machine in each subnet, dmz to net rules seem to be working fine on all machines.. I have my policy set as dmz to dmz accept. If I try to ping between subnets I get Nov 21 12:18:45 kbeewall kernel: Shorewall:FORWARD:REJECT:IN=eth2 OUT=eth2 SRC=172.17.0.2

Dear R users, I'm trying to write a function which returns minimum,maximum,mean of a vector(power) I've done the following : VAR<-function(power,length){ for(i in tml:length)){ tvar[i]<-i pmean[i]<-mean(power[i:i+deltat]) pmin[i]<-min(power[i:i+deltat]) pmax[i]<-max(power[i:i+deltat]) varmax[i]<-100*(pmax[i]-pmean[i])/pmean[i]

I've noticed that LLVM does a bad job of optimizing array indexing code for FORTRAN arrays declared using the ALLOCATABLE keyword. For example if you have something like the following: DOUBLE PRECISION,ALLOCATABLE,DIMENSION(:,:,:,:) :: QAV ... ALLOCATE( QAV( -2:IMAX+2,-2:JMAX+2,-2:KMAX+2,ND) ) ... DO L = 1, 5 DO K = K1, K2 DO J = J1, J2 DO I = I1, I2 II = I +

Hi, Given a positive integer N, and a real number \lambda such that 0 < \lambda < 1, I would like to generate an N by N stochastic matrix (a matrix with all the rows summing to 1), such that it has the second largest eigenvalue equal to \lambda (Note: the dominant eigenvalue of a stochastic matrix is 1). I don't care what the other eigenvalues are. The second eigenvalue is

Hi All, I have been reading about general purpose GPU (graphical processing units) computing for computational statistics. I know very little about this, but I read that GPUs currently cannot handle double-precision floating points and also that they are not necessarily IEEE compliant. However, I am not sure what the practical impact of this limitation is likely to be on computational

mcsi lida.. http://megajavn.blogspot.com/ http://megajavn.blogspot.com/2008/03/dna.html http://megajavn.blogspot.com/2008/03/structure-of-double-stranded-dna.h tml --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To post to this group, send email to

I am currently running stable, CVS-v1-0-05/25/05-12:07:15, with Polycom SIP phones, running 1.4.1. Too many of our transfers using the Transfer end up with zombie channels after a REFER. As such, I implemented # transfers, and all is well. Sort of. I have a reproducible issue. Take a call from a queue. Press #, and it'll transfer just fine. Now, take a call from the queue. Put them on

On Apr 25, 2006, at 8:56 AM, John Criswell wrote: > Ryan M. Lefever wrote: >> I am trying to use LLVM as a source to source C compiler. I use >> llvm-gcc to convert file.c->file.bc. Then I use opt to run my own >> compiler passes to convert file.bc->file.opt.bc. Then I use llc >> to convert file.opt.bc->file.opt.c. Now, I want to use normal gcc