CS61C : Machine Structures

Similar documents
CS61C : Machine Structures

CS61C : Machine Structures

CS61C : Machine Structures

Number review... Lecture 3 Introduction to the C Programming Language (pt 1) Has there been an update to ANSI C?

CS61C Machine Structures. Lecture 3 Introduction to the C Programming Language. 1/23/2006 John Wawrzynek. www-inst.eecs.berkeley.

Two s Complement Review. Two s Complement Review. Agenda. Agenda 6/21/2011

Processor. Lecture #2 Number Rep & Intro to C classic components of all computers Control Datapath Memory Input Output

CS61C : Machine Structures

Processor. Lecture #2 Number Rep & Intro to C classic components of all computers Control Datapath Memory Input Output }

IT 252 Computer Organization and Architecture Introduction to the C Programming Language

Topics Introduction to Microprocessors

CS 61C: Great Ideas in Computer Architecture (Machine Structures) Introduc)on to C (Part I) We are here!

C: Introduction, Pointers Instructors: Steven Ho, Nick Riasanovsky

HW1 due Monday by 9:30am Assignment online, submission details to come

CS 61c: Great Ideas in Computer Architecture

Agenda. Address vs. Value Consider memory to be a single huge array. Review. Pointer Syntax. Pointers 9/9/12

Intro to C: Pointers and Arrays

More C Pointer Dangers

CS61CL : Machine Structures

Number Review. Lecture #3 More C intro, C Strings, Arrays, & Malloc Variables. Clarification about counting down

Agenda. Peer Instruction Question 1. Peer Instruction Answer 1. Peer Instruction Question 2 6/22/2011

CS 61C: Great Ideas in Computer Architecture Introduction to C

CS 61C: Great Ideas in Computer Architecture Lecture 2: Introduction to C, Part I

CS 110 Computer Architecture. Lecture 2: Introduction to C, Part I. Instructor: Sören Schwertfeger.

CS61C : Machine Structures

CS 110 Computer Architecture. Lecture 2: Introduction to C, Part I. Instructor: Sören Schwertfeger.

CS 61C: Great Ideas in Computer Architecture C Pointers. Instructors: Vladimir Stojanovic & Nicholas Weaver

CS61C : Machine Structures

Agenda. CS 61C: Great Ideas in Computer Architecture. Lecture 2: Numbers & C Language 8/29/17. Recap: Binary Number Conversion

CS 61C: Great Ideas in Computer Architecture. Lecture 2: Numbers & C Language. Krste Asanović & Randy Katz

CS 61C: Great Ideas in Computer Architecture Lecture 2: Introduction to C, Part I

CS61C : Machine Structures

Review! * follows a pointer to its value! & gets the address of a variable! Pearce, Summer 2010 UCB! ! int x = 1000; Pearce, Summer 2010 UCB!

CS 102 Computer Architecture. Lecture 2: Introduction to C, Part I. Instructor: Sören Schwertfeger.

CS 61C: Great Ideas in Computer Architecture Introduc=on to C, Part I. We are here!

Number Representation & I See The C

Review: C Strings. A string in C is just an array of characters. Lecture #4 C Strings, Arrays, & Malloc

CS61C : Machine Structures

CS61C : Machine Structures

CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 13, FALL 2012

CS61C Machine Structures. Lecture 4 C Pointers and Arrays. 1/25/2006 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/

CS61C : Machine Structures

CS 61C: Great Ideas in Computer Architecture. C Arrays, Strings, More Pointers

CS 261 Fall C Introduction. Variables, Memory Model, Pointers, and Debugging. Mike Lam, Professor

377 Student Guide to C++

CS61C Machine Structures. Lecture 4 C Structs & Memory Management. 9/5/2007 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/

Review! Lecture 5 C Memory Management !

Lecture #6 Intro MIPS; Load & Store

CS61C Machine Structures. Lecture 5 C Structs & Memory Mangement. 1/27/2006 John Wawrzynek. www-inst.eecs.berkeley.edu/~cs61c/

Instructor: Randy H. Katz hbp://inst.eecs.berkeley.edu/~cs61c/fa13. Fall Lecture #4. Agenda

CS61C : Machine Structures

