Page 1. Memory Allocation and Usage CSE 361S. Different free lists for different size classes

Transcription

1 Keeping Trck o Free Blocks Method 1: : Implicit list using lengths -- links ll blocks Memory Alloction nd Usge Method : : Explicit list mong the ree blocks using pointers within the ree blocks CSE 361S Method 3: : Segregted ree lists Dierent ree lists or dierent size clsses Method 4: : Blocks sorted by size (not discussed) Cn use blnced tree (e.g. Red-Blck tree) with pointers within ech ree block, nd the length used s key Explicit Free Lists Allocting From Explicit Free Lists A B C pred succ Use dt spce or link pointers Typiclly doubly linked Still need boundry tgs or colescing Forwrd links A B C Bck links Beore: Ater: (with splitting) ree block pred succ ree block It is importnt to relize tht links re not necessrily in the sme order s the blocks 3 4 Freeing With Explicit Free Lists Freeing With LIFO Policy Insertion policy: : Where in the ree list do you put newly reed block? LIFO (lst-in-irst-out) policy Insert reed block t the beginning o the ree list Pro: simple nd constnt time Con: studies suggest rgmenttion is worse thn ddress ordered. Address-ordered policy Insert reed blocks so tht ree list blocks re lwys in ddress order» i.e. ddr(pred) < ddr(curr) < ddr(succ) Con: requires serch Pro: studies suggest rgmenttion is better thn LIFO Cse 1: -- Insert sel t beginning o ree list Cse : -- Splice out next, colesce sel nd next, nd dd to beginning o ree list beore: ter: pred (p) sel sel succ (s) p s p s 5 6 Pge 1

2 Freeing With LIFO Policy (cont) Cse 3: -- 7 Splice out prev, colesce with sel, nd dd to beginning o ree list Cse 4: -- Splice out prev nd next, colesce with sel, nd dd to beginning o list beore: ter: beore: ter: p p p1 s s s1 sel sel p s p1 s1 p s Explicit List Summry Comprison to implicit list: Allocte is liner time in number o ree blocks insted o totl blocks -- much ster lloctes when most o the memory is ull Slightly more complicted llocte nd ree since needs to splice blocks in nd out o the list Some extr spce or the links ( extr words needed or ech block) Min use o linked lists is in conjunction with segregted ree lists 8 Keep multiple linked lists o dierent size clsses, or possibly or dierent types o objects Keeping Trck o Free Blocks Method 1: Implicit list using lengths -- links ll blocks Method : Explicit list mong the ree blocks using pointers within the ree blocks Method 3: Segregted ree list Dierent ree lists or dierent size clsses Method 4: : Blocks sorted by size 9 Cn use blnced tree (e.g. Red-Blck tree) with pointers within ech ree block, nd the length used s key Segregted Storge Ech size clss hs its own collection o blocks Oten hve seprte size clss or every smll size (,3,4, ) For lrger sizes typiclly hve size clss or ech power o Simple Segregted Storge Seprte hep nd ree list or ech size clss No splitting To llocte block o size n: I ree list or size n is not empty, llocte irst block on list (note, list cn be implicit or explicit) I ree list is empty, get new pge crete new ree list rom ll blocks in pge llocte irst block on list Constnt time To ree block: Add to ree list I pge is empty, return the pge or use by nother size (optionl) Trdeos: Fst, but cn rgment bdly 11 Segregted Fits Arry o ree lists, ech one or some size clss To llocte block o size n: Serch pproprite ree list or block o size m > n I n pproprite block is ound: Split block nd plce rgment on pproprite list (optionl) I no block is ound, try next lrger clss Repet until block is ound To ree block: Colesce nd plce on pproprite list (optionl) Trdeos Fster serch thn sequentil its (i.e., log time or power o two size clsses) Controls rgmenttion o simple segregted storge Colescing cn increse serch times Deerred colescing cn help 1 Pge

