Chapter 9 Subprograms ISBN 0 321 33025 0

Chapter 9 Subprograms ISBN 0 -321 -33025 -0

Chapter 9 Topics • • • Introduction Fundamentals of Subprograms Design Issues for Subprograms Local Referencing Environments Parameter-Passing Methods Parameters That Are Subprogram Names Overloaded Subprograms Generic Subprograms Design Issues for Functions User-Defined Overloaded Operators Coroutines 1 -2

Abstraction Facilities in a Programming Language • Two fundamental abstraction facilities can be included in a programming language: – process abstraction • In the early history of high-level programming languages, only process abstraction was recognized and included. • Process abstraction has been a central concept in all programming languages. – data abstraction • In the 1980 s, however, many people began to believe that data abstraction was equally important. • Data abstraction is discussed in detail in Chapter 11. 1 -3

Properties of Subprograms • All subprograms discussed in this chapter, except the coroutines described in Section 9. 11, have the following characteristics; – Each subprogram has a single entry point. – The calling program unit is suspended during the execution of the called subprogram, which implies that there is only one subprogram in execution at any given time. – Control returns to the caller when the subprogram execution terminates. 1 -4

setjump and longjmp #include <stdio. h> #include <setjmp. h> static jmp_buf buf; void second(void) { printf("secondn"); longjmp(buf, 1); [wikipedia] // prints // jumps back to where setjmp was //called - making setjmp now return 1 } void first(void) { second(); printf("firstn"); // does not print } int main() { if ( ! setjmp(buf) ) { first(); // when executed, setjmp returns 0 } else { // when longjmp jumps back, setjmp returns 1 printf("mainn"); // prints } return 0; 1 -5 }

Subprogram Definitions • A subprogram definition describes – the interface to and – the actions of the subprogram abstraction. 1 -6

Subprogram Call • A subprogram call is the explicit request that the called subprogram be executed. 1 -7

Active Subprogram • A subprogram is said to be active if, after having been called, it has begun execution but has not yet completed that execution. 1 -8

Classes of Subprograms • The two fundamental kinds of subprograms, – procedures and – functions, are defined and discussed in Section 9. 2. 4. 1 -9

Subprogram Headers • A subprogram header, which is the first part of the definition, serves several purposes. – First, it specifies that the following syntactic unit is a subprogram definition of some particular kind. • Some programming languages include two different kinds of subprograms; specifically, procedures and functions. – Second, it provides a name for the subprogram. – Third, it may optionally specify a list of parameters. • They are optional because not all subprogram definitions have parameters. 1 -10

Header Examples • The following is the header of a Fortran subprogram named Adder. Subroutine Adder(parameters) • In Ada, the header for Adder would be procedure Adder(parameters) 1 -11

C Function Header • No special word appears in the subprogram header of a C subprogram. • C has only one kind of subprogram, functions (and/or methods). • The header of a function is recognized by context rather than by a special word. • For example, void adder(parameters) – would serve as the header of a function named adder, where void indicates that it does not return a value. 1 -12

The Parameter Profile and the Protocol of a Subprogram • The parameter profile (sometimes called the signature) of a subprogram is the – number – order and – types of its formal parameters. • The protocol of a subprogram is its parameter profile plus, if it is a function, its return type. 1 -13

The Declarations of Variables in C • In C the declarations of variables can be used to provide type information but not to define variables. • A variable declaration in C is used only outside function definitions. • A declaration is necessary when a variable must be referenced before the compiler has seen its definition. 1 -14

Subprogram Declarations • Subprograms can have declarations as well as definitions. – This form parallels the variable declarations and definitions in C. • Subprogram declarations provide the subprogram’s protocol, but do not include their bodies. – They are necessary in languages that do not allow forward references to subprograms. 1 -15

Declaration and Type Checking • In both the cases of variables and subprograms, declarations are needed for static type checking. – In the case of subprograms, it is the type of the parameters that must be checked. 1 -16

Usage of Subprogram Declarations • Function declarations are common in C and C++ programs, where they are called prototypes. • In most other languages, subprograms do not need declarations, because there is no requirement that subprograms defined before they are called. 1 -17

Approaches a Subprogram Could Use to Access Data • Subprograms typically describe computations. • There are two ways that a subprogram can gain access to the data that it is to process: – through direct access to nonlocal variables (declared elsewhere but visible in the subprogram) – through parameter passing. 1 -18

