search for: wimmer

...ing. If you are > interested (after your first rounds of refactoring), please consider > a replacement for LiveInterval that keeps more accurate info that can > be plugged into the same existing allocator. The next step is to do > away with the r2rmap and rep(). While implementing Wimmer's linear scan, which is heavily based on splitting of live intervals, I already extended LiveInterval to contain more detailed info about all def-use occurrences. I also implemented the functionality for splitting a live interval at any place. Additionally, the logic for selecting an "opti...

...k.org server unreachable and icecast creates lot of children's proccesses, whitch stay sleeping and never ending. In this moment I have 270 instances of icecast server on the system and about 40 listeners. Regards, ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Milos Wimmer Internet Services Specialist e-mail: wimmer@zcu.cz Laboratory for Computer Science University of West Bohemia phone : +420 377 632 843 Univerzitni 8, 306 14 Plzen fax : +420 377 421 419 Czech Republic, Europe WWW : http://www.zcu.cz/~wimmer/ ~~~~~~~~~~~~~~~~~~~...

...Fehler: Laden von Paket oder Namensraum f?r 'Rcmdr' fehlgeschlagen Ich bin ziemlich angefressen. Folgende erfolglose Versuche: - R neu installiert - x11 neu installiert - alle Ordner dabei gel?scht - Pakete neu installiert Nichts. Rcmdr will nicht mehr.? -- Beste Gr??e, Yours, Bastian Wimmer M.A. Research Associate at the Chair of Educational?Psychology University of Erlangen-Nuremberg Dutzendteichstra?e 24 90478 Nuremberg Germany Phone: +49 (0) 9171 83924 84 Fax: +49 (0) 3222 64968 14 Email: bastian.wimmer at fau.de Web: http://j.mp/Umkf4U (Chair of?educational Psychology)

...nges at any program point. Actually, Sarkar's algorithm can split only at block boundaries, as far as I understand. This can be an obstacle for very long basic blocks. One of the interesting ideas could be to introduce live-range splitting into his algorithm. BTW, since I was also working on Wimmer's linear scan algorithm (which is sort of implemented, works on simple test-cases and requires a lot of code clean-up and refactoring), I also have the LiveInterval splitting code in place and it can be done at any program point. > We have the code implemented in LLVM 2.1, and it passes al...

Greetings! I'm currently gathering information that helps software in assessing the user's context. One very important such data would be the application that the user is currently working with which mostly is roughly equivalent to the name of the window that has the focus. Unfortunately I'm at a loss even about which API to ask for this information. As personally I am using compiz as

...s debugger is in Java, > or? So, one has to dump the results of register allocation and input > problem and it would do some checks, or? It is implemented in Java. You must dump some output and run the debugger on this output. > Actually, I already implemented something very similar for Wimmer's > linear scan. The main issue was to order the copies in the right way > and to introduce stores/loads to handle circular dependencies. Or do > you say that register classes of different sizes introduce additional > problems? Well, it makes it a little bit more complicated, but o...

On Apr 17, 2007, at 2:24 PM, Chris Lattner wrote: > On Tue, 17 Apr 2007, David Greene wrote: >> Evan Cheng wrote: >>> Obviously, smart heuristics can make a big difference here >>> (estimated >>> register pressures, etc.) But the more important thing is how the >>> passes down stream can recover from the earlier mistakes. By >>> this, we

...all cases I run only one capture client - ices - I tried it on two different boxes with SB Live (resp. Audigy) sound card with same results. <p>Does somebody have any idea? Thank you, Milos ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ Milos Wimmer Internet Services Specialist e-mail: wimmer@zcu.cz Laboratory for Computer Science University of West Bohemia phone : +420 377 632 843 Univerzitni 8, 306 14 Plzen fax : +420 377 421 419 Czech Republic, Europe WWW : http://www.zcu.cz/~wimmer/ ~~~~~~~~~~~~~~~~~~~...

On Tue, 17 Apr 2007, David Greene wrote: > Evan Cheng wrote: >> Obviously, smart heuristics can make a big difference here (estimated >> register pressures, etc.) But the more important thing is how the >> passes down stream can recover from the earlier mistakes. By this, we >> mean live range splitting and re-materialization. > > Can you explain this a little