3 For More Ino on Alloctors D. Knuth, The Art o Computer Progrmming, Second Edition, Addison Wesley, 1973 The clssic reerence on dynmic storge lloction Wilson et l, Dynmic Storge Alloction: A Survey nd Criticl Review, Proc Int l Workshop on Memory Mngement, Kinross, Scotlnd, Sept, Comprehensive survey Avilble rom CS:APP student site (cspp.cs.cmu.edu) 13 Implicit Memory Mngement: Grbge Collection Grbge collection: utomtic reclmtion o hep- llocted storge -- ppliction never hs to ree void oo() { int *p = mlloc(18); return; /* p block is now grbge */ Common in unctionl lnguges, scripting lnguges, nd modern object oriented lnguges: Lisp, ML, Jv, Perl, Mthemtic, Vrints (conservtive grbge collectors) exist or C nd C++ Cnnot collect ll grbge 14 Grbge Collection How does the memory mnger know when memory cn be reed? In generl we cnnot know wht is going to be used in the uture since it depends on conditionls But we cn tell tht certin blocks cnnot be used i there re no pointers to them Need to mke certin ssumptions bout pointers Memory mnger cn distinguish pointers rom nonpointers All pointers point to the strt o block Cnnot hide pointers (e.g., by coercing them to n int, nd then bck gin) Clssicl GC lgorithms Mrk nd sweep collection (McCrthy, 1960) Does not move blocks (unless you lso compct ) Reerence counting (Collins, 1960) Does not move blocks (not discussed) Copying collection (Minsky, 1963) Moves blocks (not discussed) For more inormtion, see Jones nd Lin, Grbge Collection: Algorithms or Automtic Dynmic Memory, John Wiley & Sons, Memory s Grph We view memory s directed grph Ech block is node in the grph Ech pointer is n edge in the grph Loctions not in the hep tht contin pointers into the hep re clled root nodes (e.g. registers, loctions on the stck, globl vribles) Root nodes Hep nodes rechble Not-rechble (grbge) A node (block) is rechble i there is pth rom ny root to tht node. Non-rechble nodes re grbge (never needed by the ppliction) 17 Assumptions For This Lecture Appliction new(n): returns pointer to new block with ll loctions clered red(b,i): red loction i o block b into register write(b,i,v): write v into loction i o block b Ech block will hve heder word ddressed s b[-1], or block b 18 Used or dierent purposes in dierent collectors Instructions used by the Grbge Collector is_ptr(p): determines whether p is pointer length(b): returns the length o block b, not including the heder get_roots(): returns ll the roots Pge 3

4 Mrk nd Sweep Collecting Cn build on top o mlloc/ree pckge Allocte using mlloc until you run out o spce When out o spce: 19 Use extr mrk bit in the hed o ech block Mrk: Strt t roots nd set mrk bit on ll rechble memory Sweep: Scn ll blocks nd ree blocks tht re not mrked Beore mrk Ater mrk Ater sweep ree root ree Mrk bit set Mrk nd Sweep (cont.) 0 Mrk using depth-irst trversl o the memory grph ptr mrk(ptr p) { i (!is_ptr(p)) return; // do nothing i not pointer i (mrkbitset(p)) return // check i lredy mrked setmrkbit(p); // set the mrk bit or (i=0; i < length(p); i++) // mrk ll children mrk(p[i]); return; Sweep using lengths to ind next block ptr sweep(ptr p, ptr end) { while (p < end) { i mrkbitset(p) clermrkbit(); else i (lloctebitset(p)) ree(p); p += length(p); Memory-Relted Bugs Dereerencing bd pointers Reding uninitilized memory Overwriting memory Reerencing nonexistent vribles Freeing blocks multiple times Reerencing reed blocks Filing to ree blocks Dereerencing Bd Pointers The clssic scn bug scn( %d, vl); 1 Reding Uninitilized Memory Assuming tht hep dt is initilized to zero Allocting the (possibly) wrong sized object /* return y = Ax */ int *mtvec(int **A, int *x) { int *y = mlloc(n*sizeo(int)); int i, j; or (i=0; i<n; i++) or (j=0; j<n; j++) y[i] += A[i][j]*x[j]; return y; int **p; p = mlloc(n*sizeo(int)); or (i=0; i<n; i++) { p[i] = mlloc(m*sizeo(int)); 3 4 Pge 4

5 O-by-one error Not checking the mx string size int **p; p = mlloc(n*sizeo(int *)); or (i=0; i<=n; i++) { p[i] = mlloc(m*sizeo(int)); chr s[8]; int i; gets(s); /* reds rom stdin */ Bsis or clssic buer overlow ttcks 1988 Internet worm Modern ttcks on Web servers AOL/Microsot IM wr 5 6 Reerencing pointer insted o the object it points to Misunderstnding pointer rithmetic int *BinhepDelete(int **binhep, int *size) { int *pcket; pcket = binhep[0]; binhep[0] = binhep[*size - 1]; *size--; Hepiy(binhep, *size, 0); return(pcket); int *serch(int *p, int vl) { while (*p && *p!= vl) p += sizeo(int); return p; 7 8 Reerencing Nonexistent Vribles Freeing Blocks Multiple Times Forgetting tht locl vribles dispper when unction returns int *oo () { int vl; return &vl; Nsty! x = mlloc(n*sizeo(int)); <mnipulte x> ree(x); y = mlloc(m*sizeo(int)); <mnipulte y> ree(x); 9 30 Pge 5

6 Reerencing Freed Blocks Evil! Filing to Free Blocks (Memory Leks) Slow, long-term killer! x = mlloc(n*sizeo(int)); <mnipulte x> ree(x);... y = mlloc(m*sizeo(int)); or (i=0; i<m; i++) y[i] = x[i]++; oo() { int *x = mlloc(n*sizeo(int));... return; 31 3 Filing to Free Blocks (Memory Leks) Freeing only prt o dt structure struct list { int vl; struct list *next; ; oo() { struct list *hed = mlloc(sizeo(struct list)); hed->vl = 0; hed->next = NULL; <crete nd mnipulte the rest o the list>... ree(hed); return; 33 Pge 6