The basic purpose of developing a C programming tutorial for this website – CircuitsToday – is to make it useful for people who wish to work with embedded systems. Really good C programming skill is an essential to work with embedded systems and “Pointers” is the most important concept in C that should be mastered by an embedded systems programmer. “Pointers” are so important because it enables a programmer to work directly with memory of the system. Memory of a system is organized as a sequence of byte sized locations (1 byte = 8 bits). If the total memory of the system is 128 bytes then there will be 128 accessible locations of 1 byte each. Each of these 128 locations are numbered from 0 to 127 in a special manner like 0000, 0001, 0002 …etc. The number associated with a byte is known as the address of the memory location.

You may refer the figure below to get an idea – how memory is organized with in 8051

A pointer is an entity which holds the address of a memory location. So if the address of a location is 2050H, pointer is used to hold this particular address.

Note:- Address of a memory location is always a positive integer. The range of address is from zero to a positive integer constant (which is the address of the last memory location ).

Pointer variables

We can use variables to hold address of a memory location and such variables are known as pointer variables. We have seen before that normal variables are used to store data items of a particular data type (char, int, float etc). Before using a variable in a program, we declare it at the beginning. Similarly we need to declare a pointer variable too in a special way – to let the compiler know we have declared a variable as a pointer (not as a normal variable). To do this we have the *operator – known as indirection operator in C.

Pointer variable declaration

The syntax to declare a pointer variable is

(data type)   *(variable name);

Ex:-  int  *ptr ;

Here we have declared a pointer variable of name ‘ptr’ and it is of type integer (int).

Why we need data types in pointers ?

The first doubt that may come to many is, why we need data types to declare a pointer variable. Well, here is the explanation. The address of a memory location will contain a data – rite? And it can be of type char, int, float etc. The difference between all these data types is in the size allocated to each data type. Char – is 1 byte where as int – is 2 byte and float is 4 bytes. Memory is allocated to all these data types as sequential blocks.

Just consider a scenario like this:-

char a ;

int b;

float c; 

Lets start memory allocation from 2000H.

Now the character variable ‘a‘ will be allocated 2000H (1 byte), where as integer variable ‘b’ will be allocated 2 bytes using 2001H and 2002H. Finally the float variable ‘c’ will be allocated 4 bytes using 4 consecutive locations – 2003H, 2004H, 2005H, 2006H. Now you might get an idea of why we need data types to declare pointer variables. It is because memories are allocated in sequential blocks according to the type of data holded in those locations.

So when we declare a pointer variable as float *ptr and then assign address of the normal float variable c to ptr – what really happens is – ptr is assigned the sequential block from 2003H to 2006H as a whole. But the variable ptr will hold only the starting address of the sequential block i.e 2003H

So a pointer variable must be declared with a data type. And this data type should be the same data type as of the contents inside the memory location address – which is assigned to the pointer variable. Ex:- If 2000H is assigned to a pointer variable ptr and the contents inside 2000H is a character. In this case the pointer variable ptr should be declared as a character pointer as shown below:-

char  *ptr; 

Note:- In fact we can actually declare a pointer variable without any data type using the keyword void. It is known as a void pointer. The topic of void pointer has to be explained separately – so I will explain it in my next post.

Assigning address to a pointer variable

To make use of a pointer and it’s capabilities – the address of a particular memory location must be assigned to the pointer. It is possible to assign address of single variable or that of an array or the address of a structure etc to a pointer variable. This capability makes pointers the most powerful tool in C programming. We can literally play with the memory of a system using pointers.

To assign address of an entity to a pointer variable – we use the & operator (address of operator). The operator & fetches the memory location of a variable.

So taking our earlier case as example:-

#include

void main()

{

int *ptr; // Declaring the pointer variable 'ptr' of data type int

int a; // Declaring a normal variable 'a'

ptr=&a; // Assigning address of variable 'a' to pointer variable 'ptr'

}

Dereferencing a pointer (getting the real content from a memory location)

We have seen upto assigning an address to a pointer variable. Now how to get the content inside the memory location using the same pointer variable? For that we use the same indirection operator * used to declare a pointer variable.

Consider the scenario:-

#include

void main()