On Wed, 21 Jan 2004, Karl Heyes wrote: Hello, I found this old message in the archive: > this is because it's an ogg stream, the mechanism above is the way to > insert song title updates for mp3. Either insert New+Metadata at ices > (won't work when using a playlist) or use my icecast -kh22 from > www.xiph.org/~karl which has the URL code for it in. is here any reason,

...> what would be very restrictive in x86, or you do backtracking, as the > current implementation of LLVM's linear scan does. Backtracking may > slowdown the implementation quite a bit. Agree. But it is not neccessary. The way how move instructions are inserted is very similar to Wimmer's linear scan algorithm. There is no need for any reservation of registers in advance or for any backtracking. >I believe that the other factors will not cause too much slowdown. Well, from my experience with the Wimmer's linear scan, book-keeping during the linear scan allocation be...

Hi, Roman, we have an implementation of an allocator for LLVM that, like Sarkar's, allows to split live ranges at any program point. You can find its description here: http://compilers.cs.ucla.edu/fernando/publications/drafts/long_PereiraPalsberg07.pdf We handle register classes using an abstraction called puzzles. Also, we perform register allocation while the program is still in

...arvard.edu/~nr/pubs/gcra-abstract.html There exists also an implementation of the algorithm described in the paper for the SUIF compiler suite. I was planning to port it to LLVM, but a bit later. At the moment I'm working on the implementation of a linear scan register allocator based on the Wimmer's paper "Linear Scan Register Allocation for the Java HotSpot Client Compiler": http://www.ssw.uni-linz.ac.at/Research/Papers/Wimmer04Master/ This is a rather optimized version of a linear scan which is really used in Sun's HotSpot JVM. The difference of this version of the line...

Hi David, --- David Greene <dag at cray.com> schrieb: > On Thursday 31 January 2008 07:05, Roman Levenstein wrote: > > > I already started work on the implementation of this algorithm and > have > > a few hopefully rather simple questions: > > Roman, > > I'm excited to hear that you are working on this algorithm. Do you > plan to contribute it

On Mon, 2005-09-19 at 20:58, Milos Wimmer wrote: > I send 2 streams from machine "A" to icecast server: > "cro-region-256.ogg" (224 kb/s stream) > "cro-region.ogg" (128 kb/s stream) > > and 1 backup stream from machine "B" to same icecast server: > "z-cro-reg...

Thanks to everyone who has been helping us test... your input is certainly appreciated. We've fixed a few bugs and are release RC3 as of now. Here's what was fixed : - log username to access log (bug #706) if available. - fix segv case on listmounts/moveclients when a fallback to file stream is running - Patch from martin@matuska.org: don't treat all clients as duplicates. Links

On 4/3/07, David Greene <greened at obbligato.org> wrote: > > I'm just starting to dive into llvm, hoping to implement a > good graph coloring register allocator. I gather that this > has been discussed before. > > What is the RegAllocGraphColoring.cpp currently in the > sources? It seems to be the Fred Chow algorithm but > it's not mentioned in the

...tting. It would quickly use all > available registers and then get stuck, using only a single register > (and the stack, a lot!) for hundreds or thousands of instructions at > a time, greatly slowing (+bloating) the code. True. I'm working on the version of the linear scan based on Wimmer's thesis. It supports live range splitting. I'd like to compare it with yours. Do you have any good examples of those fairly large functions that are just flat sequences of instructions, anywhere from 100 to 10000+ in size??? It would be nice, if you could send me those test cases (as C or...

I'm just starting to dive into llvm, hoping to implement a good graph coloring register allocator. I gather that this has been discussed before. What is the RegAllocGraphColoring.cpp currently in the sources? It seems to be the Fred Chow algorithm but it's not mentioned in the documentation anywhere. Does it work? -Dave

...Hosking, Purdue University, USA Doug Lea, SUNY Oswego, USA Eliot Moss, University of Massachusetts, USA Nate Nystrom, University of Lugano, Switzerland Tiark Rompf, Purdue University, USA Jennifer B. Sartor, Vrije Universiteit Brussel, Belgium JeremyJan Vitek, Northeastern University, USA Christian Wimmer, Oracle Labs, USA Jianjun Zhao, Kyushu University, Japan ======== Location ======== Linz, the capital of Upper Austria, is both a city of culture and of industry. Located at the Danube it features a historic downtown and a modern university campus just north of the Danube, where the conference wi...