SISTEMI&EMBEDDED& AA&2013/2014&
|
|
|
- Rosamund Dalton
- 5 years ago
- Views:
Transcription
1 Federico&BaronF& SISTEMI&EMBEDDED& AA&2013/2014& The&C&Pre5processor& Fixed5size&integer&types& Bit&ManipulaFon&
2 The&C&PreProcessor&CPP&(1)& CPP&is&a&program&called&by&the&compiler&that& processes&the&text&of&the&program&before&its&actual& translafon& It&basically&does&the&following:& Includes&the&content&of&other&files&(usually&header&files)& Expands&the&SYMBOLS&with&their&related&definiFons&& Includes/Excludes&part&of&the&code&to&the&text&that&will&be& actually&compiled& These&acFons&are&controlled&by&direc(ves+ A&direcFve&is&a&single&code&line&that&starts&with&#& You&can&use&the&character&\&to&go&to&a&new&line&within&the& same&direcfve&
3 The&C&PreProcessor&(2)& Inclusion+of+header+files+(files&with&.h&extension& that&contains&only&declarafons).&e.g.& #include&<stdint.h>& #include& my_header.h & The&file&stdint.h&is&searched&in&a&standard& directory&list;&my_header.h&is&searched&in&the& same&directory&as&the&including&source&file& The&list&of&directories&searched&for&header&files& can&be&changed&with&a&compiler&opfon&&
4 The&C&PreProcessor&(3)& First_Nios2_Prog.c& &/*& &*/& &#include&../firstnios2_prog_bsp/system.h && &/*& &*/+ Compiling+First_Nios2_Prog.c+(other+compiler+op(ons+omi?ed)+ nios25elf5gcc&5c& o&first_nios2_prog.o&first_nios2_prog.c& Header+path+can+be+omi?ed+by+using+FIdir+compiler+op(on+ &/*& &*/& &#include& system.h & &/*& &*/&& First_Nios2_Prog.c& Compiling+First_Nios2_Prog.c+(other+compiler+op(ons+omi?ed)+ nios25elf5gcc& I../FirstNios2_Prog_bsp/&5c& o&first_nios2_prog.o& First_Nios2_Prog.c&
5 The&C&PreProcessor&(4)& Macro+is&a&symbol&that&is&replaced&with&its& definifon&before&compilafon&(it&can&be&followed& by&one&or&or&more&arguments).&e.g.&of¯o&def.& #define&mask&0xf& #define&max(a,b)&((a)&>&(b)&?&(a)&:&(b))& The&instrucFons:& b&=&a&&&mask;& y&=&1&+&max(10,x);& are&expanded&by&the&preprocessor&to:& b&=&a&&&0xf;& y&=&1&+&((10)&>&(x)&?&(10)&:&(x));&
6 The&C&PreProcessor&(5)& Macro+are&largely&used&in&C&programming&of& embedded&systems&to&access&peripheral®isters.& E.g.&of&definiFon:&& &&&#include& system.h && &&&#define&red_leds_data_reg&&&&\& &&&&&&&&&&&&&&&&&&(*(volafle&unsigned&int*)&red_leds_base)& &&&#define&slider_data_reg& &&&&&\& &&&&&&&&&&&&&&&&&&(*(volafle&unsigned&int*)&slider_switches_base)& E.g.&of&use:& &&&RED_LEDS_DATA_REG&=&SLIDER_DATA_REG;& &&&&/*&Show&the&status&of&the&slider&switches&on&the&red&leds&*/&
7 The&C&PreProcessor&(6)& The+macro+name_of_the_macro-exists&from&its& definifon&to&the&end&of&the&file&or&when&it&is& undefined&using&the&direcfve:& #undef&name_of_the_macro& A¯o&can&also&be&defined&with&an&opFon&passed& to&the&compiler:& 5D&name_of_the_macro=def- Do&a&large&use&of&parenthesis&to&avoid&unintended& behaviors&when&the¯o&is&expanded& Write¯o&SYMBOLS&with&all&CAPITAL&lemers&
8 The&C&PreProcessor&(7)& Condi(onal+compila(on+makes&it&possible&to& include/exclude&code&segments&if&certain& expressions&evaluated&by&the&preprocessor&are& true&or&false.&e.g.& #ifdef&debug&& &&&&prinq( Debug&mode&enabled\n );& &&&/*&or&any&other&code&that&we&want&to&include& &&&&&&&for&debug&purposes&*/& #endif& #define&debug&1& includes&the&debug&code&
9 The&C&PreProcessor&(8)& A&common&use&of+condi(onal+compila(on+is&to& avoid&mulfple&inclusions&of&a&header&file.&to&this& end,&start&the&header&file,&say&config.h,&with:& #ifndef&config_h_& #define&config_h_& and&end&it&with:& #endif&/*&config_h_&*/& Aser&the&first&inclusion&of&my_header.h,&the& symbol&my_header_h&is&defined.&thus,&further& inclusions&are&filtered&out&by&the&condi(onal+ compila(on+direc(ves&
10 Integer&types& 2&basic&integer&types:&char,+int) and&some&type5specifiers:& sign:&signed,&unsigned- size:&short,&long& The&actual&size&of&an&integer&type&depends&on&the& compiler&implementafon& sizeof(type)&returns&the&size&(in&number&of&bytes)&used&to& represent&the&type-argument- sizeof(char)& &sizeof(short)& &sizeof(int)& &sizeof(long)...& & &sizeof(long-long)&
11 Fixed5size&integers&(1)& In&embedded&system&programming& integer+size+is+important+ Controlling&minimum&and&maximum&values&that& can&be&stored&in&a&variable& Increasing&efficiency&in&memory&uFlizaFon& Managing&peripheral®isters& To&increase&sosware&portability,&fixed5size& integer&types&can&be&defined&in&a&header&file& using&the&typedef&keyword&
12 Fixed5size&integers&(2)& C99&update&of&the&ISO+C+standard&defines&a&set& of&standard&names&for&signed&and&unsigned& fixed5size&integer&types& 85bit:&&&int8_t,&&&uint8_t& 165bit:&int16_t,&uint16_t& 325bit:&int32_t,&uint32_t&& 645bit:&int64_t,&uint64_t& These&types&are&defined&in&the&library&header& file&stdint.h+
13 Fixed5size&integers&(3)&& Altera&HAL&provides&the&header&file&alt_types.h& with&definifon&of&fixed5size&integer&types:&& -typedef-signed-char&alt_8;& -typedef-unsigned-char-alt_u8;& -typedef-signed-short&alt_16;& -typedef-unsigned-short&alt_u16;& -typedef-signed-long&&alt_32;& -typedef-unsigned-long&alt_u32;& &typedef&long&long&alt_64;& &typedef-unsigned-long-long&alt_u64;&
14 Logical&operators& Integer&data&can&be&interpreted&as&logical+values&in& condifons&(if,&while,&...)&or&in&logical&expressions:& &=+0,+FALSE+ &ANY+OTHER+VALUE,+TRUE+ Logical+operators:+ AND+ &&+ OR+ + NOT+!+ Integer&data&can&store&the&result&of&a&logical& expressions:&1&(true),&0&(false)&
15 Bitwise&operators&(1)& Operate&on&the&bits&of&the&operand/s& && AND+ &+ OR+ + XOR+ ^+ NOT+ ~+ SHIFT+LEFT+ <<+ SHIFT+RIGHT+ >>+
16 Shis&operators& A+<<+n- The&result&is&the&bits&of&A&moved&to&the&les&by&n& posifons&and&padded&on&the&right&with&0& It&is&equivalent&to&mulFply&A&by&2 n &if&the&result&can& be&represented& A+>>+n- The&result&is&the&bits&of&A&moved&to&the&right&by&n& posifons&and&padded&on&the&les&with&0&if&type&of&a& is&unsigned&or&with&the&msb&of&a&if&type&is&signed& It&is&equivalent&to÷&A&by&2 n &
17 Bit&manipulaFon&(1)& <<&and& &operands&can&be&used&to&create& expressive&binary&constants&by&specifying&the& posifons&of&the&bits&equal&to&1&& E.g.&&(1<<7)& &(1<<5)& &(1<<0)&=&0xA1&( )&& Bemer¬&to&use& magic&numbers &as&7,&5&and&0.& Use&instead&symbolic&names&to&specify& bit&posifons& For&instance,&the&symbolic&names&can&reflect&the&funcFon&of& the&bit&within&a&peripheral®ister& (1<<x)&can&be&encapsulated&into&a¯o:& #define&bit(x)&&&&(1<<(x))&
18 Bit&manipulaFons&(2)& Altering&only&the&bits&in&given&posiFons& E.g.&bits:&7,&5,&0& #define-msk&=&bit(7)& &BIT(5)& &BIT(0)& Clearing&bits&& A&&=&~MSK;& Sezng&bits& A& =&MSK;& Toggling&bits& A&^=&MSK;&
19 Bit&manipulaFons&(3)& TesFng&bits& E.g.&do&something&if&bit&0&(LSB)&of&A-is&set,& regardeless&of&the&other&bits&of&a&&& if&(a&&&bit(0))&{& &&&&/*&some&code&here&*/& }&
20 Accessing&Memory5mapped®s& E.g.&PIO&peripheral&(full&set&of®s)& We&can&define&a&C&struct&that&overlays&the& peripherals®s&&
21 C&struct&overlay&(1)& typedef&struct&{& &uint32_t&data;&&&&&&&&&&&&&&&&&&&&&&&/&*offset&0&*/& &uint32_t&direcfon; & &&&&&/&*offset&4&*/& &uint32_t&int_mask;&&&&&&&&&&&&&/&*offset&8&*/& &uint32_t&edge_capture;&&&&&/&*offset&12&*/& &uint32_t&outset;&&&&&&&&&&&&&&&&&&/&*offset&16&*/& &uint32_t&outclear;&&&&&&&&&&&&&&/&*offset&20&*/& &}&volafle&pio_t;& & /*&Define&a&pointer&to&MyPio&PIO&peripheral&*/& #define&my_pio_base_address&&&&0x &/*&base&address&of&mypio&*/& & pio_t&*pmypio&=&(pio_t&*)&my_pio_base_address;& & &
22 What&about?& C&struct&overlay&(2)& /*&Sezng&bit&7&without&altering&the&other&bits&*/& pmypio5>outset&=&bit(7);& & /*&Clearing&bit&3&without&altering&the&other&bits&*/& pmypio5>outclear&=&bit(3);& & /*&Do&something&if&bit&5&of&the&edge_capture®&is&set*/& if(pmypio5>edge_capture&&&bit(5))&{& &&&&/*&Some&code&here&*/& }& /*&Sezng&bit&7&without&altering&the&other&bits&*/& pmypio5>data& =&BIT(7);& & /*&Clearing&bit&3&without&altering&the&other&bits&*/& pmypio5>data&&=&bit(3);& &
SISTEMI EMBEDDED. The C Pre-processor Fixed-size integer types Bit Manipulation. Federico Baronti Last version:
SISTEMI EMBEDDED The C Pre-processor Fixed-size integer types Bit Manipulation Federico Baronti Last version: 20160302 The C PreProcessor CPP (1) CPP is a program called by the compiler that processes
SISTEMI EMBEDDED. The C Pre-processor Fixed-size integer types Bit Manipulation. Federico Baronti Last version:
SISTEMI EMBEDDED The C Pre-processor Fixed-size integer types Bit Manipulation Federico Baronti Last version: 20170307 The C PreProcessor CPP (1) CPP is a program called by the compiler that processes
SISTEMI EMBEDDED. The C Pre-processor Fixed-size integer types Bit Manipulation. Federico Baronti Last version:
SISTEMI EMBEDDED The C Pre-processor Fixed-size integer types Bit Manipulation Federico Baronti Last version: 20180312 The C PreProcessor CPP (1) CPP is a program called by the compiler that processes
INTRODUCTION TO COMPUTER SCIENCE - LAB
LAB # O2: OPERATORS AND CONDITIONAL STATEMENT Assignment operator (=) The assignment operator assigns a value to a variable. X=5; Expression y = 2 + x; Increment and decrement (++, --) suffix X++ X-- prefix
Number Systems. Binary Numbers. Appendix. Decimal notation represents numbers as powers of 10, for example
Appendix F Number Systems Binary Numbers Decimal notation represents numbers as powers of 10, for example 1729 1 103 7 102 2 101 9 100 decimal = + + + There is no particular reason for the choice of 10,
Fundamental Data Types. CSE 130: Introduction to Programming in C Stony Brook University
Fundamental Data Types CSE 130: Introduction to Programming in C Stony Brook University Program Organization in C The C System C consists of several parts: The C language The preprocessor The compiler
ISA 563 : Fundamentals of Systems Programming
ISA 563 : Fundamentals of Systems Programming Variables, Primitive Types, Operators, and Expressions September 4 th 2008 Outline Define Expressions Discuss how to represent data in a program variable name
Pointers and Strings Prentice Hall, Inc. All rights reserved.
Pointers and Strings 1 sizeof operator Pointer Expressions and Pointer Arithmetic Relationship Between Pointers and Arrays Arrays of Pointers Case Study: Card Shuffling and Dealing Simulation sizeof operator
CS107, Lecture 3 Bits and Bytes; Bitwise Operators
CS107, Lecture 3 Bits and Bytes; Bitwise Operators reading: Bryant & O Hallaron, Ch. 2.1 This document is copyright (C) Stanford Computer Science and Nick Troccoli, licensed under Creative Commons Attribution
Declaration. Fundamental Data Types. Modifying the Basic Types. Basic Data Types. All variables must be declared before being used.
Declaration Fundamental Data Types All variables must be declared before being used. Tells compiler to set aside an appropriate amount of space in memory to hold a value. Enables the compiler to perform
Approximately a Test II CPSC 206
Approximately a Test II CPSC 206 Sometime in history based on Kelly and Pohl Last name, First Name Last 5 digits of ID Write your section number(s): All parts of this exam are required unless plainly and
Pointers (2) Applications
Pointers (2) Applications December 9, 2017 This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported license. 0.1 const qaulifier t1.c #include #include
Introduction to C. Systems Programming Concepts
Introduction to C Systems Programming Concepts Introduction to C A simple C Program Variable Declarations printf ( ) Compiling and Running a C Program Sizeof Program #include What is True in C? if example
CS107, Lecture 3 Bits and Bytes; Bitwise Operators
CS107, Lecture 3 Bits and Bytes; Bitwise Operators reading: Bryant & O Hallaron, Ch. 2.1 This document is copyright (C) Stanford Computer Science and Nick Troccoli, licensed under Creative Commons Attribution
C++ Tutorial AM 225. Dan Fortunato
C++ Tutorial AM 225 Dan Fortunato Anatomy of a C++ program A program begins execution in the main() function, which is called automatically when the program is run. Code from external libraries can be
Computer Organization & Systems Exam I Example Questions
Computer Organization & Systems Exam I Example Questions 1. Pointer Question. Write a function char *circle(char *str) that receives a character pointer (which points to an array that is in standard C
THE FUNDAMENTAL DATA TYPES
THE FUNDAMENTAL DATA TYPES Declarations, Expressions, and Assignments Variables and constants are the objects that a prog. manipulates. All variables must be declared before they can be used. #include
Programming, numerics and optimization
Programming, numerics and optimization Lecture A-2: Programming basics II Łukasz Jankowski ljank@ippt.pan.pl Institute of Fundamental Technological Research Room 4.32, Phone +22.8261281 ext. 428 March
int main(void) { int a, b, c; /* declaration */
&KDSWHULQ$%& #include int main(void) { int a, b, c; /* declaration */ float x, y=3.3, z=-7.7; /* declaration with initialization */ printf("input two integers: "); /* function call */ scanf("%d%d",
LESSON 5 FUNDAMENTAL DATA TYPES. char short int long unsigned char unsigned short unsigned unsigned long
LESSON 5 ARITHMETIC DATA PROCESSING The arithmetic data types are the fundamental data types of the C language. They are called "arithmetic" because operations such as addition and multiplication can be
large units some names for large numbers CIS 2107 Chapter 2 Notes Part 1
large units CIS 2107 Chapter 2 Notes Part 1 Representing and Manipulating Information kilo 10 3 1,000 mega 10 6 1,000,000 giga 10 9 1,000,000,000 tera 10 12 1,000,000,000,000 peta 10 15 1,000,000,000,000,000
CIS 2107 Chapter 2 Notes Part 1. Representing and Manipulating Information
CIS 2107 Chapter 2 Notes Part 1 Representing and Manipulating Information large units kilo 10 3 1,000 mega 10 6 1,000,000 giga 10 9 1,000,000,000 tera 10 12 1,000,000,000,000 peta 10 15 1,000,000,000,000,000
C library = Header files + Reserved words + main method
DAY 1: What are Libraries and Header files in C. Suppose you need to see an Atlas of a country in your college. What do you need to do? You will first go to the Library of your college and then to the
CS 61C: Great Ideas in Computer Architecture Introduction to C
CS 61C: Great Ideas in Computer Architecture Introduction to C Instructors: Vladimir Stojanovic & Nicholas Weaver http://inst.eecs.berkeley.edu/~cs61c/ 1 Agenda C vs. Java vs. Python Quick Start Introduction
Programming Fundamentals and Methodology. COMP104: C++ Basics
Programming Fundamentals and Methodology COMP104: C++ Basics Dr. Brian Mak Dr. Pedro Sander Dr. Zhen Zhou Department of Computer Science & Engineering The Hong Kong University of Science and Technology
Week 3 Lecture 2. Types Constants and Variables
Lecture 2 Types Constants and Variables Types Computers store bits: strings of 0s and 1s Types define how bits are interpreted They can be integers (whole numbers): 1, 2, 3 They can be characters 'a',
Pointers (1A) Young Won Lim 1/22/18
Pointers (1A) Copyright (c) 2010-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
Data encoding. Lauri Võsandi
Data encoding Lauri Võsandi Binary data Binary can represent Letters of alphabet, plain-text files Integers, floating-point numbers (of finite precision) Pixels, images, video Audio samples Could be stored
G52CPP C++ Programming Lecture 8. Dr Jason Atkin
G52CPP C++ Programming Lecture 8 Dr Jason Atkin 1 Last lecture Dynamic memory allocation Memory re-allocation to grow arrays Linked lists Use -> rather than. pcurrent = pcurrent -> pnext; 2 Aside: do not
5.Coding for 64-Bit Programs
Chapter 5 5.Coding for 64-Bit Programs This chapter provides information about ways to write/update your code so that you can take advantage of the Silicon Graphics implementation of the IRIX 64-bit operating
Exam Principles of Imperative Computation, Summer 2011 William Lovas. June 24, 2011
Exam 3 15-122 Principles of Imperative Computation, Summer 2011 William Lovas June 24, 2011 Name: Andrew ID: Instructions This exam is closed-book with one double-sided sheet of notes permitted. You have
SISTEMI EMBEDDED AA 2012/2013. SOPC Nios II Interval Timer Core
SISTEMI EMBEDDED AA 2012/2013 SOPC Nios II Interval Timer Core DE2 Basic Computer Interval timer core (1) Hardware configuration: 32-bit or 64-bit internal counter Two count modes: count down once and
Basic C Program: Print to stdout. Basic C Program. Basic C Program: Print to stdout. Header Files. Read argument and print. Read argument and print
CSC 4304 - Systems Programming Fall 2010 Lecture - II Basics of C Programming Summary of Last Class Basics of UNIX: logging in, changing password text editing with vi, emacs and pico file and directory
Dynamic Data Structures. CSCI 112: Programming in C
Dynamic Data Structures CSCI 112: Programming in C 1 It s all about flexibility In the programs we ve made so far, the compiler knows at compile time exactly how much memory to allocate for each variable
Chapter 3. Fundamental Data Types
Chapter 3. Fundamental Data Types Byoung-Tak Zhang TA: Hanock Kwak Biointelligence Laboratory School of Computer Science and Engineering Seoul National Univertisy http://bi.snu.ac.kr Variable Declaration
The C Programming Language
The C Programming Language CS 025 Computer Science Fundamentals I Stephen M. Watt University of Western Ontario The C Programming Language A high-level language for writing low-level programs Allows machine-independent
Basic Types and Formatted I/O
Basic Types and Formatted I/O C Variables Names (1) Variable Names Names may contain letters, digits and underscores The first character must be a letter or an underscore. the underscore can be used but
Variables and Constants
HOUR 3 Variables and Constants Programs need a way to store the data they use. Variables and constants offer various ways to work with numbers and other values. In this hour you learn: How to declare and
Integer Data Types. Data Type. Data Types. int, short int, long int
Data Types Variables are classified according to their data type. The data type determines the kind of information that may be stored in the variable. A data type is a set of values. Generally two main
DEPARTMENT OF COMPUTER ENGINEERING CMPE101: Foundation of Computer Engineering EXPERIMENT 3. Introduction to C Programming: Sequential code structure
DEPARTMENT OF COMPUTER ENGINEERING CMPE101: Foundation of Computer Engineering EXPERIMENT 3 Introduction to C Programming: Sequential code structure Objectives: 1) Understand how to edit, compile and execute
Princeton University. Computer Science 217: Introduction to Programming Systems. Data Types in C
Princeton University Computer Science 217: Introduction to Programming Systems Data Types in C 1 Goals of C Designers wanted C to: Support system programming Be low-level Be easy for people to handle But
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 http://inst.eecs.berkeley.edu/~cs61c Numbers wrap-up This is not on the exam! Break C Primer Administrivia,
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: Numbers & C Language Krste Asanović & Randy Katz http://inst.eecs.berkeley.edu/~cs61c Numbers wrap-up This is not on the exam! Break C Primer Administrivia,
C++/Java. C++: Hello World. Java : Hello World. Expression Statement. Compound Statement. Declaration Statement
C++/Java HB/C2/KERNELC++/1 Statements HB/C2/KERNELC++/2 Java: a pure object-oriented language. C++: a hybrid language. Allows multiple programming styles. Kernel C++/ a better C: the subset of C++ without
The New C Standard (Excerpted material)
The New C Standard (Excerpted material) An Economic and Cultural Commentary Derek M. Jones derek@knosof.co.uk Copyright 2002-2008 Derek M. Jones. All rights reserved. unary-expression castexpression unary-expression:
Princeton University COS 217: Introduction to Programming Systems C Primitive Data Types
Princeton University COS 217: Introduction to Programming Systems C Primitive Data Types Type: int Size: System dependent. On FC010 with gcc217: 4 bytes. int ifirst; signed int isecond; 123 00000000 00000000
Pointers (1A) Young Won Lim 2/6/18
Pointers (1A) Copyright (c) 2010-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
A few examples are below. Checking your results in decimal is the easiest way to verify you ve got it correct.
CS107 Handout 22S Spring 2007 May 4, 2007 Assignment 5 Solution Brought to you by Julie Zelenski and Jerry Cain. Problem 1: Binary numbers and bit operations A few examples are below. Checking your results
C Pointers. sizeof Returns size of operand in bytes For arrays: size of 1 element * number of elements if sizeof( int ) equals 4 bytes, then
1 7 C Pointers 7.7 sizeof Operator 2 sizeof Returns size of operand in bytes For arrays: size of 1 element * number of elements if sizeof( int ) equals 4 bytes, then int myarray[ 10 ]; printf( "%d", sizeof(
ECET 264 C Programming Language with Applications
ECET 264 C Programming Language with Applications Lecture 6 Control Structures and More Operators Paul I. Lin Professor of Electrical & Computer Engineering Technology http://www.etcs.ipfw.edu/~lin Lecture
Structured Programming. Jon Macey
Structured Programming Jon Macey Structured Programming Structured programming is an attempt to formalise the process of program development. There are several basis for a theorem of structured programming,
A Short Course for REU Students Summer Instructor: Ben Ransford
C A Short Course for REU Students Summer 2008 Instructor: Ben Ransford http://www.cs.umass.edu/~ransford/ ransford@cs.umass.edu 1 Outline Today: basic syntax, compilation Next time: pointers, I/O, libraries
ECET 264 C Programming Language with Applications
ECET 264 C Programming Language with Applications Lecture 9 & 10 Control Structures and More Operators Paul I. Lin Professor of Electrical & Computer Engineering Technology http://www.ecet.ipfw.edu/~lin
Pointers (1A) Young Won Lim 2/10/18
Pointers (1A) Copyright (c) 2010-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
Data in Memory. variables have multiple attributes. variable
Data in Memory variables have multiple attributes variable symbolic name data type (perhaps with qualifier) allocated in data area, stack, or heap duration (lifetime or extent) storage class scope (visibility
CS11001/CS11002 Programming and Data Structures (PDS) (Theory: 3-1-0) Allocating Space
CS11001/CS11002 Programming and Data Structures (PDS) (Theory: 3-1-0) Allocating Space Dynamic Memory Allocation All variables, arrays, structures and unions that we worked with so far are statically allocated,
arrays and strings week 3 Ritsumeikan University College of Information Science and Engineering Ian Piumarta 1 / 22 imperative programming review
of char imperative week 3 and Ritsumeikan University College of Information Science and Engineering Ian Piumarta 1 / 22 : miscellaneous of char several library functions are have put or get in their name
ANSI C Changes. Jonathan Hoyle Eastman Kodak 10/5/00
ANSI C Changes Jonathan Hoyle Eastman Kodak 10/5/00 ANSI C Changes Introduction Changes to C in conformance to C++ New additions to C friendly to C++ New additions to C unfriendly to C++ What has not changed
Princeton University Computer Science 217: Introduction to Programming Systems The C Programming Language Part 1
Princeton University Computer Science 217: Introduction to Programming Systems The C Programming Language Part 1 C is quirky, flawed, and an enormous success. While accidents of history surely helped,
CS 0449 Sample Midterm
Name: CS 0449 Sample Midterm Multiple Choice 1.) Given char *a = Hello ; char *b = World;, which of the following would result in an error? A) strlen(a) B) strcpy(a, b) C) strcmp(a, b) D) strstr(a, b)
CS 107 Lecture 3: Integer Representations
CS 107 Lecture 3: Integer Representations Monday, January 15, 2018 Computer Systems Winter 2018 Stanford University Computer Science Department Reading: Reader: Bits and Bytes, Textbook: Chapter 2.2 Lecturers:
Arrays and Pointers in C. Alan L. Cox
Arrays and Pointers in C Alan L. Cox alc@rice.edu Objectives Be able to use arrays, pointers, and strings in C programs Be able to explain the representation of these data types at the machine level, including
Exam Principles of Imperative Computation, Summer 2011 William Lovas. June 24, 2011
Exam 3 15-122 Principles of Imperative Computation, Summer 2011 William Lovas June 24, 2011 Name: Sample Solution Andrew ID: wlovas Instructions This exam is closed-book with one double-sided sheet of
Today. o main function. o cout object. o Allocate space for data to be used in the program. o The data can be changed
CS 150 Introduction to Computer Science I Data Types Today Last we covered o main function o cout object o How data that is used by a program can be declared and stored Today we will o Investigate the
Programming. Data Structure
Programming & Data Structure For Computer Science & Information Technology By www.thegateacademy.com Syllabus Syllabus for Programming and Data Structures Programming in C, Arrays, Stacks, Queues, Linked
Have the same meaning as variables in algebra Single alphabetic character Each variable needs an identifier that distinguishes it from the others a =
Morteza Noferesti Have the same meaning as variables in algebra Single alphabetic character Each variable needs an identifier that distinguishes it from the others a = 5 x = a + b valid identifier in C
Principles of C and Memory Management
COMP281 Lecture 8 Principles of C and Memory Management Dr Lei Shi Last Lecture Pointer Basics Previous Lectures Arrays, Arithmetic, Functions Last Lecture Pointer Basics Previous Lectures Arrays, Arithmetic,
Introduction to 8086 Assembly
Introduction to 8086 Assembly Lecture 6 Working with memory Why using memory? Registers are limited in number and size Program data Program code etc. The data segment dd 1234 dw 13 db -123 The data segment
std::cout << "Size of long = " << sizeof(long) << " bytes\n\n"; std::cout << "Size of char = " << sizeof(char) << " bytes\n";
C++ Program Structure A C++ program must adhere to certain structural constraints. A C++ program consists of a sequence of statements. Every program has exactly one function called main. Programs are built
Programming & Data Structure Laboratory. Arrays, pointers and recursion Day 5, August 5, 2014
Programming & Data Structure Laboratory rrays, pointers and recursion Day 5, ugust 5, 2014 Pointers and Multidimensional rray Function and Recursion Counting function calls in Fibonacci #include
4) In C, if you pass an array as an argument to a function, what actually gets passed?
Paytm Programming Sample paper: 1) What will be the output of the program? #include int main() } int y=128; const int x=y; printf("%d\n", x); return 0; a. 128 b. Garbage value c. Error d. 0 2)
Ricardo Rocha. Department of Computer Science Faculty of Sciences University of Porto
Ricardo Rocha Department of Computer Science Faculty of Sciences University of Porto Adapted from the slides Revisões sobre Programação em C, Sérgio Crisóstomo Compilation #include int main()
Overview of C. Basic Data Types Constants Variables Identifiers Keywords Basic I/O
Overview of C Basic Data Types Constants Variables Identifiers Keywords Basic I/O NOTE: There are six classes of tokens: identifiers, keywords, constants, string literals, operators, and other separators.
C Syntax Out: 15 September, 1995
Burt Rosenberg Math 220/317: Programming II/Data Structures 1 C Syntax Out: 15 September, 1995 Constants. Integer such as 1, 0, 14, 0x0A. Characters such as A, B, \0. Strings such as "Hello World!\n",
Number Systems, Scalar Types, and Input and Output
Number Systems, Scalar Types, and Input and Output Outline: Binary, Octal, Hexadecimal, and Decimal Numbers Character Set Comments Declaration Data Types and Constants Integral Data Types Floating-Point
Faculty of Science Final Examination. Computer Science B Introduction to Software Systems
Student Name: Student Number: Faculty of Science Final Examination Computer Science 308-206B Introduction to Software Systems Examiner: Hans Vangheluwe Monday, April 30 th, 2001 Associate Examiner: Charles
Structures, Unions Alignment, Padding, Bit Fields Access, Initialization Compound Literals Opaque Structures Summary. Structures
Structures Proseminar C Grundlagen und Konzepte Michael Kuhn Research Group Scientific Computing Department of Informatics Faculty of Mathematics, Informatics und Natural Sciences University of Hamburg
CSC 306 Assignment 4: A Floppy Disk Dumper
CSC 306 Assignment 4: A Floppy Disk Dumper Project due date: 11:59pm CST, 11/18/10 Statement Windows and Linux systems allow a programmer to open the floppy disk and read/write its contents as if it were
CS 110 Computer Architecture. Lecture 2: Introduction to C, Part I. Instructor: Sören Schwertfeger.
CS 110 Computer Architecture Lecture 2: Introduction to C, Part I Instructor: Sören Schwertfeger http://shtech.org/courses/ca/ School of Information Science and Technology SIST ShanghaiTech University
Spring 2008 May 14 th, 2008 CS107 Midterm Solution
CS107 Handout 25S Spring 2008 May 14 th, 2008 CS107 Midterm Solution Problem 1: Your Friendly Green Grocer (15 points: 5, 4, and 6) Consider the following struct definitions: line 1 line 2 line 3 typedef
C1b3rCh4ll3ng3.17 Admission test - Feb 3,
C1b3rCh4ll3ng3.17 Admission test - Feb 3, 2017 Quizzes B Duration: 60 minutes... Insert your picks (A, B, C, or D) in answers.txt. Good luck! Question #1 - pointers Consider the following incomplete code
EL6483: Brief Overview of C Programming Language
EL6483: Brief Overview of C Programming Language EL6483 Spring 2016 EL6483 EL6483: Brief Overview of C Programming Language Spring 2016 1 / 30 Preprocessor macros, Syntax for comments Macro definitions
Lecture 3 Memory and Pointers
Lecture 3 Memory and Pointers Lets think about memory We can think of memory as a series of empty slots Each cell in the slot will hold 1 Byte To identify which cell something is in we need an identifier.
int main() { return 0; }
int main() { return 0; % gcc x.c %./a.out % gcc -o x x.c %./x int main() { return 1; 0 % gcc -Wall -o x x.c %./x int main() { printf("hi\n"); return 0; \n #include int main() { printf("hi\n");
cs50.c /**************************************************************************** * CS50 Library 6 *
cs50.c 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15. 16. 17. 18. 19. 20. 21. 22. 23. 24. 25. 26. 27. 28. 29. 30. 31. 32. 33. 34. 35. 36. 37. 38. 39. 40. 41. 42. 43. 44. 45. 46. 47. 48. / CS50 Library
Incoming Exam. CS 201 Introduction to Pointers. What is a Pointer? Pointers and Addresses. High Speed Memory (RAM) Size of Variable Types.
Incoming Exam CS 0 Introduction to Pointers Debzani Deb Next Monday (th March), we will have Exam # Closed book Sit with an empty space in either side of you Calculators that have text-allowing is not
ICS Instructor: Aleksandar Kuzmanovic TA: Ionut Trestian Recitation 2
ICS 2008 Instructor: Aleksandar Kuzmanovic TA: Ionut Trestian Recitation 2 Data Representations Sizes of C Objects (in Bytes) C Data Type Compaq Alpha Typical 32-bit Intel IA32 int 4 4 4 long int 8 4 4
Expressions and Precedence. Last updated 12/10/18
Expressions and Precedence Last updated 12/10/18 Expression: Sequence of Operators and Operands that reduce to a single value Simple and Complex Expressions Subject to Precedence and Associativity Six
11 'e' 'x' 'e' 'm' 'p' 'l' 'i' 'f' 'i' 'e' 'd' bool equal(const unsigned char pstr[], const char *cstr) {
![11 'e' 'x' 'e' 'm' 'p' 'l' 'i' 'f' 'i' 'e' 'd' bool equal(const unsigned char pstr[], const char *cstr) {](/thumbs/91/107167676.jpg "11 'e' 'x' 'e' 'm' 'p' 'l' 'i' 'f' 'i' 'e' 'd' bool equal(const unsigned char pstr[], const char *cstr) {")
This document contains the questions and solutions to the CS107 midterm given in Spring 2016 by instructors Julie Zelenski and Michael Chang. This was an 80-minute exam. Midterm questions Problem 1: C-strings
#ifndef DOUBLE_LIST /* this string SHOULD NOT previously exist */ #define DOUBLE_LIST
/* This is a personal header file. Call it double_list.h * Its name should be reflected into the macro definition (#define). * For instance, here I should say something like: * #define DOUBLE_LIST #ifndef
Agenda. The main body and cout. Fundamental data types. Declarations and definitions. Control structures
The main body and cout Agenda 1 Fundamental data types Declarations and definitions Control structures References, pass-by-value vs pass-by-references Memory regions 2 EACH C++ VARIABLE IS STORED IN A
robotics/ openel.h File Reference Macros Macro Definition Documentation Typedefs Functions
openel.h File Reference Macros #define EL_TRUE 1 #define EL_FALSE 0 #define EL_NXT_PORT_A 0 #define EL_NXT_PORT_B 1 #define EL_NXT_PORT_C 2 #define EL_NXT_PORT_S1 0 #define EL_NXT_PORT_S2 1 #define EL_NXT_PORT_S3
Chapter 4: Arrays, Pointers and Strings
Chapter 4: Arrays, Pointers and Strings C Programming Language Šimon Řeřucha v3.2 March 1, 2016 A C program is like a fast dance on a newly waxed dance floor by people carrying razors. Waldi Ravens. Advanced
CS24: INTRODUCTION TO COMPUTING SYSTEMS. Spring 2016 Lecture 12
CS24: INTRODUCTION TO COMPUTING SYSTEMS Spring 2016 Lecture 12 CS24 MIDTERM Midterm format: 6 hour overall time limit, multiple sittings (If you are focused on midterm, clock should be running.) Open book
POLYTECH CLERMONT-FERRAND. Application Note. Implementation of a SPEEX decoder on RX62N RENESAS microcontroller 22/01/2012
POLYTECH CLERMONT-FERRAND Application Note Implementation of a SPEEX decoder on RX62N RENESAS microcontroller 22/01/2012 Author : Sébastien PINNETERRE Engineering student in electrical engineering /embedded
Structures. Basics of Structures (6.1) EECS l Now struct point is a valid type. l Defining struct variables: struct point { int x; int y; };
Structures EECS 2031 25 September 2017 1 Basics of Structures (6.1) struct point { int x; int y; keyword struct introduces a structure declaration. point: structure tag x, y: members The same member names
CS107, Lecture 9 C Generics Function Pointers
CS107, Lecture 9 C Generics Function Pointers Reading: K&R 5.11 This document is copyright (C) Stanford Computer Science and Nick Troccoli, licensed under Creative Commons Attribution 2.5 License. All
Memory Management. CSC215 Lecture
Memory Management CSC215 Lecture Outline Static vs Dynamic Allocation Dynamic allocation functions malloc, realloc, calloc, free Implementation Common errors Static Allocation Allocation of memory at compile-time
Chapter 7. Pointers. Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved.
1 Chapter 7 Pointers Copyright 2007 by Deitel & Associates, Inc. and Pearson Education Inc. All Rights Reserved. 2 Chapter 7 - Pointers 7.1 Introduction 7.2 Pointer Variable Definitions and Initialization
Internal representation. Bitwise operators
Computer Programming Internal representation. Bitwise operators Marius Minea marius@cs.upt.ro 26 October 2015 Ideal math and C are not the same! In mathematics: integers Z and reals R have unbounded values