similar to: [LLVMdev] LLVMdev Digest, Vol 113, Issue 21

Why is there no facility to add 2 APInts with different bit widths? Everytime i do an operation on APInts i need to manually check and adjust their bitwidths. Is there no other better way to do it? -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20131108/38e80e69/attachment.html>

Hi, We recently found a testcase showing that simplifications in instcombine sometimes change the instruction without reducing the instruction cost, but causing problems in TwoAddressInstruction pass. And it looks like the problem is generic and other simplification may have the same issue. I want to get some ideas about what is the best way to fix such kind of problem. The testcase:

So, I've spent some considerable time cleaning up and looking at the loop unrolling analysis that you started Michael, but I don't have time to look at it further so I'm writing down the current state and what I think should happen next. Currently, in tree, we have a reasonably clean framework now that visits each instruction for each iteration and tries to simplify it. Currently, the

There's some interest in my "auto-simplifier", which is nice :), so let me explain a bit about it. On 19/01/11 19:35, Sandeep Patel wrote: > You've mentioned your auto-simplifier a few times now and curiosity is > getting the better of me. Can you explain it a bit more? On 20/01/11 00:32, Nuno Lopes wrote: > Just out of curiosity, what's this auto-simplifier?

1) A table of contents is in "LIST." 2) The tree has had some simplification. 3) 2 directories have been added: "wget" and "Windows." These are put in to help in downloading. Corrections to false assertions and other mistakes would be greatly appreciated, as well as simplifications and improvements. ..........Al --- >8 ---- List archives:

On Wed, Aug 2, 2017 at 3:36 PM, Matthias Braun <mbraun at apple.com> wrote: > So to write this in a more condensed form, you have: > > %v0 = ... > %v1 = and %v0, 255 > %v2 = and %v1, 31 > use %v1 > use %v2 > > and transform this to > %v0 = ... > %v1 = and %v0, 255 > %v2 = and %v0, 31 > ... > > This is a classical problem with instruction

Hi, I'm fitting a glm to a dataset... > objects() [1] "pop.div.full" "speciation.data" ...and then performing model simplification to give a series of model objects all of which have a common suffix. > objects() [1] "pop.div.full" "pop.div.gp.f.b.hm" [3] "pop.div.gp.fb.hm"

Today, InstSimplify calls computeKnownBits to try to fold to a constant ONLY if it can't find any other simplifications for an instruction. I think this means if we are able to find an earlier simplification we are LESS aggressive about creating a constant because we won't even look at known bits. This seems surprising to me. Should we be looking at known bits always, or should we remove

Hi there, I'm beginner and would like to have mailing list archive to read it offline and don't disturb mailing list. I'd prefer mbox format. Regards, Oleg _____________________________________________________________ Oleg Bartunov, sci.researcher, hostmaster of AstroNet, Sternberg Astronomical Institute, Moscow University (Russia) Internet: oleg at sai.msu.su,

Hola, tengo unos datos clasificados en tres grupos y quiero representarlos en un cubo de forma que cada grupo tenga un color/ símbolo distinto. He conseguido hacerlo por colores (código) y me gustaría hacerlo variando el 'pch'. He intentado hacerlo del mismo modo pero no funciona. ¿Se puede hacer?¿Puede ayudarme alguien? Muchísimas gracias. Elvira. library(scatterplot3d) # dummy data

Hola. Algún paquete que calcule la potencia de un U-test? -- Antonio Maurandi [[alternative HTML version deleted]]

Eric, thanks for quick reply. at first look I thought it is what I need, but, unfortunately, it doesn't applied to original data - it creates new data with loosing original indexes ! I want to keep indexes of original data, but replace original data with $mids of corresponding $breaks. So, if I have z = 1:10, t=hist(z,plot=F) > z [1] 1 2 3 4 5 6 7 8 9 10 > t$breaks [1] 0 2

Hello LLVM, I am following the document "Writing an LLVM Pass". When I ran "opt -load ../../../Debug/lib/MyPass.so -mypass < hello.bc > /dev/null" I got the next error: ***@ubuntu:~/test$ opt -load ../../llvm/Debug/lib/MyPass.so -mypass < hello.bc > /dev/null opt: Pass.cpp:159: void<unnamed>::PassRegistrar::RegisterPass(const llvm::PassInfo&): Assertion

Hello, for testing & learning purposes I create X11 device and specify layout like layout(c(1,2,3), 3, 1), so I could play with parameters and see several plots at the same time. That works fine until I try to create 4-th plot - all other plots erased. Such behaviour isn't desirable for testing purposes and I'm asking where to look to disable erasing other plots. Regards, Oleg

Hola a todos. Un problema dos pasos. Quiero desde RStudio trabajar con dos versiones de R (pongamos R2.13 y R2.15) desde Linux, Ubuntu 10.04 (lucid). Ya tengo instalada la R.2.15.1. Por defecto trabajo con ella. Pasos que creo he de dar: 1º. Instalar dos versiones de R en la misma maquina. ¿Como se hace?. Me estoy metiendo con el PATH y tal... hay algún protocolo clarito por ahí? 2º.

Hello, is't possible to get excerptions of data frame using some contstraints, something like q1 = q[q$V3<1] ? Regards, Oleg _____________________________________________________________ Oleg Bartunov, sci.researcher, hostmaster of AstroNet, Sternberg Astronomical Institute, Moscow University (Russia) Internet: oleg at sai.msu.su, http://www.sai.msu.su/~megera/ phone:

Se podrá seguir el taller en la red a través de videoconferencia. Objetivos del Taller: La elaboración de gráficos de calidad y, en su caso, destinados a la publicación requiere una reflexión sobre los métodos, tipos y soluciones que pueden emplearse desde R. En este taller discutiremos los aspectos relacionados con los procedimientos para realizar gráficos de

Hello, I need to analyze dependencies in my llvm ir by using polly. i created a new pass called mypass there i added polly dependency analysis pass but when i execute this pass in gdb i get no data. Why is that so? My code is follows; namespace { struct mypass : public FunctionPass { static char ID; mypass() : FunctionPass(ID) { } virtual bool runOnFunction(Function &F) {

Can someone point me to some reasonable example / starting point to implement a basic IVR menu? Looking for something rather simple like the press 1 for sales, 2 for tech support, and probably an option to list the voicemail directory kind of thing. Nothing elaborate needed, just basic menu. (Yes, I did look at the wiki and google searched for "ivr menu".)

Hi, I'm writing a function pass which is dynamically loaded by opt and I need some analysis and passes to be run before my pass: virtual void getAnalysisUsage(AnalysisUsage &AU) const { AU.addRequired<LoopInfo>(); AU.addPreserved<LoopInfo>(); AU.addRequiredID(LoopSimplifyID); AU.addPreservedID(LoopSimplifyID);