ProgramDesignandAnalysisprogramrepresentations优秀讲义.pptVIP

yin yong Program design and analysis Design patterns Representations of programs Assembly and linking Design patterns (P.158) Design pattern: generalized description of the design of a certain type of program. Designer fills in details to customize the pattern to a particular programming problem. List design pattern Design pattern elements Class diagram State diagrams Sequence diagrams etc. State machine (P.159) State machine is useful in many contexts: parsing user input responding to complex stimuli controlling sequential outputs State machine example (P.160) State machine pattern C implementation #define IDLE 0 #define SEATED 1 #define BELTED 2 #define BUZZER 3 switch (state) { case IDLE: if (seat) { state = SEATED; timer_on = TRUE; } break; case SEATED: if (belt) state = BELTED; else if (timer) state = BUZZER; break; … } Circular buffer (P.161) Circular buffer pattern Circular buffer implementation: FIR filter int circ_buffer[N], circ_buffer_head = 0; int c[N]; /* coefficients */ … int ibuf, ic; for (f=0, ibuff=circ_buff_head, ic=0; icN; ibuff=(ibuff==N-1?0:ibuff++), ic++) f = f + c[ic]*circ_buffer[ibuf]; Models of programs (P.162) Source code is not a good representation for programs: clumsy; leaves much information implicit. Compilers derive intermediate representations to manipulate and optimize the program. Data flow graph DFG: data flow graph. Does not represent control. Models basic block: code with one entry and exit. Describes the minimal ordering requirements on operations. Single assignment form x = a + b; y = c - d; z = x * y; y = b + d; original basic block x = a + b; y = c - d; z = x * y; y1 = b + d; single assignment form Data flow graph x = a + b; y = c - d; z = x * y; y1 = b + d; single assignment form DFGs and partial orders Partial order: a+b, c-d; b+d, x*y Can do pairs of operations in any order. Control-data flow graph (P.164) CDFG: represents control and data. Uses data flow graphs as components. Two types of nodes: decisi