CS 61c: Great Ideas in Computer Architecture

CSE 303: Concepts and Tools for Software Development

CS61C : Machine Structures

Programming in C. What is C?... What is C?

Programming in C UVic SEng 265

SWEN-250 Personal SE. Introduction to C

CS 326 Operating Systems C Programming. Greg Benson Department of Computer Science University of San Francisco

CSE 374 Programming Concepts & Tools

Programming in C. What is C?... What is C?

unsigned char memory[] STACK ¼ 0x xC of address space globals function KERNEL code local variables

Important From Last Time

ECE 250 / CS 250 Computer Architecture. C to Binary: Memory & Data Representations. Benjamin Lee

Lecture 03 Bits, Bytes and Data Types

C Introduction. Comparison w/ Java, Memory Model, and Pointers

Important From Last Time

C Review. MaxMSP Developers Workshop Summer 2009 CNMAT

ELEC 377 C Programming Tutorial. ELEC Operating Systems

Introduction to C. Sean Ogden. Cornell CS 4411, August 30, Geared toward programmers

CS 610: Intermediate Programming: C/C++ Making Programs General An Introduction to Linked Lists

CS 61C: Great Ideas in Computer Architecture Introduc)on to C, Part II

Programming refresher and intro to C programming

Programming Language Basics

Lecture 2, September 4

C Compilation Model. Comp-206 : Introduction to Software Systems Lecture 9. Alexandre Denault Computer Science McGill University Fall 2006

COMP 2355 Introduction to Systems Programming

Page 1. Today. Important From Last Time. Is the assembly code right? Is the assembly code right? Which compiler is right?

Final CSE 131B Spring 2004

CS 220: Introduction to Parallel Computing. Beginning C. Lecture 2

CS61C : Machine Structures

Announcements. CSCI 334: Principles of Programming Languages. Lecture 18: C/C++ Announcements. Announcements. Instructor: Dan Barowy

Summary of Last Class. Processes. C vs. Java. C vs. Java (cont.) C vs. Java (cont.) Tevfik Ko!ar. CSC Systems Programming Fall 2008

Data III & Integers I

ECE 15B COMPUTER ORGANIZATION

Numbers: positional notation. CS61C Machine Structures. Faux Midterm Review Jaein Jeong Cheng Tien Ee. www-inst.eecs.berkeley.

Lectures 5-6: Introduction to C

Introduction to C. Ayush Dubey. Cornell CS 4411, August 31, Geared toward programmers

CS61C : Machine Structures

Under the Hood: Data Representations, Memory and Bit Operations. Computer Science 104 Lecture 3

Introduction to C. Robert Escriva. Cornell CS 4411, August 30, Geared toward programmers

How about them A s!! Go Oaktown!! CS61C - Machine Structures. Lecture 4 C Structures Memory Management Dan Garcia.

C Language Part 1 Digital Computer Concept and Practice Copyright 2012 by Jaejin Lee

Lectures 13 & 14. memory management

Computing Science 114 Solutions to Midterm Examination Tuesday October 19, In Questions 1 20, Circle EXACTLY ONE choice as the best answer

Computer Science 322 Operating Systems Mount Holyoke College Spring Topic Notes: C and Unix Overview

CMSC 313 COMPUTER ORGANIZATION & ASSEMBLY LANGUAGE PROGRAMMING LECTURE 13, SPRING 2013

Agenda. Components of a Computer. Computer Memory Type Name Addr Value. Pointer Type. Pointers. CS 61C: Great Ideas in Computer Architecture

CS 61C: Great Ideas in Computer Architecture. Lecture 3: Pointers. Krste Asanović & Randy Katz

review Pointers and arrays are virtually same C knows how to increment pointers C is an efficient language, with little protection

A brief introduction to C programming for Java programmers

Transcription:

inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture 3 Introduction to the C Programming Language (pt 1)!!Lecturer SOE Dan Garcia!!!www.cs.berkeley.edu/~ddgarcia CS61C L03 Introduction to C (pt 1) (1)! 2010-01-25! MIPS Supercomputer Chinaʼs next supercomputer (the Dawning 6000) will be built using the Loongson (MIPS) processor and run Linux. Currently, the top 500 supercomputers are mostly x86 chips. Youʼll learn MIPS in CS61C! www.technologyreview.com/computing/24374/