Data Passing through Parameters • Data passed through parameters are accessed through names that are local to the subprogram. • Parameter passing is more flexible than direct access to nonlocal variables. 1 -19

Parameterized Computation • In essence, a subprogram with parameter access to the data that it is to process is a parameterized computation. – It can perform its computation on whatever data it receives through its parameters (presuming the types of the parameters are as expected by the subprogram). 1 -20

Disadvantages of Data Access through Non-local Variables • If data access of a subprogram is through nonlocal variables, the only way the computation can proceed on different data is to assign new value to those nonlocal variables between calls to the subprogram. • Variables that are visible to the subprogram where access is desired often end up being visible where access to them is not needed (see chapter 5). 1 -21

Using a Subprogram as a Parameter • In some situations, it is convenient to be able to transmit computations, rather than data, as parameters to subprograms. • In these cases, the name of the subprogram that implements that computation may be used as a parameter. 1 -22

Callback in C [易春木] 1 -23

Definition [wikipedia] • In computer programming, a callback function, also known as a "call-after" function, is any executable code that is passed as an argument to other code; that other code is expected to call back (execute) the argument at a given time. – Callback (i. e. Callback Mechanism) – Callback function pointer 1 -24

Callback (i. e. Callback Mechanism) [wikipedia][灌籃高手] • A callback is approached that utilize a function pointer to call a function which usually is transferred to the function pointer through a parameter. 1 -25

Define the Type of Function Used for a Callback typedef struct { uint 8_t time ; void (*bsp_callback)(void); } Display_Info_struct; 1 -26

Declare a Structure Variable Containing a Field Storing a Callback Function static Display_Info_struct Display. Info; 1 -27

Define a Function That Can be Used to Register (Initialize) a Callback Function Pointer void show. Helloword() { printf("Hello world. n"); } 1 -28

