01-02-2009
malloc gives the same memory to two different nodes. How to deal with it?
When allocating memory for two different nodes, the resulting memory are the same. Clearly, this will lead to a mistake. This happened in a function. And the process must be in a function.
(gdb) p tree->list[9]
$43 = (node *) 0x8be4180
(gdb) p tree->list[10]
$44 = (node *) 0x8be4180
At the beginning, it is correct. list[0] to list[8] is allocated properly. But it can not work well in list[9]
Last edited by cdbug; 01-02-2009 at 02:37 AM..
10 More Discussions You Might Find Interesting
1. Programming
Hi,
I'm trying to learn how to manage memory when I have to deal with lots of data.
Basically I'm indexing a huge file (5GB, but it can be bigger), by creating tables that
holds offset <-> startOfSomeData information. Currently I'm mapping the whole file at
once (yep!) but of course the... (1 Reply)
Discussion started by: emitrax
1 Replies
2. Programming
Actually for a process to run it needs text, stack , heap and data segments. All these find a place in the physical memory.
Out of these 4 only heap does exist after the termination of the process that created it. I want to know the exact reason why this happens. Also why the other process need to... (20 Replies)
Discussion started by: karthiktceit
20 Replies
3. Programming
there seems not to be error in this segment. In some computers, it can work well. But in others, it will give a failure.
why it ocurrs and how to deal with it?
in a function:
if( *ver == NULL ) {
*ver = (vertex *) malloc(sizeof(vertex)); //this line
... (17 Replies)
Discussion started by: cdbug
17 Replies
4. Programming
Hi to all,
Recently i am testing an equipment that runs in i586 fedora linux. I have to test mmap function. For that i determined to fill the memory and run the required application to check whether it throws any mmap error regarding low resources.
This is the line that does the allocation. ... (3 Replies)
Discussion started by: frozensmilz
3 Replies
5. Programming
In a 'C' program,when I am trying to allocate memory with the help of malloc () function, it is allocating the memory up to a certain limit for e.g. in my case, it is 670 MB (approx). malloc() returns NULL if I allocate more than this amount of memory.When I tried
to allocate memory in chunks of... (1 Reply)
Discussion started by: vipinsachan
1 Replies
6. Programming
Hi All,
I have a simple code which does some computation by matching string patterns.
In brief:
1. The code reads .dat and .txt files.
2. .dat files are huge text files and .txt files contain some important words.
3. I am just doing strstr to find the patterns.
4. The function returns the... (3 Replies)
Discussion started by: shoaibjameel123
3 Replies
7. Programming
*** glibc detected *** ./a.out: malloc(): memory corruption (fast):
Posted A minute ago
M trying to make multiway tree and dont know what happend when this part of code get executed:
01void ins(NODE *ptr)
02{
03 //working
04 if(ptr!=NULL)
05 {
06 SNODE *var=NULL;
07 var=(SNODE... (3 Replies)
Discussion started by: exgenome
3 Replies
8. Programming
I am using libxml2 library for XMl parsing and libxml++ is C++ wrapper over that. So I am using API of libxml++. I am creating my class and composing instance xmlpp::Node *pNode in that. my class also have funciton prepareXPathQuery() which creates query string and have other fucntion... (2 Replies)
Discussion started by: sharadwagh
2 Replies
9. Programming
Hi Friends,
while executing the below code, am getting *** glibc detected *** ./ok: malloc(): memory corruption (fast) error, please suggest how to solve this issue.
#include <stdio.h>
#include <string.h>
#include <sqlca.h>
#include <alloca.h>
/* Define constants for VARCHAR... (2 Replies)
Discussion started by: mpjobsrch
2 Replies
10. Programming
I am facing a problem of memory corruption. The loop runs for the first time but does not go through the second time. What could be the problem?
for(int z=0;z<2;z++)
{
fp=fopen("poly.dat","r");
/*do something which reads this file into a 2D array*/
fclose(fp);
... (10 Replies)
Discussion started by: dare
10 Replies
LEARN ABOUT DEBIAN
pod::abstract::tree
Pod::Abstract::Tree(3pm) User Contributed Perl Documentation Pod::Abstract::Tree(3pm)
NAME
Pod::Abstract::Tree - Manage a level of Pod document tree Nodes.
DESCRIPTION
Pod::Abstract::Tree keeps track of a set of Pod::Abstract::Node elements, and allows manipulation of that list of elements. Elements are
stored in an ordered set - a single node can appear once only in a single document tree, so inserting a node at a point will also remove it
from it's previous location.
This is an internal class to Pod::Abstract::Node, and should not generally be used externally.
METHODS
detach
$tree->detach($node);
Unparent the $node from $tree. All other elements will be shifted to fill the empty spot.
push
Add an element to the end of the node list.
pop
Remove an element from the end of the node list.
insert_before
$tree->insert_before($target,$node);
Insert $node before $target. Both must be children of $tree
insert_after
$tree->insert_after($target,$node);
Insert $node after $target. Both must be children of $tree
unshift
Remove the first node from the node list and return it.
Unshift takes linear time - it has to relocate every other element in id_map so that they stay in line.
children
Returns the in-order node list.
index_relative
my $node = $tree->index_relative($target, $offset);
This method will return a node at an offset of $offset (which may be negative) from this tree structure. If there is no such node, undef
will be returned. For example, an offset of 1 will give the following element of $node.
AUTHOR
Ben Lilburne <bnej@mac.com>
COPYRIGHT AND LICENSE
Copyright (C) 2009 Ben Lilburne
This program is free software; you can redistribute it and/or modify it under the same terms as Perl itself.
perl v5.10.1 2010-01-03 Pod::Abstract::Tree(3pm)