复旦大学软件学院计算机系统课件 Heterogeneous Data Structures Alignment.ppt

* * * * * * * * * * * * * * * * * * * * * * Compilers Autumn 2002 Compilers Autumn 2002 * Heterogeneous Data Structures Alignment * Outline Struct Union Alignment Chap 3.9, 3.10 * Structures Group objects into a single object struct rect { int llx; /* X coordinate of lower-left corner */ int lly; /* Y coordinate of lower-left corner */ int color; /* Coding of color */ int width; /* Width (in pixels) */ int height; /* Height (in pixels) */ }; * Structure Each object is referenced by name struct rect r; r.llx = r.lly = 0; r.color = 0xFF00FF; r.width = 10; r.height = 20; * Structure int area (struct rect *rp) { return (*rp).width * (*rp).height; } void rotate_left (struct rect *rp) { /* Exchange width and height */ int t = rp-height; rp-height = rp-width; rp-width = t; } * Structures Memory layout All the components are stored in a contiguous region of memory A pointer to a structure is the address of its first byte * Structure struct rec { int i; int j; int a[3]; int *p; } *r; i j a[0] a[1] a[2] p Contents Offset 0 4 8 20 * Structure References to structure elements Using offsets as displacements r-j = r-i (Copy element r-i to element r-j) r is in register %edx. 1 movl (%edx), %eax Get r-i 2 movl %eax, 4(%edx) Store in r-j i j a[0] a[1] a[2] p Contents Offset 0 4 8 20 * Structure (r-a[i]) r in %eax, i in %edx： 1 leal 8(%eax,%edx,4),%ecx Generate r-a[i] i j a[0] a[1] a[2] p Contents Offset 0 4 8 20 * Structure r-p = r-a[r-i + r-j]; r in register %edx: 1 movl 4(%edx), %eax Get r-j 2 addl (%edx), %eax Add r-i 3 leal 8(%edx,%eax,4),%eax Compute r-a[r-i + r-j] 4 movl %eax, 20(%edx) Store in r-p i j a[0] a[1] a[2] p Contents Offset 0 4 8 20 * Unions A single object can be referenced by using different data types The syntax of a union declaration is identical to that for structures, but its semantics are very different Rather than having the different fields reference different blocks of memory, they all