Sponsored Content
Full Discussion: C++/ROOT Memory Allocation?
Top Forums Programming C++/ROOT Memory Allocation? Post 302803435 by hanson44 on Monday 6th of May 2013 06:03:30 PM
Old 05-06-2013
Should have seen that. Smilie I'm glad you found it.
 

10 More Discussions You Might Find Interesting

1. UNIX for Dummies Questions & Answers

memory allocation

I would like to know how I could allocate some more memory to a process. Please note that I am not the root user. (1 Reply)
Discussion started by: sagar
1 Replies

2. UNIX for Advanced & Expert Users

threads and memory allocation

Hello! First of all, forgive me for bad English. When I starts new thread (pthread_create), system allocates some memory for it (for example, for thread's stack). I wonder when does it deallocate this memory? The problem is that I have a program which sometimes creates new threads and sometimes... (3 Replies)
Discussion started by: prankster
3 Replies

3. HP-UX

HP-UX memory usage allocation

Hi all, I have a HP-UX Server with 4 gigabytes of physical RAM. When I use the 'Glance' utility to see what my memory utilization is, my memory usage shows up maxed out at 99%. I shut off all the known processes that I'm running on that box and the memory utilization is still at 78% (with Swap... (3 Replies)
Discussion started by: dehuang83
3 Replies

4. Programming

Is there a problem with the memory allocation???

I have a scenario like the client has to search for the active server.There will be many servers.But not all server are active.And at a time not more than one server will be active. The client will be in active state always i.e, it should always search for an active server until it gets one.I... (1 Reply)
Discussion started by: vigneshinbox
1 Replies

5. Programming

Memory allocation in C

Hi Experts I need some help in static memory allocation in C. I have a program in which I declared 2 variables, one char array and one integer. I was little surprised to see the addresses of the variables. First: int x; char a; printf("%u %u\n', &x, a); I got the addresses displayed... (2 Replies)
Discussion started by: unx_freak
2 Replies

6. Programming

Dynamic Memory Allocation

Hello Guys I have a small confusion in the dynamic memory allocation concept. If we declare a pointer say a char pointer, we need to allocate adequate memory space. char* str = (char*)malloc(20*sizeof(char)); str = "This is a string"; But this will also work. char* str = "This... (2 Replies)
Discussion started by: tene
2 Replies

7. Programming

Memory Allocation Query

When we dynamically allocate the memory say 100 integers say int *x = new int(1000); then does entire chunk of memory gets allocated at once after the completion of the statement? I mean will the the concept of page fault come into picture over here? (3 Replies)
Discussion started by: rupeshkp728
3 Replies

8. Shell Programming and Scripting

memory allocation to a variable

hello all.. i'm a beginner in shell scripting. I need to know what is really happening when we are creating a variable in shell scripting? how memory is allocated for that variable? (3 Replies)
Discussion started by: aarathy
3 Replies

9. Programming

memory allocation for string in C

hi in the following code, how the memory is allocated for a1 which holds the values of a2 after cpy function call. #include <stdio.h> #include <string.h> void cpy(char* d, const char* s){ while(*d++=*s++); } main(){ char* a1; char* a2="done"; cpy(a1,a2); ... (3 Replies)
Discussion started by: mprakasheee
3 Replies

10. UNIX for Dummies Questions & Answers

Memory allocation problem

I am using ubuntu. I have written a program to calculate prime factors. it works perfectly fine till entered number is less than 9989 (or so ) but when one enters a number higher than that, for example 15000, it does not work. Can anyone guide me whats the problem ? although new codes are welcome,... (2 Replies)
Discussion started by: Abhishek_kumar
2 Replies
MYRESCUE(8)							   User Commands						       MYRESCUE(8)

NAME
myrescue - Harddisc Rescue SYNOPSIS
myrescue [-b block-size] [-B bitmap-file] [-A] [-S] [-r retry-count] [-f skip-failed] [-s start-block] [-e end-block] [-R] [-G good-range] [-F failed-range] [-J jump-after-blocks] input-file output-file DESCRIPTION
myrescue is a program to rescue the still-readable data from a damaged harddisk. It is similiar in purpose to dd_rescue, but it tries to quickly get out of damaged areas to first handle the not yet damaged part of the disk and return later. The program tries to copy the device blockwise to a file and keeps a table ("block bitmap") noting whether a block has been successfully copied, not yet handled or has had errors. This block bitmap can be used in successive runs to concentrate on the not yet rescued blocks. The program has a special skip mode to handle read errors. Usually harddisk surface defects cover more than just one block and continuous reading in defect areas can damage the surface, the heads and (by permanent recalibration) the drive mechanics. If this happens, the chances of rescuing the remaining undamaged data drop dramatically. So in skip mode, myrescue tries to get out of damaged areas quickly by exponentially increasing the stepsize. The skipped blocks are marked as unhandled in the block bitmap and can be retried later. Finally, the program has an option to multiply try to read a block before considering it damaged. NOTE
This tools is no replacement for a professional data recovery service! If you do have the latter option, don't even think of using myres- cue, as it may further damage your disk. This tool is provided only for the case that you are absolutely desperate and definitely cannot afford a professional data recovery. Or in case you know what you are doing, e.g. if you know that it is the aging of the magnetisation layer that is causing your problem. In any case do not expect too much. While complete restores have been witnessed, you should not take them for granted. A better attitude is to consider your data lost and be glad for any survivors that turn up. The usual GPL disclaimer applies. Especially the NON-WARRANTY OF FITNESS FOR A PARTICULAR PURPOSE. Don't blame (or sue) me if it fails to recover or further damages your data. And a final word you probably don't want to hear in this situation: For the future consider a routinely backup to avoid a "next time". OPTIONS
-b block-size The size of the blocks (in bytes). Set this to your harddiscs error detection/correction unit size. Usually this is 4096, which hap- pens to be the default. -B bitmap-file The file containing the status table of all blocks. Nice (or frightening...) to view with hexdump. 01 means OK; 00 means not yet done; negative values mean the number of failed read attempts. If not given, defaults to output-file.bitmap -A Abort when encountering errors. -S Activate skip mode: When encountering errors increase the stepsize exponentially until a readable block is found. -f skip-failed Skip blocks that have already had skip-failed failures. Useful to avoid scratching the same block over and over again. -r retry-count The number of times to read a block before it is declared bad for this run. (You can still retry it on the next run.) Default: 1 -s start-block The number of the block to start with. Default: 0 -e end-block The number of the block, where reading stops (not included!). Default: size of input-file divided by block-size. -R Reverse reading direction, i.e. from end-block (excluded) to start-block -G good-range Only try to read blocks within good-range blocks from an already successfully read block. -F failed-range Extends -f to also skip any block within failed-range blocks of a block to be skipped as specified by -f. -J jump-after-blocks Randomly jump across the disc after reading jump-after-blocks blocks. This might be useful to scan discs with scattered defects. In jump mode -S causes myrescue to jump to a new block upon the first failed sector or upon hitting a sector to be skipped as specified by -f, -G or -F. -h, -? Display usage information. RECOMMENDED PROCEDURE
o Make sure you have sufficient disk space to copy the whole partition (not just the used ammount of data) to plus some space for the block bitmap (1 byte per block). o Determine the hardware block size (CRC/ECC unit) of your harddisk. This may be found out from hdparm, some entries in /proc/ide/hd? or on the web. I have not yet checked whether this is possible with an ioctl. If you have, please let me know. o Start a skip mode run with one retry per block to first copy the undamaged area. o Start a normal run with one retry per block to copy the remaining skipped blocks. You may try to use -f 1 to skip the damaged blocks from the first run. o Repeat until the number of errors seems to have converged. Try waiting a couple of hours between the retries. o Repeat this with higher retry counts and wait for convergence. o Make a copy of the rescued data and run fsck on it. o Mount the filesystem (if copied to a file: via loopback) and check your data. If directory information has been destroyed, fsck moves unidentifiable file fragments to lost+found, so you should also check this location. It may help to try reading non-defect areas in between to allow the drive to recalibrate. The developers are glad to hear about your experiences. Please post them to the Experiences forum on the Sourceforge Project page. Thank you! KNOWN BUGS
The handling of the bitmap-file currently relies on the filesystem semantics, that when lseek(2) ing beyond the end of file and then writ- ing, the space in between is filled with zero-bytes. The block bitmap overflows after 128 failed read attempts. AUTHORS
Kristof Koehler <kristofk@users.sourceforge.net>, Peter Schlaile <schlaile@users.sourceforge.net> SEE ALSO
dd(1), dd_rescue(no manpage?) http://www.google.de/search?q=data+recovery http://myrescue.sourceforge.net/ myrescue 0.9.4 August 2007 MYRESCUE(8)
All times are GMT -4. The time now is 11:10 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy