search for: backtracking

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

...Timing on this machine. on the problem. No Timing on this machine. for the input. No Timing on this machine. for the FLOTTER CNF translation. No Timing on this machine. for inferences. No Timing on this machine. for the backtracking. No Timing on this machine. for the reduction. --------------------------SPASS-STOP------------------------------ exit 0 vanilla: .... Given clause: 29876[3:Res:23.2,29766.0] || member(U,singleton (universal_class))* -> . SPASS V 2.1 SPASS beiseite: Proof found. P...

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 lon...

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

On 6/26/12 5:07 PM, amruth.rd wrote: > 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

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

...an error in rspec_on_rails: ArgumentError in ''UserController without logged in user should show the index page'' wrong number of arguments (2 for 1) ..../vendor/plugins/rspec_on_rails/lib/spec/rails/example/behaviour/ controller_example_group.rb:188:in `render'' I tried backtracking to an earlier version of rails with no luck. Can anyone provide some version numbers (for rspec, rspec on rails, and rails itself) that I can downgrade back to so my specs work again? Thanks a lot! Daniel

...hine. on the problem. > No Timing on this machine. for the input. > No Timing on this machine. for the FLOTTER CNF > translation. > No Timing on this machine. for inferences. > No Timing on this machine. for the backtracking. > No Timing on this machine. for the reduction. > > --------------------------SPASS-STOP------------------------------ > exit 0 > > vanilla: > .... > Given clause: 29876[3:Res:23.2,29766.0] || member(U,singleton > (universal_class))* -> . &g...

..., causing the RA to >run out of registers. We want to coallesce physregs when possible, >but we cannot pin them in the spiller: >we have to be able to >uncoallesce them. First of all, I totally 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...

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 =

...ppen is that, in order to reload spilled variables, > you will need registers available. As far as I understand, it is guaranteed by the algorithm, no special reservation in advance is neccessary. > So, either you spare two registers, > 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 reserv...

...trol 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 this purpose? I can't really move to using the JIT entirely because I want to replace the memory model with something that supports backtracking -- this is doable (fairly) straightforwardly with the interpreter, but it would require some very complicated transformations to the code in order to do this within the JIT environment, and it would be quite tricky to avoid subtly breaking the semantics. That kind of approach is possible, prob...

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 LLVM, and my first challenge is how to make the best use of LLVM's analysis and transformations. Is it the best...

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

...ime in size of string. Nice, we need something for windows. > The Google impl was, at least if i remember right, made up of 3 > engines: 1 that was a special case matcher that handled plain old > anchored strings super fast, 1 that dealt with regular expressions > that did not require backtracking, and 1 that dealt with regular > expressions that did. FWIW, I plan to have different syntax in filecheck for fixed string matching vs regex matching. This should eliminate most of the common reasons for needing "leaning toothpicks". > If you are curious, see http://swtch.com...