01-04-2009
You are right. I check the code and finally find that the error is from an assignment. but it is still strange.
list[size-2]->left = list[size-1];
the result is: list[size-2] = list[size-1];
As said before, correct before list[8] and wrong from list[9], ->left seems not to exist
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 X11R4
readahead
readahead(8) System Manager's Manual readahead(8)
NAME
readahead - file preloader for boot process optimization
SYNOPSIS
readahead [options] <file-list> [another-file-list [...]]
DESCRIPTION
readahead is a files preloader designed to optimize the disk I/O during the boot process.
OPTIONS
-b, --build
build optimised files list only, without sorting.
-s, --sort
build and sort list of files only (implies -b).
-o, --output <file>
write sorted list of files to file.
-d, --dont-sort
preload files described by an already sorted files list.
-h, --help
print the usage information.
-v, --verbose
enable the verbose mode.
-t, --timing
report time spent on each operation.
-m, --maxsize <max size>
maximum size in KiB a file can be in order to be preloaded, default is 10240.
<file-list> [another-file-list [...]]
One or more files containing the list of files to be preloaded or sorted. The files list can be generated by readahead-collector(8).
FILES
/etc/default/readahead-fedora
SEE ALSO
readahead-collector(8), readahead(2),
AUTHORS
Arjan van de Ven <arjan@infradead.org>,
Ziga Mahkovec <ziga.mahkovec@klika.si>, Karel Zak <kzak@redhat.com>,
This manual page was written by Raphael Geissert <geissert@debian.org>
July 2011 readahead(8)