search for: stack2

...NA NA > #14.2 21 0 1 1 > #16.2 21 0 0 NA > #17.2 21 NA NA NA > names(bp.sub)[grep("\\d+",names(bp.sub))]<-gsub("(\\D+)(\\d+)","\\1_\\2",names(bp.sub)[grep("\\d+",names(bp.sub))]) > > BP.stack2<-reshape(bp.sub,dir="long",varying=8:13,sep="_") > Bp.stack2 > CODEA C_45 ragek ra_80 ra_98 CBCLAggressionAt_1410 > 1.14 1 NA 3 4 1 NA > 2.14 3 2 3 3 1 0 > 3.14 4 2...

...tack.add(:bar, ''Stack1'', [10,10]) end This doesn''t: graph = Scruffy::Graph.new(:title => "My Chart") graph.add :stacked do |stack| stack.add(:bar, ''Stack1'', [10,10]) stack.add(:bar, ''Stack2'', [15,10]) end Anyone know what''s going wrong here? Thanks! --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Ruby on Rails: Talk" group. To post to this group, send email to rubyonr...

Just to let people know what my big picture is, I''m trying to write a script that will let me run a program, and name a progeny of that program that I want to debug. My script should find the first occurrence of that progeny, and run it until it finishes initializing the runtime linker, but stop it before it runs any shared library startup routines. (Failing that, I''d be okay

Hi, The other day on IRC myself, Chandler, Hal and Pablo discussed recursive inlining. I've pondered a bit since then, and thought I'd get some background on the list with the aim of stimulating discussion. Our goal is to inline recursive functions. We have several workloads with recursive calls, and inlining them to a certain degree can improve performance by up to 30%. Inlining

...xSize = call i64 @llvm.context.size() %p0 = alloca i8, i64 %ctxSize %mainCtx = bitcast i8* %p0 to {}* %p1 = alloca i8, i64 %ctxSize %ctx1 = bitcast i8* %p1 to {}* %p2 = alloca i8, i64 %ctxSize %ctx2 = bitcast i8* %p2 to {}* ; Stacks for the contexts %stack1 = alloca i8, i64 4096 %stack2 = alloca i8, i64 4096 ; Create contexts for co1 and co2. call void @llvm.makecontext({}* %ctx1, void({}*, {}*)* @co1, i8* %stack1, i64 4096, {}* %mainCtx, {}* null) call void @llvm.makecontext({}* %ctx2, void({}*, {}*)* @co2, i8* %stack2, i64 4096, {}* %mainCtx, {}* null) ; Run co1 and...

Hi Brent, You're correct. The segmented stack model is intended for performance, not security. Its goal is to allow lightweight threads to be very cheaply allocated and destroyed. For your model, you would most likely want to use different address spaces for the different memory types. Currently, clang does not allow you to define the address space of variables with automatic storage

...addresses. %growsdown = call i1 @llvm.stackgrowsdown() %stackbuf1 = alloca i8, i64 4096 %stackhi1 = getelementptr i8* %stackbuf1, i64 4096 %stack1 = select i1 %growsdown, i8* %stackhi1, i8* %stackbuf1 %stackbuf2 = alloca i8, i64 4096 %stackhi2 = getelementptr i8* %stackbuf2, i64 4096 %stack2 = select i1 %growsdown, i8* %stackhi2, i8* %stackbuf2 ; Create contexts for co1 and co2. co1 and co2 each need an i32 ; initial value. call void @llvm.makecontext({}* %ctx1, bitcast void({}*, i32)* @co1 to {}*, i8* %stack1, {}* %mainCtx, i32 24601) call void @llvm.makecontext({}*...

Hi Duncan, It doesn't appear to be what I'm looking for as there is copying of the old stack to the new stack. Additionally, according to the LLVM docs on segmented stacks (http://llvm.org/releases/3.0/docs/SegmentedStacks.html) the stacklings are allocated memory from the heap. Since this places them all on the same memory segment, a read/write from one stackling could technically

Kenneth Uildriks <kennethuil at gmail.com> wrote: > As I see it, the context switching mechanism itself needs to know > where to point the stack register when switching.  The C routines take > an initial stack pointer when creating the context, and keep track of > it from there.  If we don't actually need to interoperate with > contexts created from the C routines, we have