{

int *ptr; // Declaring the pointer variable 'ptr' of data type int

int a=; // Declaring a normal variable 'a' and assigning value 10 to it.

ptr=&a; // Assigning address of variable 'a' to pointer variable 'ptr'

printf("The value inside pointer is= %d",*ptr); // See the value is printed using *ptr;

}

Introduction to pointers in C的更多相关文章

  1. Void pointers in C

    In this article we are learning about “void pointers” in C language. Before going further it will be ...

  2. <转>年终盘点!2017年超有价值的Golang文章

    马上就要进入2018年了,作为年终的盘点,本文列出了一些2017年的关于Go编程的一些文章,并加上简短的介绍. 文章排名不分先后, 文章也不一定完全按照日期来排列.我按照文章的大致内容分了类,便于查找 ...

  3. Introduction of OpenCascade Foundation Classes

    Introduction of OpenCascade Foundation Classes Open CASCADE基础类简介 eryar@163.com 一.简介 1. 基础类概述 Foundat ...

  4. Introduction of Open CASCADE Foundation Classes

    Open CASCADE Foundation Classes Open CASCADE基础类 eryar@163.com 一.简介 1. 基础类概述 Foundation Classes Overv ...

  5. Brief introduction to Scala and Breeze for statistical computing

    Brief introduction to Scala and Breeze for statistical computing 时间 2013-12-31 03:17:19  Darren Wilk ...

  6. Introduction the naive“scull” 《linux设备驱动》 学习笔记

    Introduction the naive "scull" 首先.什么是scull? scull (Simple Character Utility for Loading Lo ...

  7. Reading task(Introduction to Algorithms. 2nd)

    Introduction to Algorithms 2nd ed. Cambridge, MA: MIT Press, 2001. ISBN: 9780262032933. Introduction ...

  8. Introduction to Parallel Computing

    Copied From:https://computing.llnl.gov/tutorials/parallel_comp/ Author: Blaise Barney, Lawrence Live ...

  9. [中英对照]Introduction to DPDK: Architecture and Principles | DPDK概论: 体系结构与实现原理

    [中英对照]Introduction to DPDK: Architecture and Principles | DPDK概论: 体系结构与实现原理   Introduction to DPDK: ...

随机推荐

  1. POJ1639 算法竞赛进阶指南 野餐规划

    题目描述 原题链接 一群小丑演员,以其出色的柔术表演,可以无限量的钻进同一辆汽车中,而闻名世界. 现在他们想要去公园玩耍,但是他们的经费非常紧缺. 他们将乘车前往公园,为了减少花费,他们决定选择一种合 ...

  2. “美登杯”上海市高校大学生程序设计赛B. 小花梨的三角形(模拟,实现)

    题目链接:https://acm.ecnu.edu.cn/contest/173/problem/B/#report9 Problem B B . 小 花梨 的 三角形 时间限制:1000ms 空间限 ...

  3. MyBatis Generator 移除字段前缀

    在table标签内添加 <columnRenamingRule searchString="wrc_" replaceString=""/> < ...

  4. ABC065D Built[最小生成树]

    这题和某道最短路题神似.对于任意点对,将他们连边,不如将他们分别沿$x,y$轴方向上点按顺序连起来,这样不仅可能多连通一些点,也花费更低,所以按照最短路那题的连边方式跑一个kruskal就行了. #i ...

  5. jupyter lab 报错

    C:\Users\WQBin>jupyter lab [I :: kernels found [I :: No cio_test package found. [I ::45.137 LabAp ...

  6. 使用canvas画布生成二维码

    1. 基本用法 <canvas>标签只有两个属性-----width和height CSS: <canvas class="qrcode" width=" ...

  7. Https Get Post

    #region Http 访问 public string GetHttpUrl(string Url) { try { HttpWebRequest request = (HttpWebReques ...

  8. hdu 5773 最长递增子序列 (nlogn)+贪心

    The All-purpose Zero Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Oth ...

  9. noi.ac #535 生成树

    题目链接:戳我 我们考虑按照编号依次加点,然后维护一个栈. 预设生成树的颜色为color. 对于当前点x,如果它和栈首的点连边颜色相同,那么他们的连边可以作为生成树上面的边,点i已经连接,直接brea ...

  10. delphi将一个list中包含的元素,从另一个中删除,如果在另一个中存在的话

    Function StrList_Del(StrList,DelStrList:String):String; //将DelStrList中包含的元素,从Strlist中删除,如果在Strlist中存 ...