search for: makelist

...iptors where I expected them to be in the same pool. We use svn revision 66285 of the DSA. The following 2 programs expose the problem. First the version that runs correctly, ie. producing a single DSNode. --------- typedef struct list { int X; struct list *Next; } list; void MakeList() { list *Result = malloc(sizeof(list)); Result->X = 1; Result->Next = malloc(sizeof(list)); Result = Result->Next; Result->X = 2; Result->Next = 0; } int main() { MakeList(); return 0; } --------- You can view the corresponding DSGraph here: h...

Trying to build asterisk 1.6.0-rc3, it fails with this message: make[2]: Entering directory `/home/fhimpe/rpm/BUILD/asterisk-1.6.1.0-rc3/ main/editline' /bin/sh makelist -h common.c > common.h /bin/sh makelist -h emacs.c> emacs.h /bin/sh makelist -h vi.c > vi.h /bin/sh makelist -fh common.h emacs.h vi.h > fcns.h /bin/sh makelist -fc common.h emacs.h vi.h > fcns.c if uname -s | /bin/grep -qi cygwin; then cat fcns.c | sed -e s/"sys \.h"/&quot...

>Message: 11 >Date: Sun, 28 Aug 2005 11:46:29 +0800 >From: "chris" <chris@fivestartel.com> >Subject: [Asterisk-Users] error compiling on solaris 10 >To: "Asterisk Users Mailing List - Non-Commercial Discussion" <asterisk-users@lists.digium.com> >Message-ID: <003a01c5ab83$149a9e30$650fa8c0@acid> >Content-Type: text/plain;

...Q.] How to create an array of lists, or structures the most elegant way? There have been questions in the past but none too recently...I want to know if the following looks OK to you guys or if there is a better way to create an array of lists: # PREAMBLE ... JUST TO GET THINGS GOING makeList<- function(data, anythingElse) { rval <- list( data = data, anythingElse = anythingElse ) class(rval) <- "myListOfArbitraryThings" return(rval) } # make up some arbitrary data payload<- list( as.matrix(cbind(1,1:3)), 10:15, data.frame(cbind(x=1, y=1...

...ruct.list* %L) #0 { entry: %L.addr = alloca %struct.list*, align 8 store %struct.list* %L, %struct.list** %L.addr, align 8 %0 = load %struct.list** %L.addr, align 8 call void @do_all(%struct.list* %0, void (i32*)* @addG) ret void } ; Function Attrs: nounwind uwtable define %struct.list* @makeList(i32 %Num) #0 { entry: %Num.addr = alloca i32, align 4 %New = alloca %struct.list*, align 8 store i32 %Num, i32* %Num.addr, align 4 %call = call noalias i8* @malloc(i64 16) #2 %0 = bitcast i8* %call to %struct.list* store %struct.list* %0, %struct.list** %New, align 8 %1 = load i32* %N...

On Sat, 2 Apr 2005, Ricardo wrote: > Hello, > I am trying to run a program optimized with the Pool Allocation, but I am receiving this error: > > ==================== > > *** 4 DYNAMIC POOLS INITIALIZED *** > > *** 4 DYNAMIC POOLS ALLOCATED FROM *** > > MaxHeapSize = 0.062500KB HeapSizeAtExit = 0.062500KB NOTE: only valid if using > Heuristic=AllPools and no

Hello, I am trying to run a program optimized with the Pool Allocation, but I am receiving this error: ==================== libpoolalloc.so: undefined symbol: _ZTIN4llvm16EquivClassGraphsE -load request ignored. *** 4 DYNAMIC POOLS INITIALIZED *** *** 4 DYNAMIC POOLS ALLOCATED FROM *** MaxHeapSize = 0.062500KB HeapSizeAtExit = 0.062500KB NOTE: only valid if using Heuristic=AllPools and no

Dear R users, I wish to utilise processed and saved objects as arguments of a function. Specifically, I have created objects using *"assign"* & *"paste"* functions with an incremental index i, the names of the objects are: fund1, fund2, fund3,....., fund80,..... (where the numerical value increments according to the index i & class of these objects are

Hi All, I am trying to get Asterisk up and running on my new Mandrake 9.1 install. I've installed Linux in the "standard" mandrake security mode, and "su" to do my attempts at install. I managed to obtain the source from CVS, and have been able to compile Zaptel. I then ran insmod zaptel, and also make config. I think I have compiled and loaded Zaptel successfully as

...e answer I am trying to test the PA with a program very similar to the one used as an example in the paper located here: http://llvm.cs.uiuc.edu/pubs/2003-04-29-DataStructureAnalysisTR.html The program is as follows: ========================== struct list { struct list *Next; }; struct list *makeList (int Num) { struct list *New = malloc ( sizeof ( struct list ) ); New->Next = Num ? makeList (Num-1) : 0; return New; } int main() { struct list *X = makeList(10); } ========================== After applying the PA to it, the output is something like this: ========================== int...

...klib.list ##### # Generate socket calls stubs # Based on input from SOCKETCALLS.def generate socket call stubs -targets := socketcalls.list +targets := klib.list targets += socketcalls.mk targets += SOCKETCALLS.i targets += $(socketcall-objs) @@ -26,7 +26,7 @@ quiet_cmd_makelist = LIST $@ cmd_makelist = echo '$(filter-out FORCE,$^)' > $@ # Create list of all files -$(obj)/socketcalls.list: $(call objectify,$(socketcall-objs)) FORCE +$(obj)/klib.list: $(call objectify,$(socketcall-objs)) FORCE $(call if_changed,makelist) # Generate assembler fil...