Simple Call to malloc

Loading...

來自 Duke University 的課程

Interacting with the System and Managing Memory

16 個評分

Duke University

Interacting with the System and Managing Memory

16 個評分

課程 4（共 4 門，Specialization Introduction to Programming in C）

The final course in the specialization Introduction to Programming in C will teach you powerful new programming techniques for interacting with the user and the system and dynamically allocating memory. You will learn more sophisticated uses for pointers, such as strings and multidimensional arrays, as well as how to write programs that read and write files and take input from the user. Learning about dynamic memory allocation will allow your programs to perform complex tasks that will be applied in the final part of the specialization project: a Monte Carlo simulation for calculating poker hand probabilities.

從本節課中

Module 2: Dynamic allocation

So far, most of the memory we have used has been located on the stack. Dynamic memory allocation gives a programmer much more flexibility, in that it allows you to request a specific amount memory to be allocated on the heap, so that it will not disappear with the stack frame of the calling function.

Simple Call to malloc2:13

與講師見面

Andrew D. Hilton
Associate Professor of the Practice
Electrical and Computer Engineering
Anne Bracy
Senior Lecturer
Computer Science, Cornell University
Genevieve M. Lipp
Adjunct Professor
Electrical and Computer Engineering/Mechanical Engineering

Now, let's see the semantics of malloc.

Here we have a small example of code which uses malloc.

It does not really accomplish anything,

but we'll let you see what malloc does.

Our first statement just declares an int star p which is uninitialized.

The next statement is an assignment statement.

So, you will follow the same rules you always do.

Find the box named by the left-hand side.

In this case, p. And evaluate

the right hand side expression to get a new value to put into that box.

In this case, that expression is a call to malloc which will allocate memory.

Allocating memory, means that you're going to draw a new box.

This new box will be in the heap,

not in any stack frame.

Unlike variables which reside in stack frames,

this box that you will create in the heap does not have its own name.

To see what the new box looks like,

you need to look at the argument passed to malloc.

Here, it is six times the size of star p. Which means,

it will be an array of six elements.

As p as an inch pointer,

those elements will be ints.

So, let's draw that box.

Note that each element inside the array is uninitialized.

Whenever you create new boxes,

they are uninitialized until you explicitly place a value in them.

The return value of malloc is a pointer to this newly allocated memory.

So now, you are ready to finish the assignment statement,

placing the return value of malloc,

which is the value of the function call into p's box.

Now, let's look at what happens later when the function returns.

The frame for the current function is in the stack.

So, it will be destroyed automatically when the function returns.

This behavior is exactly what you are used to from prior lessons.

However, the memory that was allocated by malloc is in the heap.

This memory will not automatically be freed when the function returns.

So, when you execute the return statement,

you will destroy the frame but not change anything in the heap.

Anything allocated in the heap will continue to exist until you explicitly free it.

Which allows you to allocate memory inside a function,

and return a valid pointer to use it in other functions.

探索我們的目錄

免費加入並獲得個性化推薦、更新和優惠。

Coursera 致力於普及全世界最好的教育，它與全球一流大學和機構合作提供在線課程。

© 2018 Coursera Inc. 保留所有權利。

通過 App Store 下載

通過 Google Play 獲取