search for: p_addr

...t.c -o - | llvm-dis -o - ; ModuleID = '<stdin>' target datalayout = "e-p:32:32:32-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:32:64-f32:32:32-f64:32:64-v64:64:64-v128:128:128-a0:0:64-f80:32:32" target triple = "i686-pc-linux-gnu" define void @a(i8* %p) { entry: %p_addr = alloca i8* ; <i8**> [#uses=1] %"alloca point" = bitcast i32 0 to i32 ; <i32> [#uses=0] store i8* %p, i8** %p_addr br label %return return: ; preds = %entry ret void } define void @b(i8* %p) { entry: %p_add...

People, I didn''t get an answer to this before so I am trying again: I could change an existing "policy" table to "policies" with no drama but the are a number of related tables ie: p_2quot p_addr p_cc p_cs p_direct p_div p_exss p_ll p_mp p_note p_prop p_prov...

How is c's const keyword translated when compiling c into llvm bytecode. I'm specifically interested in const pointer function arguments. Consider a function declared as follows in c: void f(const int* arg); When I examine f in llvm bytecode, how can I tell that arg is a pointer, whose contents can only be read, not written. Regards, Ryan

...d not be much more than our usual developer costs. There are however a few problems, the most obvious that I can see is the pluralization thing. I could change the existing "policy" table to "policies" with no drama but the are a number of related tables ie: p_2quot p_addr p_cc p_cs p_direct p_div p_exss p_ll p_mp p_note p_prop p_prov...

...however, I want to know if you also provide some kinds of use-def chain for memory operations? for example, I have the following source code int foo(int *q, int *p) { int x; *p = 1; x = *q; return x; } the IR after front-end is: s1: store i32* %q, i32** %q_addr s2: store i32* %p, i32** %p_addr s3: %1 = load i32** %p_addr, align 8 ; <i32*> [#uses=1] s4: store i32 1, i32* %1, align 4 s5: %2 = load i32** %q_addr, align 8 ; <i32*> [#uses=1] s6: %3 = load i32* %2, align 4 ; <i32> [#uses=1] s7: store i32 %3, i32* %x, ali...

...e-def chain for memory operations? for example, I have the following source code > > int foo(int *q, int *p) { > int x; > *p = 1; > x = *q; > return x; > } > > the IR after front-end is: > > s1: store i32* %q, i32** %q_addr > s2: store i32* %p, i32** %p_addr > > s3: %1 = load i32** %p_addr, align 8 ; <i32*> [#uses=1] > s4: store i32 1, i32* %1, align 4 > > s5: %2 = load i32** %q_addr, align 8 ; <i32*> [#uses=1] > s6: %3 = load i32* %2, align 4 ; <i32> [#uses=1]...

...the pointer increment of P is retained): void %test(uint %N, "complex long double"* %P) { entry: %tmp.15 = seteq uint %N, 0 ; <bool> [#uses=1] br bool %tmp.15, label %return, label %no_exit no_exit: ; preds = %no_exit, %entry %P_addr.0.0 = phi "complex long double"* [ %inc, %no_exit ], [ %P, %entry ] ; <"complex long double"*> [#uses=3] %N_addr.0.0 = phi uint [ %dec, %no_exit ], [ %N, %entry ] ; <uint> [#uses=1] %inc = getelementptr "complex long d...

I''m testing the http module in console. BUt I got the following error. Anyone knows why? >> Net::HTTP.get_print ''www.google.com'', ''index.html'' SystemStackError: stack level too deep from C:/InstantRails/ruby/lib/ruby/1.8/net/http.rb:451:in `newobj'' from C:/InstantRails/ruby/lib/ruby/1.8/net/http.rb:451:in

...retained): > > void %test(uint %N, "complex long double"* %P) { > entry: > %tmp.15 = seteq uint %N, 0 ; <bool> [#uses=1] > br bool %tmp.15, label %return, label %no_exit > no_exit: ; preds = %no_exit, %entry > %P_addr.0.0 = phi "complex long double"* [ %inc, %no_exit ], [ > %P, %entry ] ; <"complex long double"*> [#uses=3] > %N_addr.0.0 = phi uint [ %dec, %no_exit ], [ %N, %entry > ] ; <uint> [#uses=1] > %inc = getelementptr...

...void %test(uint %N, "complex long double"* %P) { >> entry: >> %tmp.15 = seteq uint %N, 0 ; <bool> [#uses=1] >> br bool %tmp.15, label %return, label %no_exit >> no_exit: ; preds = %no_exit, %entry >> %P_addr.0.0 = phi "complex long double"* [ %inc, %no_exit ], [ %P, >> %entry ] ; <"complex long double"*> [#uses=3] >> %N_addr.0.0 = phi uint [ %dec, %no_exit ], [ %N, %entry ] >> ; <uint> [#uses=1] >> %inc = getelementpt...

...fault_tss.tss_ds = dblfault_tss.tss_es = @@ -2010,7 +2012,6 @@ vm86_initialize(); getmemsize(first); - pmap_bootstrap(first, 0); init_param2(physmem); /* now running on new page tables, configured,and u/iom is accessible */ @@ -2044,11 +2045,7 @@ /* setup proc 0's pcb */ proc0.p_addr->u_pcb.pcb_flags = 0; -#ifdef PAE - proc0.p_addr->u_pcb.pcb_cr3 = (int)IdlePDPT - KERNBASE; -#else - proc0.p_addr->u_pcb.pcb_cr3 = (int)IdlePTD; -#endif + proc0.p_addr->u_pcb.pcb_cr3 = (int)IdlePTD; #ifdef SMP proc0.p_addr->u_pcb.pcb_mpnest = 1; #endif Only in /usr/...

I noticed that fourinarow is one of the programs in which LLVM is much slower than GCC, so I decided to take a look and see why that is so. The program has many loops that look like this: #define ROWS 6 #define COLS 7 void init_board(char b[COLS][ROWS+1]) { int i,j; for (i=0;i<COLS;i++) for (j=0;j<ROWS;j++) b[i][j]='.';

...p = 0x0, ss_size = 0, ss_flags = 4}, p_priority = 55 '7', p_usrpri = 55 '7', p_nice = 0 '\000', p_comm = "mozilla-bin\000\000\000\000\000", p_pgrp = 0xc2048620, p_sysent = 0xc02c8580, p_rtprio = {type = 1, prio = 0}, p_prison = 0x0, p_args = 0xc2048500, p_addr = 0xe18e9000, p_md = {md_regs = 0xe18ebfa8}, p_xstat = 0, p_acflag = 16, p_ru = 0xc202b300, p_nthreads = 0, p_aioinfo = 0xa8, p_wakeup = 0, p_peers = 0x0, p_leader = 0x0, p_asleep = { as_priority = 0, as_timo = 0}, p_emuldata = 0x20} (kgdb) Peter