search for: backtracks

Hi...I'm using BackTrack linux for a class I'm taking and using a program in wine that is just using all of my memory. Any ideas on how I can limit this program from using all of my memory. I'm on a mac running vmware fusion 4.0 and have backtrack 5r1 as a vm

Hi all! A quick question: I just moved from Windows over to Linux, using Backtrack 4, which is based off of Ubuntu if I am not mistaken. One of the programs that I really need to get running, www.magicworkstation.com , really needs one of the later (unstable) releases of WINE to work. Well, so I go to follow the instructions to get the updated version, using the Ubuntu instructions and I get a

On 4 Oct 2007, at 00:22, Evan Cheng wrote: >> ifeq ($(ARCH),x86) >> LLCBETAOPTION := -regalloc=local -fast -tail-call-opt -tail-call-opt- >> align-stack > Please remove -regalloc=local -fast. We want to test this patch > separately. just did a test with LLCBETAOPTION := -tail-call-opt -tail-call-opt-align-stack this time only SPASS llc-beta fails (comparing with vanilla

Why does Ruby-1.9.2-p0 require an additional ../ for relative paths when compared to the same code for ruby1.8? if RUBY_VERSION < ''1.9'' require File.dirname(__FILE__) + library else require_relative File.dirname(__FILE__) + ''/..'' + library end -- You received this message because you are subscribed to the Google Groups "Ruby on Rails: Core"

Hello LLVM Devs, I thought I'd weigh in on some of these non-backtracking linear time RegEx algorithms. If they're anything like the PackRat parsing algorithms they take at least 4x the amount of memory in terms of storage as the string length itself by not backtracking. That should be fine for small RegExes but it wouldn't do so well for more elaborate and long expressions. If

On Oct 2, 2007, at 2:27 AM, Arnold Schwaighofer wrote: > Hi all, > > I changed the code that checks whether a tail call is really > eligible for optimization so that it performs the check/fix in > SelectionDAGISel.cpp:BuildSelectionDAG() as suggest by Evan. Also > eliminated an error that caused the remaining failing test cases in > the test-suite. > > The

...wo static backwards slicing passes for LLVM. The first is a partial implementation I wrote for a course project. The code is in the giri project: svn co https://llvm.org/svn/llvm-project/giri/trunk giri The Giri code runs with an older version of LLVM and probably needs some TLC. It also only backtracks until it hits a load; additional code must be written to backtrack further to find potentially reaching stores. The second option is to use some code written by Jiri Slaby at https://github.com/jirislaby/LLVMSlicer. I believe his implementation is a complete static backwards slicer, but I have...

Hello Michael, Here is the BackTrace of the program which i forgot to attach BACKTRACE OF Asterisk -vvc #0 0x42074d60 in _int_realloc () from /lib/tls/libc.so.6 #1 0x420738c4 in realloc () from /lib/tls/libc.so.6 #2 0x47c7da89 in PAbstractArray::SetSize(int) () from /home/sip/pwlib/lib/libpt_linux_x86_r.so.1.5 #3 0x47c7cf4d in PContainer::SetMinSize(int) () from

Hello, I am curious to know if LLVM offers any passes to do interprocedural slicing, I need to eliminate most of the computations(possibly all, if they don't influence the control flow), but the control flow of the program should be maintained at all cost. I did see an optimization pass to print the CFG of a function without its body to a dot file, but I am interested in generating the

Hi all, Not sure if I''m the only one with this problem... We''re on edge for both rails and rspec, and i just did an update... Some apparently innocuous rails stuff was updated, and then half my specs broke due to an error in rspec_on_rails: ArgumentError in ''UserController without logged in user should show the index page'' wrong number of arguments (2

On Oct 4, 2007, at 2:31 PM, Arnold Schwaighofer wrote: > > On 4 Oct 2007, at 00:22, Evan Cheng wrote: >>> ifeq ($(ARCH),x86) >>> LLCBETAOPTION := -regalloc=local -fast -tail-call-opt -tail-call- >>> opt- >>> align-stack >> Please remove -regalloc=local -fast. We want to test this patch >> separately. > > just did a test with >

...tally agree with "we have to be able to uncoallesce them". Linear Scan already does a backtracking in some situations. I'm wondering, if it is very difficult to implement the logic, where when it detects that it runs for ever (i.e. nothing can be spilled for some reason) it basically backtracks completely, does coallescing again but ignoring some selected virtual/physical registers (or any attempts to coalesce with physregs) and tries to allocate the whole function again? Alternatively, may be it would be possible to rerun the linear-scan pass without interval joining on a given function...

HI, After I upgraded to RSpec 1.1.4 (from git), my stories all failed. I was using Webrat and the first thing I noticed was the ''visits'' method was gone. I then backtracked to just using ''get'' and got the same undefined method exception. I confirmed it was still working in 1.1.3 Eventually, I got it to work doing this: in my first Given: @app =

Hi Fernando, For some reason, I discovered your mail just today. Fernando Magno Quintao Pereira wrote: > > Hi, Roman, > >> Well, I cannot find anything about in my copy of the paper. The paper >> neither talk about splitting in the interior of basicc blocks, nor >> about handling of pre-colored registers. And Sarkar also does not claim >> the optimality of the

Chris Lattner wrote: > 3. Best: Find a "foreign function interface" library, and use that to > interface to native code. > This is the only option that's really usable, unfortunately, because I have no control over what code some potential user might want to model check. I was wondering whether there might be anything in the JIT support that could be reused for

A little more info on this: I backtracked deeper into this and it looks like excBuf is corrupted, which is corrupted by low_innov_alias being invalid. However it is not entirely clear where that gets initialized (in sb_celp it is set to out+st->frame_size) Tom

Hello, Yesterday I noticed that MSP430 argument passing is broken in trunk; see http://llvm.org/PR6573 for details and testcases. The problem is that calls aren't being preceded by instructions that put the arguments into registers. I backtracked my working copy and then stepped forward until it broke between r98937 and r98938. Refining further, I found that rolling back the

Hi, Dear LLVMers I just touch llvm source code for several days, and I didn't know the interfaces of the analysises and transformations of LLVM. For exampe, how to backtrace CFG, and whether exits a backtracking interator to do such work? For a novice, I also seek for suggestions about how to become familiar with LLVM interfaces as soon as possible. Now I have a plan to write a pass based on

Howdy. I have a application I'm developing where I need to encrypt the data inside an OGG stream. I will be using a regular block cypher (AES, or others... configurable); and I would like to encrypt the pages in an OGG stream. I'm thinking that if I sit my decrypter in between the reading application and the encrypted file, you should be able to use all the normal seeking

On Aug 23, 2009, at 9:01 PM, Daniel Berlin wrote: >> 2. Use POSIX regcomp facilities. This implies importing some >> implementation of this interface, e.g., Windows. On Linux, BSD, etc. >> we would try to use the platform version if available (and non- >> buggy). > > Don't do it. > They are ridiculous slow, and posix made some really dumb choices in >