And in review...! META: We often make design decisions to make HW simple! We represent things in computers as particular bit patterns: N bits 2 N things!! These 5 integer encodings have different benefits; 1s complement and sign/mag have most problems.! unsigned (C99ʼs uintn_t) : 00000 00001... 01111 10000... 11111 2ʼs complement (C99ʼs intn_t) universal, learn!! 00000 00001... 01111 10000... 11110 11111 Overflow: numbers ; computers finite,errors!! CS61C L03 Introduction to C (pt 1) (2)! META: Ainʼt no free lunch!

Introduction to C! Officially, some C experience is required before CS61C! 2010Sp an experiment!! What to do if youʼre in that 10%?! Start early, ask questions as soon as they come up!! CS61C L03 Introduction to C (pt 1) (3)!

Has there been an update to ANSI C?! Yes! Itʼs called the C99 or C9x std! You need gcc -std=c99 to compile! References! http://en.wikipedia.org/wiki/c99 http://home.tiscalinet.ch/t_wolf/tw/c/c9x_changes.html! Highlights! Declarations in for loops, like Java (#15)! Java-like // comments (to end of line) (#10)! Variable-length non-global arrays (#33) <inttypes.h>: explicit integer types (#38)! <stdbool.h> for boolean logic defʼs (#35)! CS61C L03 Introduction to C (pt 1) (4)!

Disclaimer! Important: You will not learn how to fully code in C in these lectures! Youʼll still need your C reference for this course.! K&R is a must-have reference! Check online for more sources! JAVA in a Nutshell, OʼReilly.! Chapter 2, How Java Differs from C! http://oreilly.com/catalog/javanut/excerpt/! Brian Harveyʼs course notes! On CS61C class website! CS61C L03 Introduction to C (pt 1) (5)!

Compilation : Overview!!C compilers take C and convert it into an architecture specific machine code (string of 1s and 0s).! Unlike Java which converts to architecture independent bytecode.! Unlike most Scheme environments which interpret the code.! These differ mainly in when your program is converted to machine instructions.! For C, generally a 2 part process of compiling.c files to.o files, then linking the.o files into executables. Assembling is also done (but is hidden, i.e., done automatically, by default)! CS61C L03 Introduction to C (pt 1) (6)!

Compilation : Advantages! Great run-time performance: generally much faster than Scheme or Java for comparable code (because it optimizes for a given architecture)! OK compilation time: enhancements in compilation procedure (Makefiles) allow only modified files to be recompiled! CS61C L03 Introduction to C (pt 1) (7)!

Compilation : Disadvantages! All compiled files (including the executable) are architecture specific, depending on both the CPU type and the operating system.! Executable must be rebuilt on each new system.! Called porting your code to a new architecture.! The change compile run [repeat] iteration cycle is slow! CS61C L03 Introduction to C (pt 1) (8)!

C Syntax: main To get the main function to accept arguments, use this:! int main (int argc, char *argv[])! What does this mean?! argc will contain the number of strings on the command line (the executable counts as one, plus one for each argument). Here argc is 2:! unix% sort myfile argv is a pointer to an array containing the arguments as strings (more on pointers later).! CS61C L03 Introduction to C (pt 1) (9)!

