15 213 The course that gives CMU its Zip Memory Management III Perils and pitfalls Mar 13 2001 Topics Memory related bugs Debugging versions of malloc class16 ppt C operators Operators Associativity left to right right to left left to right left to right left to right left to right left to right left to right left to right left to right left to right left to right right to left right to left left to right type sizeof Note Unary and have higher precedence than binary forms class16 ppt 2 CS 213 S 01 C pointer declarations int p p is a pointer to int int p 13 p is an array 13 of pointer to int int p 13 p is an array 13 of pointer to int int p p is a pointer to a pointer to an int int p 13 p is a pointer to an array 13 of int int f f is a function returning a pointer to int int f f is a pointer to a function returning int int f 13 f is a function returning ptr to an array 13 of pointers to functions returning int int x 3 5 x is an array 3 of pointers to functions returning pointers to array 5 of ints class16 ppt 3 CS 213 S 01 Memory related bugs Dereferencing bad pointers Reading uninitialized memory Overwriting memory Referencing nonexistent variables Freeing blocks multiple times Referencing freed blocks Failing to free blocks class16 ppt 4 CS 213 S 01 Dereferencing bad pointers The classic scanf bug scanf d val class16 ppt 5 CS 213 S 01 Reading uninitialized Assuming thatmemory heap data is initialized to zero return y Ax int matvec int A int x int y malloc N sizeof int int i j for i 0 i N i for j 0 j N j y i A i j x j return y class16 ppt 6 CS 213 S 01 Overwriting Allocating thememory possibly wrong sized object int p p malloc N sizeof int for i 0 i N i p i malloc M sizeof int class16 ppt 7 CS 213 S 01 Overwriting memory Off by one int p p malloc N sizeof int for i 0 i N i p i malloc M sizeof int class16 ppt 8 CS 213 S 01 Overwriting memory Off by one redux int i 0 done 0 int s 4 while done if i 3 done 1 else s i 10 class16 ppt 9 CS 213 S 01 Overwriting memory Forgetting that strings end with 0 char t 7 char s 8 1234567 strcpy t s class16 ppt 10 CS 213 S 01 Overwriting memory Not checking the max string size char s 8 int i gets s reads 123456789 from stdin Basis for classic buffer overflow attacks 1988 Internet worm modern attacks on Web servers class16 ppt 11 CS 213 S 01 Buffer overflow attacks Description of hole Servers that use C library routines such as gets that don t check input sizes when they write into buffers on the stack The following description is based on the IA32 stack conventions The details will depend on how the stack is organized which varies between machines ebp Stack frame for proc a Stack frame for proc b Saved regs and Local vars proc a b call procedure b return addr ebp 64 bytes for buffer class16 ppt proc b char buffer 64 alloc 64 bytes on stack gets buffer read STDIN line into stack buf 12 CS 213 S 01 Overwriting Referencing amemory pointer instead of the object it points to int BinheapDelete int binheap int size int packet packet binheap 0 binheap 0 binheap size 1 size Heapify binheap size 0 return packet class16 ppt 13 CS 213 S 01 Overwriting memory Misunderstanding pointer arithmetic int search int p int val while p p val p sizeof int return p class16 ppt 14 CS 213 S 01 Referencing nonexistent variables Forgetting that local variables disappear when a function returns int foo int val return val class16 ppt 15 CS 213 S 01 Freeing blocks multiple times Nasty x malloc N sizeof int manipulate x free x y malloc M sizeof int manipulate y free x class16 ppt 16 CS 213 S 01 Referencing freed blocks Evil x malloc N sizeof int manipulate x free x y malloc M sizeof int for i 0 i M i y i x i class16 ppt 17 CS 213 S 01 Failing to free blocks memory leaks slow long term killer foo int x malloc N sizeof int return class16 ppt 18 CS 213 S 01 Failing to free blocks memory leaks Freeing only part of a data structure struct list int val struct list next foo struct list head malloc sizeof struct list head val 0 head next NULL create and manipulate the rest of the list free head return class16 ppt 19 CS 213 S 01 Dealing with memory bugs Conventional debugger gdb good for finding bad pointer dereferences hard to detect the other memory bugs Debugging malloc CSRI UToronto malloc wrapper around conventional malloc detects memory bugs at malloc and free boundaries memory overwrites that corrupt heap structures some instances of freeing blocks multiple times memory leaks Cannot detect all memory bugs overwrites into the middle of allocated blocks freeing block twice that has been reallocated in the interim referencing freed blocks class16 ppt 20 CS 213 S 01 Dealing with memory bugs Binary translator Atom cont Purify powerful debugging and analysis technique rewrites text section of executable object file can detect all errors as debugging malloc can also check each individual reference at runtime bad pointers overwriting referencing outside of allocated block Garbage collection Boehm Weiser Conservative GC let the system free blocks instead of the programmer class16 ppt 21 CS 213 S 01 Debugging malloc mymalloc h define malloc size mymalloc size FILE LINE define free p myfree p FILE LINE Application program ifdef DEBUG include mymalloc h endif main p malloc 128 free p q malloc 32 class16 ppt 22 CS 213 S 01 Debugging malloc cont Debugging malloc library void mymalloc int size char file int line prologue code p malloc epilogue code return q void myfree void p char file int line prologue code free p epilogue code class16 ppt 23 CS 213 S 01 Debugging malloc cont block size block ID file name of allocation line number of allocation checksum of previous fields ptr to next allocated block ptr to prev allocated block guard bytes Block requested by application guard bytes class16 ppt 24 header application block footer CS 213 S 01 Debugging malloc cont mymalloc size p malloc size sizeof header sizeof footer add p to list of allocated blocks initialize application block to 0xdeadbeef return pointer to application block myfree p already free line 0xfefefefefefefefe checksum OK guard bytes OK free p sizeof hdr line 0xfefefefefefefefe class16 ppt 25 CS 213 S 01
View Full Document