search for: stack1

Hi- Trying to do a stacked bar chart, but nothing is rendering when I add more then 1 bar: This works: graph = Scruffy::Graph.new(:title => "My Chart") graph.add :stacked do |stack| stack.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])...

...98", "CBCLAggressionAt1410", > "CBCLInternalisingAt1410", > "Obese14", "Obese21", "Overweight14", "Overweight21", "hibp14", > "hibp21"), row.names = c(NA, 13L), class = "data.frame") > > BP.stack1<- reshape(bp.sub,sep="",timevar= > "time",direction="long",varying=list(names(bp.sub[8:9]),names(bp.sub[10:11]),names(bp.sub[12:13])),v.names=c("Obese","Overweight","HiBP"),idvar="CODEA") > > BP.stack1$time <- reco...

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

..., at 8:17 AM, Oliver Stannard <oliver.stannard at arm.com> wrote: > > Hi Quentin, > > One more reproducer, this time with small (<64bit) values being passed on the stack: > > int foo(int x0, int x1, int x2, int x3, int x4, int x5, int x6, int x7, > int stack1) { > return stack1; > } > > int main() { > int ret = foo(0,1,2,3,4,5,6,7,8); > printf("%d\n", ret); > } > > Global isel thinks that the incoming value of stack1 is stored in bytes [0,4) above SP, but for big-endian targets this should be in...

...annard at arm.com <mailto:oliver.stannard at arm.com>> wrote: > > Hi Quentin, > > One more reproducer, this time with small (<64bit) values being passed on the stack: > > int foo(int x0, int x1, int x2, int x3, int x4, int x5, int x6, int x7, > int stack1) { > return stack1; > } > > int main() { > int ret = foo(0,1,2,3,4,5,6,7,8); > printf("%d\n", ret); > } > > Global isel thinks that the incoming value of stack1 is stored in bytes [0,4) above SP, but for big-endian targets this should be in...

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

...ca space for the contexts. %ctxSize = 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, {}* %main...

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

To give an update here, we actually are not missing a mapping. The code complains because we are copying around a fp16 into a gpr32 and that shouldn’t be done with a copy (default mapping). I extended the repairing code to issue G_ANYEXT in those cases instead of asserting. However, now, I have to teach instruction select about those ANYEXT otherwise we’ll fallback in that case. But that’s a

...cks for the contexts. If llvm.stackgrowsdown returns true, we need ; pointers to the highest addresses of the stack areas rather than the ; lowest 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...

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

I have a new problem: Register RBP is used in a function foo. (I am not allocating RBP to any virtual register, the instances of RBP in function foo are in the machine code when my register allocator starts.) Function foo calls function bar. Register RBP is not saved across the call, though it is live after the call. Function bar includes a virtual register. The code that I'm using to

...rn void bldtbl (int[], int, int, int, int); extern void cmptmps (void); extern void expand_nxt_chk (void); extern int find_table_space (int*, int); extern void inittbl (void); extern void mkdeftbl (void); extern void mk1tbl (int, int, int, int); extern void place_state (int*, int, int); extern void stack1 (int, int, int, int); extern int yylex (void); extern int yylval; static char flex_version[] = "2.5.1"; void flexinit (int, char**); void readin (void); void set_up_initial_allocations (void); int printstats, syntaxerror, eofseen, ddebug, trace, nowarn, spprdflt; int interactive, caseins,...