C Syntax: Variable Declarations! Very similar to Java, but with a few minor but important differences! All variable declarations must go before they are used (at the beginning of the block)*! A variable may be initialized in its declaration; if not, it holds garbage!! Examples of declarations:! correct: { int a = 0, b = 10;...! Incorrect:* for (int i = 0; i < 10; i++) *C99 overcomes these limitations! CS61C L03 Introduction to C (pt 1) (10)!

Address vs. Value! Consider memory to be a single huge array:! Each cell of the array has an address associated with it.! Each cell also stores some value.! Do you think they use signed or unsigned numbers? Negative address?!! Donʼt confuse the address referring to a memory location with the value stored in that location.!..." 101 102 103 104 105..." 23" 42"..." CS61C L03 Introduction to C (pt 1) (11)!

Pointers! An address refers to a particular memory location. In other words, it points to a memory location.! Pointer: A variable that contains the address of a variable.! Location (address)" name"..." 101 102 103 104 105..." 23" 42" 104"..." x" y" p" CS61C L03 Introduction to C (pt 1) (12)!

Pointers! How to create a pointer:! & operator: get address of a variable! int *p, x;! p"?" x"?" x = 3;! p"?" x" 3" p =&x;! p" x" 3" How get a value pointed to?! Note the * gets used 2 different ways in this example. In the declaration to indicate that p is going to be a pointer, and in the printf to get the value pointed to by p." * dereference operator : get value pointed to! printf( p points to %d\n,*p);! CS61C L03 Introduction to C (pt 1) (13)!

Pointers! How to change a variable pointed to?! Use dereference * operator on left of = p" x" 3" *p = 5; p" x" 5" CS61C L03 Introduction to C (pt 1) (14)!

Pointers and Parameter Passing! Java and C pass parameters by value! procedure/function/method gets a copy of the parameter, so changing the copy cannot change the original! void addone (int x) { x = x + 1; } int y = 3; addone(y); y is still = 3 CS61C L03 Introduction to C (pt 1) (15)!

Pointers and Parameter Passing! How to get a function to change a value?! void addone (int *p) { *p = *p + 1; } int y = 3; addone(&y); y is now = 4 CS61C L03 Introduction to C (pt 1) (16)!

Pointers! Pointers are used to point to any data type (int, char, a struct, etc.).! Normally a pointer can only point to one type (int, char, a struct, etc.).! void * is a type that can point to anything (generic pointer)! Use sparingly to help avoid program bugs and security issues and a lot of other bad things!! CS61C L03 Introduction to C (pt 1) (17)!

Peer Instruction Question! void main(); { int *p, x=5, y; // init y = *(p = &x) + 1; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,p); } flip-sign(int *n){*n = -(*n)} How many syntax+logic errors in this C99 code?! #Errors a)1 b)2 c)3 d)4 e)5 CS61C L03 Introduction to C (pt 1) (18)!

Peer Instruction Answer! void main(); { int *p, x=5, y; // init y = *(p = &x) + 1; int z; flip-sign(p); printf("x=%d,y=%d,p=%d\n",x,y,*p); } flip-sign(int *n){*n = -(*n);} How many syntax+logic errors in this C99 code?! I get 5 (signed ptr print is logical err)! CS61C L03 Introduction to C (pt 1) (19)! #Errors a)1 b)2 c)3 d)4 e)5

And in conclusion! All declarations go at the beginning of each function except if you use C99.! Only 0 and NULL evaluate to FALSE.! All data is in memory. Each memory location has an address to use to refer to it and a value stored in it.! A pointer is a C version of the address.! * follows a pointer to its value! & gets the address of a value! CS61C L03 Introduction to C (pt 1) (20)!

C vs. Java Overview (1/2)! Java! Object-oriented (OOP)! Methods! Class libraries of data structures! Automatic memory management! C! No built-in object abstraction. Data separate from methods.! Functions! C libraries are lower-level! Manual memory management! Pointers! CS61C L03 Introduction to C (pt 1) (21)!

C vs. Java Overview (2/2)! Java! High memory overhead from class libraries! Relatively Slow! Arrays initialize to zero! Syntax: /* comment */ // comment System.out.print C! Low memory overhead Relatively Fast! Arrays initialize to garbage! Syntax: * /* comment */ // comment printf! * You need newer C compilers to allow Java style comments, or just use C99! CS61C L03 Introduction to C (pt 1) (22)!

C Syntax: True or False?! What evaluates to FALSE in C?! 0 (integer)! NULL (pointer: more on this later)! no such thing as a Boolean*! What evaluates to TRUE in C?! everything else! (same idea as in scheme: only #f is false, everything else is true!)! *Boolean types provided by C99ʼs stdbool.h" CS61C L03 Introduction to C (pt 1) (23)!

C syntax : flow control! Within a function, remarkably close to Java constructs in methods (shows its legacy) in terms of flow control! if-else switch while and for do-while CS61C L03 Introduction to C (pt 1) (24)!