search for: alexandra

...ly find functions corresponding to memset, memcpy and memmove intrinsics, not for prefetching. Also, I target x86-64 architectures. Is it sufficient to insert a call to the intrinsic in the LLVM IR to have the corresponding prefetch instruction generated for this target? Thank you for your help, Alexandra -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20130410/c79950b2/attachment.html>

Alexandra, I'm not sure what you mean by "replace", but I have code that does this to insert prefetches: Type *I8Ptr = Type::getInt8PtrTy((*I)->getContext(), PtrAddrSpace); Value *PrefPtrValue = ... IRBuilder<> Builder(MemI); Module *M = (*I)->getParent()-...

...s. In case it is not, the instrumentation code will detect this at runtime and simply roll back to the original version. I will always keep an original version available, in addition to the ones I modify with Polly. However, initially I will speculate that it is allocated contiguously. Thanks, Alexandra ________________________________ From: Renato Golin <rengolin at systemcall.org> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: Tobias Grosser <tobias at grosser.es>; llvmdev at cs.uiuc.edu Sent: Tue, July 19, 2011 11:39:02 AM Subject: Re: [LLVMdev] speculative paralle...

People, I'm a ubunto user and I used to write my scipts in "Java Gui for R", but it is a very slow tool to run my scripts... Do you know some efficient IDE for R? Thankssss!!! Alexandra Almeida -- Alexandra R M de Almeida [[alternative HTML version deleted]]

...obtain: %arrayidx = getelementptr inbounds [200 x i32]* @main.A, i32 0, i64 %idxprom   -->  ((4 * (sext i32 (-10 + (2 * %tmp6) + %tmp7) to i64)) + @main.A)         Could you please offer an insight on how can I obtain the function from the internals of the scalar evolution pass?  Thank you. Alexandra -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110727/32415f41/attachment.html>

...g for an alignment higher than the default    - one approach is to set a higher alignment for each allocated variable of type i1 or i8, but this means digging inside the arrays, vectors and structures to check the type of each element.   Looking forward to receiving your suggestions. Thank you, Alexandra -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20121122/1050dd27/attachment.html>

Only because in my next passes I change the CFG significantly and it is very hard to maintain the values of the Phi nodes. Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: W...

Hi Alexandra, I'm not sure want you want to do. Is the data layout string (http://llvm.org/docs/LangRef.html#datalayout, also usually set by each target specific *TargetMachine constructor), for setting the alignment good enough for you? Or is it more than the alignment you want to control? Do you have a...

...ation on the optimized code to check its correctness. Is this approach going to work with Polly? Or can I generate optimized code versions with Polly in a different manner when there are pointers and indirect references inside the code? Thanks again and good luck with all your work on Polly! Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: llvmdev at cs.uiuc.edu; Jimborean Alexandra <xinfinity_a at yahoo.com> Sent: Tue, July 19, 2011 10:19:54 AM Subject: Re: [LLVMdev] speculative parallelization in LLVM On 07/18/2011 07:03 PM, Jimborean Al...

...eg2mem pass (or any other that would eliminate the phi nodes) before calling my own passes. So probably we are going to run the scalar evolution on the code containing the phi nodes, run reg2mem and try to identify the original variables in the new code built after reg2mem. Thanks for your advice, Alexandra ________________________________ From: Tobias Grosser <tobias at grosser.es> To: Jimborean Alexandra <xinfinity_a at yahoo.com> Cc: "llvmdev at cs.uiuc.edu" <llvmdev at cs.uiuc.edu>; "luismastrangelo at gmail.com" <luismastrangelo at gmail.com> Sent: W...

...lt;-b } Mi problem is that with this loop I can see the output of the loop but I canot get the matrix (mymat) that contains the full output of the loop. Please, somebody know how can I create a matrix that contains the output of the loop with a dimension NTx1 (450x1). Thanks a lot for your help. Alexandra [[alternative HTML version deleted]]

...{ RSS[,i]<-(t(RY[,i])%*%RY[,i])-(saM[i,]%*%(t(RX)%*%RX)%*%t(saM)[,i]) SYY[,i]<-sum((RY[,i]-mean(RY[,i]))^2) r2m[i,]<-1-(RSS[,i]/SYY[,i])*((nrow(RY))/(nrow(RY)-ncol(saM)-1)) } dimnames(r2m)<-list(colnames(Y),c("R-square")) return(r2m) } Thanks! Alexandra Alexandra R. Mendes de Almeida --------------------------------- [[alternative HTML version deleted]]

On 19 July 2011 10:12, Jimborean Alexandra <xinfinity_a at yahoo.com> wrote: > %curr_array = alloca [10 x %struct.linked], align 8 > > while.. >  %tmp16 = getelementptr inbounds [10 x %struct.linked]* %curr_array, i32 0, > i32 1 Hi Alexandra, Can you guarantee that the linked list will be allocated in contiguous memor...

Hello, I''m Alexandra Well, i have been working with cbq around 3 month ago without any problems, what i do is control the bandwith to 64Kbit for input and output and it works well. But now I don''t want control the Bandwith, i only need prioritize udp trafic over tcp trafic Can somebody to help me with my re...

...1621,1716754.85,1621736.71,1631089.63,1641090.36,2620765.11,2383375.75,1294499.03,1326391.79,2443147.47,2404299.33,2090743.45,1997445.59,2118693.45 SCRIPT: ********* temp<-read.table("the csv adress",header=T,row.names=1,sep=",",dec=".") Thank's Alexandra Almeida Alexandra R. Mendes de Almeida --------------------------------- Internet r佱pida e gr佱tis. Instale o discador agora! [[alternative HTML version deleted]]

...ntptr? declare void @myFunction ( i64 ) %tmp22 = getelementptr inbounds %struct.linked* %tmp21, i32 0, i32 1 %tmp = convert_tmp22_to_i64_to_get_the_value_of_the_pointer call void @myFunction(i64 %tmp) Or could you suggest a better method to get the value computed by getelementptr ? Thanks, Alexandra -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110720/e2f43389/attachment.html>

...be reused? Is there a pass that I can call to do all these code transformations? I had a look at the CodeGeneration from Polly. Is it possible to use it without creating the Scops, by transforming it into a LoopPass? Could you indicate how is this handled in llvm-gcc? Thank you for your help. Alexandra. -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110908/a29ab04f/attachment.html>

...c word. Let make an example: This tis the array: words.array<-c("RedBall","PinkBall","YellowTable","BlueBall") And I would like to know the positions its (words.array) that have the word "Ball". Someone knows how I cand do this!? Thanks Alexandra Almeida Alexandra R. Mendes de Almeida --------------------------------- Imposto de Renda 2006: o prazo está acabando. Faça já a sua declaração no site da Receita Federal. [[alternative HTML version deleted]]

...uniform distribution bounded by (-1) and (1) that has a correlation of 0.6 between them. Does somebody know how I can do it? For normal random variables I known how to implement it with the rmvnorm command but I don't know how to do it with variables uniformly distributed. Thanks a lot. Alexandra [[alternative HTML version deleted]]

On 07/27/2011 03:11 PM, Jimborean Alexandra wrote: > Hello, > > How can I compute the functions on the loop iterators used as array > indices? > > For example: > > for i = 0, N > for j = 0, M > A[2*i + j - 10] = ... > > Can I obtain that this instruction A[2*i + j - 10]= .. always accesses > memory usin...