Chapter 6 Pointers

Total Page:16

File Type:pdf, Size:1020Kb

Chapter 6 Pointers Chapter Pointers In the preceding chapters our programs have b een written to access ob jects directly ie using the variable names Wehave p ostp oned until now a discussion of the concept of indirect access ie access of ob jects using their address As wehave seen variables lo cal to a function may b e accessed using their name only within that function When arguments are passed to another function only the values are passed and the cal led function may use these values but cannot aect the variable cells in the cal ling function Sometimes however a function needs to have direct access to the cells in another function This can b e done in C through indirect access using the address of the cell called a p ointer In this chapter we will intro duce the concepts of indirect access p ointer typ es and dereferenced p ointer variables We will use these concepts to write functions that indirectly access ob jects in a calling function What is a Pointer Frequentlya cal led function needs to makechanges to ob jects declared in the cal ling function For example the function scanf needs to access ob jects in the calling function to store the data read and converted into an ob ject dened there Therefore wesupply scanf with the address y function can indirectly access an of ob jects rather than their values Here we will see howan ob ject by its address Another common use of p ointers is to write functions that return more than one value As wehave seen every function in C returns a value as the value of the function however if a functions meaning includes the return of several pieces of information this single return value is not sucient In these cases wecanhave the function return multiple data values indirectly using p ointers CHAPTER POINTERS Data vs Address Before we discuss passing p ointers and indirectly accessing data b etween functions let us lo ok at howwe can declare p ointer variables and access data using them Consider the following simple program main int x int iptr printfTesting Pointer Variablesn x iptr x printfdniptr Wehave declared twointegers xintended to hold an integer value and iptr whichisintended to hold a p ointer to an integer ie and address of an integer We then assign a value to xand the address of x to the variable iptr using the address of op erator The address of a variable is simply the byte address of the cell whichwas allo cated by the declaration An address is an integer actually and unsigned integer so may b e stored in an int typ e variable The situation is shown in Figure a When we compile and execute this program the result is Testing Pointer Variables What if wehadwanted to printthevalue of the cell p ointedtoby iptr and not the value of accesses the ob ject p ointed to by its op erand In our iptr itself The indirection op erator example the value of iptr is which is an address of some ob ject ie iptr p oints to some ob ject lo cated at address So we should b e able to access that ob ject with an expression like iptr However there is no waytoknowhowmanybytes to access at address nor howtointerpret the data unless the typ e of ob ject at address is known is it an intafloatachar etc In order for the compiler to knowhow to access an ob ject indirectlyitmust know the typ e of that ob ject We sp ecify the typ e of ob ject to access by indicating to the compiler the typ e of ob jects a p ointer refers to when we declare the p ointer So in our example we should declare the variable iptr asapointertoaninteger as follows int iptr WHAT IS A POINTER or int iptr white space may separate the op erator andthevariable name iptr The declaration sp ecies avariable iptroftyp e int ieinteger p ointer the typ e is read directly from the declaration So int is the typ e of iptrand int is the typ e of iptr the thing it p oints to This statement declares an integer p ointer variable iptr and allo cates memory for a p ointer variable Similarly we can declare float p ointers or character p ointers float pa pb char pc These statements declare variables pa and pbwhichcanpointto float typ e ob jects and pc which can p ointtoachar typ e ob ject All p ointer variables store addresses which are unsigned integers and so need the same amount of memory space regardless of the p ointer typ es Since the compiler now knows that iptr points to an integer ob ject it can access the ob ject correctly Our simple program b ecomes main int x int iptr printfTesting Pointer Variablesn x iptr x printfAddress d holds value dniptriptr which pro duces the output Testing Pointer Variables Address holds value We are generally not interested in the value of the p ointer variable itself it mayeven b e dierent each time a program is run Instead weareinterested in the cell the p ointerispointing to so we indicate the value of a p ointer variable in diagrams and program traces using an arrowas shown in Figure b In summary the address of an ob ject is called a p ointer to that ob ject since the address tells one where to go in order to access the ob ject The address by itself do es not provide sucient CHAPTER POINTERS main intx int iptr a main intx int iptr b Figure Declaring Pointer Variables WHAT IS A POINTER information to access an ob ject wemust know what typ e of ob ject the address is p ointing to If the p ointer address value and the data typ e of the ob ject that it p oints to are b oth known then it is p ossible to access the ob ject correctly In other words p ointers must b e sp ecied to b e int p ointers p ointing to an integer typ e ob ject float pointers p ointing to a oating p ointtyp e ob ject char p ointers etc Indirect Access of Values The indirection op erator accesses an ob ject of a sp ecied typ e at an address Accessing an ob ject by its address is called indirect accessThus iptr indirectly accesses the ob ject that iptr points to ie iptr accesses x The indirection op erator is also called the contents of op erator or the dereference op erator Applying the indirection op erator to a p ointer variable is referred to as dereferencing the p ointer variable ie iptr dereferences iptr The address of op erator is used to get the address of an ob ject Wehave already used it in calls to scanf We can also use it to assign a value to a p ointer variable Let us consider some examples using the following declarations int x z float y char ch pch int pi pi float pf When these declarations are encountered memory cells are allo cated for these variables at some addresses as shown in Figure Variables x and z are int typ es y is floatand ch is char Pointer variables pi and pi are variables that can p ointtointegers pf is a float pointer and pch isacharacter p ointer Note that the initial values of all variables including p ointer variables are unknown Just as wemust initialize int and float variables wemust also initialize p ointer variables Here are some examples x y z pi x pi points to x pi z pipointstoz pch ch pchpointstoch The result of executing these statements is shown in Figure pi points to the cell for the variable x pi p oints to z pch p oints to chand pf still contains garbage Rememb er the value of a p ointer variable is stored as an address in the cell however we do not need to b e concerned with the v alue itself Instead our gure simply shows what the initialized p ointer variables p oint CHAPTER POINTERS main intx intz oat y char ch int pi intpi oat pf char p ch Figure Declaration of Pointer Variables main intx intz oat y char ch int pi intpi oat pf char p ch Figure Assignments of p ointers WHAT IS A POINTER main intx intz oat y char ch CO C C C C C C C C C C C C int pi intpi oat pf char p ch Figure Eect of Pointer to Pointer Assignment Statement to These initialized p ointers maynow b e used to indirectly access the ob jects they p oint to or they b e maybechanged by new assignments Here are some examples of statements and how they change things for the ab ove memory organization The statements are numb ered in order to reference them the numb ers are not part of the co de pi pi pi points to where pi points ie pi x pi now points to z pi still points to x pi z ie pi z pi x pi pi zxiez pi zxisunchanged pi pi x z is unchanged Statement Assigns value of pi to piso pi now also p oints to x see Figure Since b oth of the variables are typ e int this assignmentisallowed Statement Makes pi pointtoz see Figure The expression z evaluates to the address of z ie an int pointer Statement Since pi points to xthevalue of the right hand side pi dereferences the p ointer and evaluates to the value in the cell ie This value is assigned to the ob ject accessed by the left hand side pi ie the place p ointed to by pi or the CHAPTER POINTERS main intx intz oat y char ch CO C C C C C C C C C C C C int pi intpi oat pf char p ch Figure Eect of Pointer Reassignment Statement ob ject z see Figure This has the same eect as the assignment zx Note wehave used a dereferenced p ointer variable as the Lvalue on the left hand side of an assignment op erator The semantics is to access the ob ject indirectly and store the value of the expression on the righthandside Statement The value is assigned to piie z see Figure Again wehave used an indirect access for the Lvalue of the assignment Statement The right hand side evaluates to since is added to pi so is assigned to pi ie x see Figure Again wehave used an indirect access on b oth
Recommended publications
  • Assignment 6: Subtyping and Bidirectional Typing
    Assignment 6: Subtyping and Bidirectional Typing 15-312: Foundations of Programming Languages Joshua Dunfield ([email protected]) Out: Thursday, October 24, 2002 Due: Thursday, November 7 (11:59:59 pm) 100 points total + (up to) 20 points extra credit 1 Introduction In this assignment, you will implement a bidirectional typechecker for MinML with , , +, 1, 0, , , and subtyping with base types int and float. ! ∗ 8 9 Note: In the .sml files, most changes from Assignment 4 are indicated like this: (* new asst6 code: *) ... (* end asst6 code *) 2 New in this assignment Some things have become obsolete (and have either been removed or left • in a semi-supported state). Exceptions and continuations are no longer “officially” supported. One can now (and sometimes must!) write type annotations e : τ. The • abstract syntax constructor is called Anno. The lexer supports shell-style comments in .mml source files: any line • beginning with # is ignored. There are now two valid syntaxes for functions, the old syntax fun f (x:t1):t2 is e end • and a new syntax fun f(x) is e end. Note the lack of type anno- tations. The definition of the abstract syntax constructor Fun has been changed; its arguments are now just bindings for f and x and the body. It no longer takes two types. 1 The old syntax fun f(x:t1):t2 is e end is now just syntactic sugar, transformed by the parser into fun f(x) is e end : t1 -> t2. There are floating point numbers, written as in SML. There is a new set of • arithmetic operators +., -., *., ˜.
    [Show full text]
  • (901133) Instructor: Eng
    home Al-Albayt University Computer Science Department C++ Programming 1 (901133) Instructor: Eng. Rami Jaradat [email protected] 1 home Subjects 1. Introduction to C++ Programming 2. Control Structures 3. Functions 4. Arrays 5. Pointers 6. Strings 2 home 1 - Introduction to C++ Programming 3 home What is computer? • Computers are programmable devices capable of performing computations and making logical decisions. • Computers can store, retrieve, and process data according to a list of instructions • Hardware is the physical part of the compute: keyboard, screen, mouse, disks, memory, and processing units • Software is a collection of computer programs, procedures and documentation that perform some tasks on a computer system 4 home Computer Logical Units • Input unit – obtains information (data) from input devices • Output unit – outputs information to output device or to control other devices. • Memory unit – Rapid access, low capacity, stores information • Secondary storage unit – cheap, long-term, high-capacity storage, stores inactive programs • Arithmetic and logic unit (ALU) – performs arithmetic calculations and logic decisions • Central processing unit (CPU): – supervises and coordinates the other sections of the computer 5 home Computer language • Machine languages: machine dependent, it consists of strings of numbers giving machine specific instructions: +1300042774 +1400593419 +1200274027 • Assembly languages: English-like abbreviations representing elementary operations, assemblers convert assembly language to machine
    [Show full text]
  • Explicitly Implicifying Explicit Constructors
    Explicitly Implicifying explicit Constructors Document number: P1163R0 Date: 2018-08-31 Project: Programming Language C++, Library Working Group Reply-to: Nevin “☺” Liber, [email protected] or [email protected] Table of Contents Revision History ................................................................................................................ 3 P11630R0 .................................................................................................................................... 3 Introduction ....................................................................................................................... 4 Motivation and Scope ....................................................................................................... 5 Impact On the Standard ................................................................................................... 6 Policy .................................................................................................................................. 7 Design Decisions ................................................................................................................ 8 Technical Specifications ................................................................................................... 9 [template.bitset]........................................................................................................................ 10 [bitset.cons] ..............................................................................................................................
    [Show full text]
  • The Cool Reference Manual∗
    The Cool Reference Manual∗ Contents 1 Introduction 3 2 Getting Started 3 3 Classes 4 3.1 Features . 4 3.2 Inheritance . 5 4 Types 6 4.1 SELF TYPE ........................................... 6 4.2 Type Checking . 7 5 Attributes 8 5.1 Void................................................ 8 6 Methods 8 7 Expressions 9 7.1 Constants . 9 7.2 Identifiers . 9 7.3 Assignment . 9 7.4 Dispatch . 10 7.5 Conditionals . 10 7.6 Loops . 11 7.7 Blocks . 11 7.8 Let . 11 7.9 Case . 12 7.10 New . 12 7.11 Isvoid . 12 7.12 Arithmetic and Comparison Operations . 13 ∗Copyright c 1995-2000 by Alex Aiken. All rights reserved. 1 8 Basic Classes 13 8.1 Object . 13 8.2 IO ................................................. 13 8.3 Int................................................. 14 8.4 String . 14 8.5 Bool . 14 9 Main Class 14 10 Lexical Structure 14 10.1 Integers, Identifiers, and Special Notation . 15 10.2 Strings . 15 10.3 Comments . 15 10.4 Keywords . 15 10.5 White Space . 15 11 Cool Syntax 17 11.1 Precedence . 17 12 Type Rules 17 12.1 Type Environments . 17 12.2 Type Checking Rules . 18 13 Operational Semantics 22 13.1 Environment and the Store . 22 13.2 Syntax for Cool Objects . 24 13.3 Class definitions . 24 13.4 Operational Rules . 25 14 Acknowledgements 30 2 1 Introduction This manual describes the programming language Cool: the Classroom Object-Oriented Language. Cool is a small language that can be implemented with reasonable effort in a one semester course. Still, Cool retains many of the features of modern programming languages including objects, static typing, and automatic memory management.
    [Show full text]
  • Generic Immutability and Nullity Types for an Imperative Object-Oriented Programming Language with flexible Initialization
    Generic Immutability and Nullity Types for an imperative object-oriented programming language with flexible initialization James Elford June 21, 2012 Abstract We present a type system for parametric object mutability and ref- erence nullity in an imperative object oriented language. We present a simple but powerful system for generic nullity constraints, and build on previous work to provide safe initialization of objects which is not bound to constructors. The system is expressive enough to handle initialization of cyclic immutable data structures, and to enforce their cyclic nature through the type system. We provide the crucial parts of soundness ar- guments (though the full proof is not yet complete). Our arguments are novel, in that they do not require auxiliary runtime constructs (ghost state) in order to express or demonstrate our desired properties. 2 Contents 1 Introduction 4 1.1 In this document . .5 2 Background 6 2.1 Parametric Types . .6 2.1.1 Static Polymorphism through Templates . .7 2.1.2 Static Polymorphism through Generic Types . 12 2.2 Immutability . 18 2.2.1 Immutability in C++ .................... 19 2.2.2 Immutability in Java and C# ............... 21 2.2.3 An extension to Java's immutability model . 21 2.2.4 Parametric Immutability Constraints . 24 2.3 IGJ: Immutability Generic Java .................. 25 2.4 Nullity . 27 2.5 Areas of commonality . 30 3 Goals 32 4 Existing systems in more detail 34 4.1 The initialization problem . 34 4.2 What do we require from initialization? . 35 4.3 Approaches to initialization . 37 4.4 Delay Types and initialization using stack-local regions .
    [Show full text]
  • C DEFINES and C++ TEMPLATES Professor Ken Birman
    Professor Ken Birman C DEFINES AND C++ TEMPLATES CS4414 Lecture 10 CORNELL CS4414 - FALL 2020. 1 COMPILE TIME “COMPUTING” In lecture 9 we learned about const, constexpr and saw that C++ really depends heavily on these Ken’s solution to homework 2 runs about 10% faster with extensive use of these annotations Constexpr underlies the “auto” keyword and can sometimes eliminate entire functions by precomputing their results at compile time. Parallel C++ code would look ugly without normal code structuring. Const and constexpr allow the compiler to see “beyond” that and recognize parallelizable code paths. CORNELL CS4414 - FALL 2020. 2 … BUT HOW FAR CAN WE TAKE THIS IDEA? Today we will look at the concept of programming the compiler using the templating layer of C++ We will see that it is a powerful tool! There are also programmable aspects of Linux, and of the modern hardware we use. By controlling the whole system, we gain speed and predictability while writing elegant, clean code. CORNELL CS4414 - FALL 2020. 3 IDEA MAP FOR TODAY History of generics: #define in C Templates are easy to create, if you stick to basics The big benefit compared to Java is that a template We have seen a number of parameterized is a compile-time construct, whereas in Java a generic types in C++, like std::vector and std::map is a run-time construct. The template language is Turing-complete, but computes These are examples of “templates”. only on types, not data from the program (even when They are like generics in Java constants are provided).
    [Show full text]
  • Class Notes on Type Inference 2018 Edition Chuck Liang Hofstra University Computer Science
    Class Notes on Type Inference 2018 edition Chuck Liang Hofstra University Computer Science Background and Introduction Many modern programming languages that are designed for applications programming im- pose typing disciplines on the construction of programs. In constrast to untyped languages such as Scheme/Perl/Python/JS, etc, and weakly typed languages such as C, a strongly typed language (C#/Java, Ada, F#, etc ...) place constraints on how programs can be written. A type system ensures that programs observe logical structure. The origins of type theory stretches back to the early twentieth century in the work of Bertrand Russell and Alfred N. Whitehead and their \Principia Mathematica." They observed that our language, if not restrained, can lead to unsolvable paradoxes. Specifically, let's say a mathematician defined S to be the set of all sets that do not contain themselves. That is: S = fall A : A 62 Ag Then it is valid to ask the question does S contain itself (S 2 S?). If the answer is yes, then by definition of S, S is one of the 'A's, and thus S 62 S. But if S 62 S, then S is one of those sets that do not contain themselves, and so it must be that S 2 S! This observation is known as Russell's Paradox. In order to avoid this paradox, the language of mathematics (or any language for that matter) must be constrained so that the set S cannot be defined. This is one of many discoveries that resulted from the careful study of language, logic and meaning that formed the foundation of twentieth century analytical philosophy and abstract mathematics, and also that of computer science.
    [Show full text]
  • C Programming Tutorial
    C Programming Tutorial C PROGRAMMING TUTORIAL Simply Easy Learning by tutorialspoint.com tutorialspoint.com i COPYRIGHT & DISCLAIMER NOTICE All the content and graphics on this tutorial are the property of tutorialspoint.com. Any content from tutorialspoint.com or this tutorial may not be redistributed or reproduced in any way, shape, or form without the written permission of tutorialspoint.com. Failure to do so is a violation of copyright laws. This tutorial may contain inaccuracies or errors and tutorialspoint provides no guarantee regarding the accuracy of the site or its contents including this tutorial. If you discover that the tutorialspoint.com site or this tutorial content contains some errors, please contact us at [email protected] ii Table of Contents C Language Overview .............................................................. 1 Facts about C ............................................................................................... 1 Why to use C ? ............................................................................................. 2 C Programs .................................................................................................. 2 C Environment Setup ............................................................... 3 Text Editor ................................................................................................... 3 The C Compiler ............................................................................................ 3 Installation on Unix/Linux ............................................................................
    [Show full text]
  • 2.2 Pointers
    2.2 Pointers 1 Department of CSE Objectives • To understand the need and application of pointers • To learn how to declare a pointer and how it is represented in memory • To learn the relation between arrays and pointers • To study the need for call-by-reference • To distinguish between some special types of pointers 2 Department of CSE Agenda • Basics of Pointers • Declaration and Memory Representation • Operators associated with pointers • address of operator • dereferencing operator • Arrays and Pointers. • Compatibility of pointers • Functions and Pointers • Special types of pointers • void pointer • null pointer • constant pointers • dangling pointers • pointer to pointer 3 Department of CSE Introduction • A pointer is defined as a variable whose value is the address of another variable. • It is mandatory to declare a pointer before using it to store any variable address. 4 Department of CSE Pointer Declaration • General form of a pointer variable declaration:- datatype *ptrname; • Eg:- • int *p; (p is a pointer that can point only integer variables) • float *fp; (fp can point only floating-point variables) • Actual data type of the value of all pointers is a long hexadecimal number that represents a memory address 5 Department of CSE Initialization of Pointer Variable • Uninitialized pointers will have some unknown memory address in them. • Initialize/ Assign a valid memory address to the pointer. Initialization Assignment int a; int a; int *p = &a; int *p; p = &a; • The variable should be defined before pointer. • Initializing pointer to NULL int *p = NULL; 6 Department of CSE Why Pointers? • Manages memory more efficiently. • Leads to more compact and efficient code than that can be obtained in other ways • One way to have a function modify the actual value of a variable passed to it.
    [Show full text]
  • IDENTIFYING PROGRAMMING IDIOMS in C++ GENERIC LIBRARIES a Thesis Submitted to Kent State University in Partial Fulfillment of Th
    IDENTIFYING PROGRAMMING IDIOMS IN C++ GENERIC LIBRARIES A thesis submitted to Kent State University in partial fulfillment of the requirements for the degree of Masters of Science by Ryan Holeman December, 2009 Thesis written by Ryan Holeman B.S., Kent State University, USA 2007 M.S., Kent State University, USA 2009 Approved by Jonathan I. Maletic, Advisor Robert A. Walker, Chair, Department of Computer Science John Stalvey, Dean, College of Arts and Sciences ii TABLE OF CONTENTS LIST OF FIGURES ........................................................................................................VI LIST OF TABLES ........................................................................................................... X DEDICATION.................................................................................................................XI ACKNOWLEDGEMENTS ......................................................................................... XII CHAPTER 1 INTRODUCTION..................................................................................... 1 1.1 Motivation ................................................................................................................. 2 1.2 Research Contributions ............................................................................................. 2 1.3 Organization .............................................................................................................. 3 CHAPTER 2 RELATED WORK...................................................................................
    [Show full text]
  • The RPC Abstraction
    The RPC abstraction • Procedure calls well-understood mechanism - Transfer control and data on single computer • Goal: Make distributed programming look same - Code libraries provide APIs to access functionality - Have servers export interfaces accessible through local APIs • Implement RPC through request-response protocol - Procedure call generates network request to server - Server return generates response Interface Definition Languages • Idea: Specify RPC call and return types in IDL • Compile interface description with IDL compiler. Output: - Native language types (e.g., C/Java/C++ structs/classes) - Code to marshal (serialize) native types into byte streams - Stub routines on client to forward requests to server • Stub routines handle communication details - Helps maintain RPC transparency, but - Still had to bind client to a particular server - Still need to worry about failures Intro to SUN RPC • Simple, no-frills, widely-used RPC standard - Does not emulate pointer passing or distributed objects - Programs and procedures simply referenced by numbers - Client must know server—no automatic location - Portmap service maps program #s to TCP/UDP port #s • IDL: XDR – eXternal Data Representation - Compilers for multiple languages (C, java, C++) Sun XDR • “External Data Representation” - Describes argument and result types: struct message { int opcode; opaque cookie[8]; string name<255>; }; - Types can be passed across the network • Libasync rpcc compiles to C++ - Converts messages to native data structures - Generates marshaling routines (struct $ byte stream) - Generates info for stub routines Basic data types • int var – 32-bit signed integer - wire rep: big endian (0x11223344 ! 0x11, 0x22, 0x33, 0x44) - rpcc rep: int32 t var • hyper var – 64-bit signed integer - wire rep: big endian - rpcc rep: int64 t var • unsigned int var, unsigned hyper var - wire rep: same as signed - rpcc rep: u int32 t var, u int64 t var More basic types • void – No data - wire rep: 0 bytes of data • enum {name = constant,.
    [Show full text]
  • Trends in Modern Exception Handling Trendy We
    Computer Science • Vol. 5 • 2003 Marcin Kuta* TRENDS IN M ODERN EXCEPTION HANDLING Exception handling is nowadays a necessary cornponent of error proof Information systems. The paper presents overview of techni ues and models of exception handling, problems con- nected with them and potential Solutions. The aspects of implementation of propagation mechanisms and exception handling, their effect on semantics and genera program efhcJen- cy are also taken into account. Presented mechanisms were adopted to modern programming languages. Considering design area, formal methods and formal verihcation of program pro- perties we can notice exception handling mechanisms are weakly present what makes a field for futur research. Keywords: exception handling, exception propagation, resumption model, terrnination model TRENDY WE WSPÓŁCZESNEJ OBSŁUDZE WYJĄ TKÓW Obs uga wyj tków jest wspó cze nie nieodzownym sk adnikiem systemów informatycznych odpornych na b dy. W artykule przedstawiono przegl d technik i modeli obs ugi b dów, zwi zane z nimi problemy oraz ich potencjalne rozwi zania. Uwzgl dniono równie zagad nienia dotycz ce implementacji mechanizmów propagacji i obs ugi b dów, ich wp yw na semantyk oraz ogóln efektywno programów. Przedstawione mechanizmy znalaz y zasto sowanie we wspó czesnych j zykach programowania. Je li chodzi o dziedzin projektowania, metody formalne oraz formalne dowodzenie w asno ci, to mechanizmy obs ugi wyj tków nie s w nich dostatecznie reprezentowane, co stanowi pole dla nowych bada . Słowa kluczowe: obs uga b dów, progagacja wyj tków, semantyka wznawiania, semantyka zako czenia 1. Int roduct ion Analysing modern Computer systems we notice increasing efforts to deal with problem of software reliability.
    [Show full text]