Define a Function That is Used to Register (Initialize) a Callback Function Pointer void BSP_SHOW(uint 8_t time, void (*callback)(void)) { Initialize a callback function pointer Display. Info. time = time; Display. Info. bsp_callback = callback; while(Display. Info. time > 0) { --Display. Info. time; if(Display. Info. time == 0) execute a callback function { //呼叫callback function if(Display. Info. bsp_callback) Display. Info. bsp_callback(); Display. Info. bsp_callback = 0; //清除callback fnuction } delay_ms(1000); // 1 second } } 1 -29

main() void main() { //顯示 10秒的hello word字串 BSP_SHOW( 10, show. Helloword); } 1 -30

Java. Script Callbacks [w 3 schools] 1 -31

Definition • A callback is a function passed as an argument to another function. 1 -32

Example function my. Displayer(some) { document. get. Element. By. Id("demo"). inner. HTML = some; } function my. Calculator(num 1, num 2, my. Callback) { let sum = num 1 + num 2; my. Callback(sum); } my. Calculator(5, 5, my. Displayer); 1 -33

Formal Parameters • The parameters in the subprogram header are called formal parameters. • They are sometimes thought of as dummy variables because they are not variables in the usual sense: In some cases, they are bound to storage only when the subprogram is called. 1 -34

Actual Parameters • Subprogram call statements must include – the name of the subprogram – a list of parameters to be bound to the formal parameters of the subprogram. • These parameters are called actual parameters. • They must be distinguished from formal parameters because the two can have different restrictions on their forms, and of course their uses are quite different. – e. g. an actual parameter could be a constant. 1 -35

Positional Parameters • In nearly all programming languages, the correspondence between actual and formal parameters—or the binding of actual parameters to formal parameters—is done by simple position: – The first actual parameter is bound to the first formal parameter and so forth. – Such parameters are called positional parameters. • This is an effective and safe method for relatively short parameter lists. 1 -36

Keyword Parameters • When lists are long, however, it is easy for the programmer to make mistakes in the order of actual parameters in the list. • One solution to this problem is to provide keyword parameters, in which the name of the formal parameter to which an actual parameter is to be bound is specified with the actual parameter. 1 -37

Advantages of Keyword Parameters • The advantage of keyword parameters is that they can appear in any order in the actual parameter list. • Ada procedures can be called using this method, as in Sumer(Length => My_Length, List => My_Array, Sum => My_Sum); – where the definition of Sumer has the formal parameters Length, List, and Sum. 1 -38

Disadvantages of Keyword Parameters • The disadvantage to keyword parameters is that the user of the subprogram must know the names of formal parameters. 1 -39

Combining Keyword Parameters with Positional Parameters • In addition to keyword parameters, Ada and Fortran 90 allow positional parameters. • The two can be mixed in a call, as in Sumer(Length, List => My_Array, Sum => My_Sum); • The only restriction with this is that after a keyword parameter appears in the list, all remaining parameters must be keyworded. This is necessary because position may no longer be well defined after a keyword parameter has appeared. 1 -40

When the Number of Actual Parameters Is Fewer than the Number of Formal Parameters • In most languages that do not have default values formal parameters, – the number of actual parameters in a call must match – the number of formal parameters in the subprogram definition header. 1 -41

When the Number of Actual Parameters Is Fewer than the Number of Formal Parameters • However, in C, C++, Perl, and Java. Script the equal-number feature is not required. – When there are fewer actual parameters in a call than formal parameters in a function definition, it is the programmer's responsibility to ensure that the parameter correspondence, which is always positional, and the subprogram execution are sensible. 1 -42

Advantages of Variable Number of Parameters • Although this design, which allows a variable number of parameters, is clearly prone to error, it is also sometimes convenient. – For example, the printf function of C can print any number of items (data values and/or literal strings). 1 -43

Disadvantages of Variable Number of Parameters – (1) • Format string attacks. • E. g. foo() { int i, j, k; printf(“%d %d”, i); } foo caller ebp local variable : local variable parameters printf don’t match return address of foo() return address of printf() caller ebp local variables 1 -44

Disadvantages of Variable Number of Parameters – (2) • Format string attacks. • E. g. return address of foo() caller ebp foo() { char Sting. Input[100]; gets(Sting. Input); printf(Sting. Input, i); } Input: “%d %dn” local variable : local variable parameters return address of printf() caller ebp local variables 1 -45

Procedures and Functions • There are two distinct categories of subprograms: – procedures and – functions, both of which can be viewed as approaches to extending the language. 1 -46

Procedures and Statements • Procedures are collections of statements that define parameterized computations. • These computations are enacted by single call statements. • In effect, procedures define new statements. – For example, because Ada does not have a sort statement, a user can build a procedure to sort arrays of data and use a call to that procedure in place of the unavailable sort statement. • In Ada, procedure are called just that; in Fortran, they are called subroutines. 1 -47

Send back Results to the Calling Procedures • Procedures can produce results in the calling program unit by two methods. – First, if there are variables that are not formal parameters but are still visible in both the procedure and the calling program unit, the procedure can change them. – Second, if the subprogram has formal parameters that allow the transfer of data to the caller, those parameters can be changed. 1 -48

Functions • Functions structurally resemble procedures but are semantically modeled on mathematical functions. • If a function is a faithful model, it produces no side effects; that is, it modifies neither its parameters nor any variables defined outside the function. • Such a function returns a value – that is its only desired effect. • In practice, many functions in programs have side effects. 1 -49

Function Invoking and Return Value • Functions are called by appearances of their names in expressions, along with the required actual parameters. • The value produced by a function's execution is returned to the calling code, effectively replacing the call itself. – For example, the value of the expression f(x) is whatever value f produces when called with the parameter x. – For a function that does not produce side effects, the returned value is its only effect. 1 -50

Functions Define New User-defined Operators • For example, if a language does not have an exponentiation operator, a function can be written that returns the value of one of its parameters raised to the power of another parameter. • Its header in C++ could be float power (float base, float exp) which could be called with result = 3. 4 * power(10. 0, x) 1 -51

Overloaded Subprograms and Generic Subprograms • An overloaded subprogram is one that has the same name as another subprogram in the same program. • A generic subprogram is one whose computation can be done on data of different types in different calls. 1 -52

Semantics Models of Formal Parameters • Formal parameters are characterized by one of three distinct semantics models: 1. they can receive data from the corresponding actual parameter 2. they can transmit data to the actual parameter; 3. they can do both. • These three semantics models are called – in mode – out mode – inout mode 1 -53

Figure 9. 1 1 -54

Conceptual Models of How Data Transfers Take Place • There are two conceptual models of how data transfers take place in parameter transmission; – either an actual value is copied (to the caller, to the callee, or both ways) – an access path is transmitted • Most commonly, the access path is a simple – pointer or – reference. 1 -55

Implementation Models of Parameter Passing • • • Pass-by-Value Pass-by-Result Pass-by-Value-Result Pass-by-Reference Pass-by-Name 1 -56

Pass-by-Value • When a parameter is passed by value, the value of the actual parameter is used to initialize the corresponding formal parameter, which then acts as a local variable in the subprogram, thus implementing in-mode semantics. 1 -57

Approaches to Implement Pass-by-Value • Pass-by-value is normally implemented by copy, because accesses are usually more efficient with this method. • It could be implemented by transmitting an access path to the value of the actual parameter in the caller, but that would require that the value be in a write-protected cell (one that can only be read). 1 -58

Advantages of the Pass-by-Value Method • For Scalars it is fast, in access time. 1 -59

Disadvantages of the Pass-by-Value Method • The main disadvantage of the pass-by-value method if copies are used is that additional storage is required for the formal parameter, either – in the called subprogram – in some area outside both the caller and the called subprogram • In addition, the actual parameter must be copied to the storage area for the corresponding formal parameter. • The storage and the copy operations can be costly if the parameter is large, such as an array with many elements. 1 -60

Pass-by-Result • Pass-by-result is an implementation model for out-mode parameters. • When a parameter is passed by result, NO value is transmitted to the subprogram. • The corresponding formal parameter acts as a local variable, but just before control is transferred back to the caller, its value is transmitted back to the caller's actual parameter, which obviously must be a variable, 1 -61

Price of Different Implementations • If values are returned by copy (as opposed to access paths), as they typically are, passby-result also requires the extra storage and the copy operations that are required by passby-value. • As with pass-by-value, the difficulty of implementing pass-by-result by transmitting an access path usually results in its being implemented by data copy. 1 -62

Problem • One problem with the pass-by-result model is that there can be an actual parameter collision, as shown in the next slide. 1 -63

Actual Parameter Collision Problem • call sub(p 1, p 1) actual parameters – In sub, assuming the two formal parameters have different names, the two can obviously be assigned different values. – Then whichever of the two is assigned to their corresponding actual parameter last becomes the value of p 1. Thus the order in which the actual parameters are assigned determines their value. – Because the order is sometimes implementation -dependent, for some languages, different implementations can produce different results. 1 -64

Example – a C# Method void Fixer(out int x, out int y) { x = 17; y = 35; }. . . f. Fixer(out a, out a); • If at the end of the execution of Fixer the formal parameter x is assigned to its corresponding actual parameter first, the value of the actual parameter a in the caller will be 35 • If y is assigned first, the value of a in the caller will be 17. 1 -65

Another Problem of Pass-by-Result • The implementer may be able to choose between two different times to evaluate the addresses of the actual parameters; – at the time of the call or – at the time of the return. 1 -66

Example – a C# Method (1) void Do. It(out int x, out index) { x = 17 ; index = 42; }. . . sub = 21; f. Do. It(list[sub], sub); 1 -67

Example – a C# Method (2) • The address of list[sub] changes between the beginning and end of the method. • The implementer must choose the time at which the address to which to return the value will be determined, – at the time of the call or – at the time of the return. 1 -68

Example – a C# Method (3) • If the address is computed on entry to the method, the value 17 will be returned to list[21]. • If computed just before return, 17 will be returned to list[42]. • This makes programs unportable between – an implementation that chooses to evaluate the addresses for out-mode parameters at the beginning of a subprogram and – one that choose to do that evaluation at the end. 1 -69

Pass-by-Value-Result • Pass-by-value-result is an implementation model for inout-mode parameters in which actual values are copied. • It is in effect a combination of pass-by-value and pass-by-result. – The value of the actual parameter is used to initialize the corresponding formal parameter, which then acts as a local variable. • In fact, pass-by-value-result formal parameters must have local storage associated with the called subprogram. – At subprogram termination, the value of the formal parameter is transmitted back to the actual parameter. 1 -70

Alias of Pass-by-Value-Result • Pass-by-value-result is sometimes called pass-by-copy because the actual parameter is copied to the formal parameter at subprogram entry and then copied back at subprogram termination. 1 -71

Disadvantages and Problems of -by-Value-Result Pass • Pass-by-value-result shares with pass-byvalue and pass-by-result the disadvantages of – requiring multiple storage for parameters and – time for copying values. • It shares with pass-by-result the problems associated with the order in which actual parameters are assigned. 1 -72

Pass-by-Reference • Pass-by-reference is a second implementation model for inout-mode parameters. • Rather than copying data values back and forth, however, the pass-by-reference method transmits an access path, usually just an address, to the called subprogram. • This provides the access path to the cell storing the actual parameter. Thus the called subprogram is allowed to access the actual parameter in the calling program unit. • In effect, the actual parameter is shared with the called subprogram. 1 -73

Advantages • The advantage of pass-by-reference is that the passing process itself is efficient, in terms of both time and space. • Duplicate space is not required, nor is any copying required. 1 -74

Disadvantages – Indirect Addressing and Unnecessary Access • There are, however, several disadvantages to the pass-by-reference method. – First, access to the formal parameters will be slower than pass-by-value parameters, because of the additional level of indirect addressing that is required. – Second, if only one-way communication to the called subprogram is required, inadvertent and erroneous changes may be made to the actual parameter. 1 -75

Disadvantages – Alias (1) • Another serious problem of pass -by-reference is that aliases can be created. • This should be expected because passby-reference makes access paths available to the called subprograms, thereby broadening their access to nonlocal variables. 1 -76

Disadvantages – Alias (2) • The problem with these kinds of aliasing is the same as in other circumstance: – It is harmful to readability and thus to reliability. – It also makes program verification extremely difficult. 1 -77

Aliases – (1) • When parameters are passed by reference, collisions can occur between actual parameters. • Consider a C function procedure that has two parameters that are to be passed by reference, as in void fun(int *first, int *second) • If the call to fun happens to pass the same variable twice, as in fun(&total, &total) then first and second in fun will be aliases. 1 -78

Aliases – (2) • Collisions between array elements can also cause aliases. • For example: – Suppose the function fun is called with two array elements that are specified with variable subscripts, as in fun(&list[i], &list[j]). – If i is equal to j, then first and second are again aliases. 1 -79

Aliases – (3) • Collisions between call-by-reference formal parameters and nonlocal variables that are visible. • For example, consider the following C code: int *global; void main() {. . . sub(global); . . . } void sub(int *param) {. . . } – Inside sub, param and global are alias. 1 -80

Pass-by-Name • When parameters are passed by name, the actual parameter is, in effect, textually substituted for the corresponding formal parameter in all its occurrences in the subprogram. 1 -81

Example - Algol procedure double(x); real x; begin x : = x * 2 end; • In general, the effect of pass-by-name is to textually substitute the argument expressions in a procedure call for the corresponding parameters in the body of the procedure, e. g. , double(C[j]) is interpreted as C[j] : = C[j] * 2. 1 -82

Pass-By-Name Security Problem procedure swap (a, b); integer a, b, temp; begin temp : = a; a : = b; b: = temp end; • Effect of the call swap(i, x[i]): temp : = i; i : = x[i]; x[i] : = temp It doesn't work! For example: 1 -83

Run-Time Stacks and Parameter Passing • In most contemporary languages, parameter communication takes place through the run-time stack. • The run-time stack is used extensively for subprogram control linkage (e. g. return address and caller ebp) and parameter passing, as discussed in Chapter 10. 1 -84

Assumption • In the following discussion, the author assumes that the stack is used for all parameter transmission. 1 -85

Handling Pass-by-Value Parameters • Pass-by-value parameters have their values copied into stack locations. • The stack locations then serve as storage for the corresponding formal parameters. • C uses pass-by-value – In C Pass-by-reference (inout mode) semantics is achieved by using pointers as parameters. 1 -86

Handling Pass-by-Result Parameters • Pass-by-result parameters are implemented as the opposite of pass-by-value. • The values assigned to the pass-by-result actual parameters are placed in the stack, where they can be retrieved by the calling program unit upon termination of the called subprogram. 1 -87

Handling Pass-by-Value-Result Parameters • Pass-by-value-result parameters can be implemented directly from their semantics as a combination of pass-by-value and pass-by-result. • The stack location for the parameters is initialized by the call and is then used like a local variable in the called subprogram. 1 -88

Handling Pass-by-Reference Parameters • Pass-by-reference parameters are perhaps the simplest to implement. • Regardless of the type of the actual parameter, only its address must be placed in the stack. 1 -89

Figure 9. 2 (1) stack code 1 -90

Figure 9. 2 (2) • sub is called from main with the call sub(w, x, y, z) , – – w x y z is is passed by by value result value-result reference • Function header void sub (int a, int b, int c, int d) 1 -91

Supplement 1 -92

Figure 9. 2 1 -93