search for: lup

Does someone know the rules by which 'coxph' returns 'frail', the predicted frailty terms? In my test function: ----------------------------------------------- fr <- function(){ #testing(frailty terms in 'survival' require(survival) dat <- data.frame(exit = 1:6, event = rep(1, 6), x = rep(c(0, 1), 3),

On Dec 28, 2010, at 9:39 AM, Lup Gratian wrote: > I recently downloaded LLVM 2.8 and started playing with the optimizations a bit. > I saw something curious while trying the following function: > > int g(unsigned int a) { > unsigned int c[100]; > c[10] = a; > c[11] = a; > unsigned int b = c[10] + c[1...

On Dec 28, 2010, at 12:48 PM, Chris Lattner wrote: > On Dec 28, 2010, at 9:39 AM, Lup Gratian wrote: >> I find it strange that it hasn't found that %add and %mul have the same value, %cmp would be then false, selecting and returning 15. If 'a' is replaced by a constant it works. > > You're right, that is a missed optimization. I added it to the missed o...

Hi, I have a server and ten clients in a Gigabit network. The server has 125mbps network bandwidth. I want that the server has 40Mbps bandwidth reserved for client 1 (IP 192.168.5.141), and the rest bandwidth is for all other clients. My script looks like this (I use IFB for incoming traffic): #!/bin/bash export TC="/sbin/tc" $TC qdisc add dev ifb0 root handle 1: htb default 30

I recently downloaded LLVM 2.8 and started playing with the optimizations a bit. I saw something curious while trying the following function: int g(unsigned int a) { unsigned int c[100]; c[10] = a; c[11] = a; unsigned int b = c[10] + c[11]; if(b > a*2) a = 4; else a = 8; return a + 7; } The generated code, with -O3 activated, is define i32 @g(i32 a) nounwind readnone { %add = shl i32

...the Campaign area to show up. However, I'm not having much luck. I've been trying to follow along this bug: http://bugs.winehq.org/show_bug.cgi?id=2075 Has anyone gotten this to work, with the latest WineCVS, and if so, can you throw a quick little step-by-step my way? Thanks so much, -Lup

...nd uses this information to constraint the value range of v a bit more. My work is not part of the LLVM mainline yet. But I would be happy to contribute with the code of my range analysis implementation if it can help you in something else. Best, Douglas On Sun, Feb 20, 2011 at 2:30 PM, Gratian Lup <lgratian at gmail.com> wrote: > Hi! > I'm a student who would like to participate on Google SOC for LLVM, and was > thinking about what project to pick. I saw on the "Open projects" page that > Value Range Propagation is not implemented and thought about doing it,...

Hi! I'm a student who would like to participate on Google SOC for LLVM, and was thinking about what project to pick. I saw on the "Open projects" page that Value Range Propagation is not implemented and thought about doing it, based on a paper by Patterson (it's also used by GCC). But then I saw that last year someone did a Range Analysis pass that seems to do pretty much the

...(and as a proper configuration allows all types of connections anyways) it was not my goal to test direct connections now. Now comes the problem: If I try to send a broadcast message over the vpn (e.g. echo hello | socat - UDP-DATAGRAM:192.168.77.255:5000,broadcast while all machines do nc -lup 5000) from client A, only the server and client A itself get this message. I started the game and tried to search/connect client A with B but wireshark told me that there are no incoming messages from the other client during the search, only outgoing DirectPlay messages. So my guess is the se...

Hi, I don't understand why a SIP hardphone can't provision itself using tftp. I'm very suspicious about my tftp daemon but I lack basic knowledge of Linux CLI to pinpoint what's going wrong and separate what belongs to SIP phone configuration from what comes from tftp server. What I would like to do is to add a given file in current /srv/tftp directory and test by hand that tftpd

...p_diactionformatA dwHow=0x0 fixme:dinput:_dump_diactionformatA diaf.rgoAction[8]: fixme:dinput:_dump_diactionformatA uAppData=0x8 fixme:dinput:_dump_diactionformatA dwSemantic=0x09004601 fixme:dinput:_dump_diactionformatA dwFlags=0x0 fixme:dinput:_dump_diactionformatA szActionName="D-Pad (LUP/DOWN/LEFT/RIGHT)" fixme:dinput:_dump_diactionformatA guidInstance={00000000-0000-0000-0000-000000000000} fixme:dinput:_dump_diactionformatA dwObjID=0x0 fixme:dinput:_dump_diactionformatA dwHow=0x0 fixme:dinput:_dump_diactionformatA diaf.rgoAction[9]: fixme:dinput:_dump_diactionformatA uApp...

...p_diactionformatA dwHow=0x0 fixme:dinput:_dump_diactionformatA diaf.rgoAction[8]: fixme:dinput:_dump_diactionformatA uAppData=0x8 fixme:dinput:_dump_diactionformatA dwSemantic=0x09004601 fixme:dinput:_dump_diactionformatA dwFlags=0x0 fixme:dinput:_dump_diactionformatA szActionName="D-Pad (LUP/DOWN/LEFT/RIGHT)" fixme:dinput:_dump_diactionformatA guidInstance={00000000-0000-0000-0000-000000000000} fixme:dinput:_dump_diactionformatA dwObjID=0x0 fixme:dinput:_dump_diactionformatA dwHow=0x0 fixme:dinput:_dump_diactionformatA diaf.rgoAction[9]: fixme:dinput:_dump_diactionformatA uApp...

Hi! I'm interested in profile-guided optimizations and was looking at the functionality LLVM provides. I have two questions: - can the current (optimal) edge profiling be used to determine the number of times a function calls another one? I need to know not only how many times a function was called, but also by whom. Or to say in in a different way, can a profile edge be formed from blocks

Hi! My name is Gratian and I would like to participate to GSOC 2011. I'm interested in profile-guided optimizations, and I want to implement two optimizations that can bring tangible benefits for most applications: profile-guided function inlining and basic block positioning. Inlining can be greatly improved if we take into consideration how many times the function we want to inline was

1. Summary I will implement two optimizations in the LLVM compiler, both based on runtime profile information: an inlining mechanism that takes the call frequency into consideration, and a better basic block placement algorithm. 2. The project LLVM now includes an efficient framework [1] for instrumenting an application and collecting edge and path profile information. Profile-guided