C++

Forum

 
Total memory taken by list & vector container

MOM (5)
Hi
I'm using the list and vector containers, and need an exact account of the total memory used by my program. I know that these containers use extra linkage pointers and other overheads per element in the set. How can I find out how much per element exactly for both the containers.
Suppose I insert 100 integers in the list<int> and 100 in vector<int>, how much heap memory is exactly being used. Is there a way of finding out how.

When I submit my program as a job (qsub), the qstat option reports outrageously extra memory used in the v_mem field. So this is not helping.

Thanks in advance.
closed account (zwA4jE8b)
100 integers is (in my case) 400bytes... 4 bytes per integer. You could use a variable counter that keeps track of what is being declared or adder.

So every time you add an integer size += sizeof(int);
MOM (5)
But that does not give an exact count of the total memory used.
I have checked that, by using valgrind's Massif tool, and that too like the 'qstat' reports extra memory usage (although still reasonable).

thanks though...
savavampir (146)
Don't know about list but for vector try capacity function and check it after each push_back.
http://www.cplusplus.com/reference/stl/vector/capacity/
Last edited on
MOM (5)
Well capacity just reports the number of elements as its capacity.. nothing in bytes.. hence it does not take into account the over head required for each container.

thanks...
savavampir (146)

Well capacity just reports the number of elements...

This is wrong! size() function does that.

Well as i understand this function and on this site reference:

Returns the size of the allocated storage space...


So size in bytes is simply:
 
 
sizeof(element) * vector.capacity();
Last edited on
MOM (5)
Well its actually the size in terms of no. of elements

as from the link you sent...
Return Value The size of the currently allocated storage capacity in the vector, measured in the number elements it could hold.
savavampir (146)
I assume that you are aware that if element contain pointer(s) that was allocated elsewhere vector doesn't account for data that it points to, it will just count as 4 bytes (usually).
MOM (5)
Yes, i know that. So the question still remains how can i get my answer for simple datatypes like int.
closed account (D80DSL3A)
Here's a bit from Wikipedia about vectors:
http://en.wikipedia.org/wiki/Vector_%28STL%29

A typical vector implementation consists, internally, of a pointer to a dynamically allocated array,[2] and possibly data members holding the capacity and size of the vector. The size of the vector refers to the actual number of elements, while the capacity refers to the size of the internal array.

This program I just wrote suggests (to me) that the "overhead" may be 20 bytes = sizeof a vector across push_back()'s:
1
2
3
4
5
6
7
8
9
10
11
12
 
int main()
{
	vector<int> iv(1,5);// 1 element
	cout << "iv(size)     = " << sizeof(int)*iv.size() << endl;
	cout << "iv(capacity) = " << sizeof(int)*iv.capacity() << endl;
	cout << "sizeof(iv) = " << sizeof(iv) << endl;
	iv.push_back(7);
	cout << "iv(size)     = " << sizeof(int)*iv.size() << endl;
	cout << "iv(capacity) = " << sizeof(int)*iv.capacity() << endl;
	cout << "sizeof(iv) = " << sizeof(iv) << endl;// this remains constant
        return 0;
}

The output is:

iv(size) = 4
iv(capacity) = 4
sizeof(iv) = 20
iv(size) = 8
iv(capacity) = 8
sizeof(iv) = 20

ne555 (10692)
What about malloc_stats()? (in malloc.h)
helios (17607)
When I submit my program as a job (qsub), the qstat option reports outrageously extra memory used in the v_mem field. So this is not helping.
How much is "outrageously"? The system may also be including stack space (say, 1 MiB) and static data (code and other things).

Try this:
1. Start program.
2. Pause program (usleep() is not a bad idea).
3. Measure size and note the value.
4. Resume program and allocate structure.
5. Pause program.
6. Measure size and compare with previous value.
This is actually what I usually do when I want to do a quick check for memory leaks in code with deterministic deallocations (if the size doesn't decrease when it was expected, there's a leak).
bartoli (271)
Maybe there is a way by changing the new operator to something more personalizable (or a custom allocator)? Because i think a vector will do a series of dynamic memory allocations of small sizes, not just one memory allocation somewhere, so sizeof(), size, capacity,... wont help in that case.

Or maybe, the simplest way would be to make a minimal program that doesn't have memory leaks, allocate your vector dynamically, and see what is lost in valgrind (but the result will also depend on how the allocator manages it's memory)
ML380 (8)
So… If I correctly understand you don’t know how to detect does container contain pointer or stack object? 

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
 
//-------------------------------------------------------------------------------------------------
template <typename Type>
struct TObjectSizeCalculator
{
	enum {size = sizeof(Type)};
};
template <typename Type>
struct TObjectSizeCalculator<Type*>
{
	enum {size = sizeof(Type)};
};
template <typename Container>
unsigned int getMemorySize(Container& container)
{
	const unsigned int elrementMemoryUse = TObjectSizeCalculator<Container::value_type>::size;
	return container.size() * elrementMemoryUse;
}

//-------------------------------------------------------------------------------------------------
int main()
{

	std::list<double*> list1;

	for (unsigned int i = 0; i < 10; ++i)
	{
		list1.push_back(new double);

	}

	std::vector<double> list2(10, 10);
	unsigned int h = getMemorySize(list1);
	unsigned int j = getMemorySize(list2);
}
//-------------------------------------------------------------------------------------------------


result:

1
2
 
h = 80;
j = 80;


Is that what you want to?
Last edited on
LB (13399)
I don't understand the confusion here, it is plain and simple. Say you have a vector<int> named MyV:
sizeof(MyV) is the size of the data members that make up the vector, eg if it had an int* as it's data member, it would be equivalent to sizeof(int*).
MyV.size() is the number of elements in the vector.
MyV.capacity() is the number of elements the vector can hold before automatic or manual reallocation is needed.
MyV.size() * sizeof(int) is the number of bytes of memory your elements are taking up.
MyV.capacity() * sizeof(int) is the number of bytes of memory dynamically allocated by the vector.
MyV.capacity() * sizeof(int) + sizeof(MyV) is how many bytes the vector has in total, including it's own internal data member memory and the memory it has allocated for your elements. This is most likely what you want.
Last edited on
savavampir (146)
Sorry for inrtusion, but i have to ask something about ML380 post, specifically:
1
2
3
4
5
 
template <typename Type>
struct TObjectSizeCalculator<Type*>
{
	enum {size = sizeof(Type)};
};

Never seen this syntax before, can someone elaborate this? I didn't know that you can put '<>' brackets infront struct declaration.
Last edited on
LB (13399)
It's a template specialization.
http://www.cplusplus.com/doc/tutorial/templates/
He's specializing a version of the class for when the type given is a pointer.
savavampir (146)
Thanks.
Topic archived. No new replies allowed.