10-15-2010
If user space heap and kernel space heaps are diff, can the allocated kernel/ user areas be accessed by mapping in either case all times?
10 More Discussions You Might Find Interesting
1. Programming
hello sir
since by mentioning a integer pointer and storing the integers
by incrementing the pointer value
then what is the purpose of malloc?
u can decalre it as
in t *p;
several integers can be stored by incrementing the value of p,
hence what is the diffrence between this... (2 Replies)
Discussion started by: rajashekaran
2 Replies
2. Programming
Hi!
I hope this is the correct forum to post the question even if I'm a newbie...
I am a C-newbie (and really on the edge to be a C-addict ;) ) and have a question.
When should I use malloc?
To state it differently, when should I NOT use malloc?
For instance, if I have an array of... (5 Replies)
Discussion started by: Tonje
5 Replies
3. UNIX for Dummies Questions & Answers
will kmalloc function allocate memory from kernel space or user space?
what exactly is the difference between kernel api and system call?
can anyone please send me the answer? its urgent. (0 Replies)
Discussion started by: sriram.ec
0 Replies
4. Programming
Some one please explain me what is Dynamic memory allocation and the use of malloc() function.How do we allocate memory dynamically and also the other way? (3 Replies)
Discussion started by: rash123
3 Replies
5. Programming
Hey Guys
I am trying to implement the malloc function for my OS class and I am having a little trouble with it. I would be really grateful if I could get some hints on this problem.
So I am using a doubly-linked list as my data structure and I have to allocate memory for it (duh...). The... (1 Reply)
Discussion started by: Gambit_b
1 Replies
6. UNIX for Advanced & Expert Users
Hey Guys
Some of my friends have got together and we are trying to write a basic kernel similar to Linux. I am trying to implement the malloc function in C and I am using a doubly linked list as the primary data structure. I need to allocate memory for this link list (duh...) and I don't feel... (2 Replies)
Discussion started by: rbansal2
2 Replies
7. Programming
Why when using realloc, john is reversed 3 times but not the other 2 names ? But if I use malloc, then the 3 names are reversed correctly ? (but then there is a memory leak)
How can I reverse all 3 names without a memory leak ?
char *BUFFER = NULL;
char *STRREVERSE(const char *STRING)
{... (5 Replies)
Discussion started by: cyler
5 Replies
8. Programming
Hi i found code in google how to malloc an 2D array and i tried that :
#include<stdio.h>
#include<stdlib.h>
int **A;
int **B;
int main(int argc,char *argv)
{
printf("name of text : %s\n",argv);
//read arrays
int i,j;
int l,m;
int M,n;
FILE *fp;
fp=fopen(argv,"r");
... (0 Replies)
Discussion started by: giampoul
0 Replies
9. Programming
Which one is faster among malloc and new?
My understanding is that since new also has to call constructors after allocating memory it must be slower than malloc.
Am I correct? (1 Reply)
Discussion started by: rupeshkp728
1 Replies
10. UNIX for Dummies Questions & Answers
Good day! I'm a newbie in C. I'm trying to get an unlimited input from the user using malloc then printing the inputs after the user presses enter. My code works, but there's a warning that I don't know how to fix. Please help me. Thank you.
Here's my code:
#include <stdio.h>
#include... (6 Replies)
Discussion started by: eracav
6 Replies
LEARN ABOUT DEBIAN
heap071::elem
Heap071::Elem(3pm) User Contributed Perl Documentation Heap071::Elem(3pm)
NAME
Heap::Elem - Perl extension for elements to be put in Heaps
SYNOPSIS
use Heap::Elem::SomeInheritor;
use Heap::SomeHeapClass;
$elem = Heap::Elem::SomeInheritor->new( $value );
$heap = Heap::SomeHeapClass->new;
$heap->add($elem);
DESCRIPTION
This is an inheritable class for Heap Elements. It provides the interface documentation and some inheritable methods. Only a child
classes can be used - this class is not complete.
METHODS
$elem = Heap::Elem::SomeInheritor->new( [args] );
Creates a new Elem.
$elem->heap( $val ); $elem->heap;
Provides a method for use by the Heap processing routines. If a value argument is provided, it will be saved. The new saved value is
always returned. If no value argument is provided, the old saved value is returned.
The Heap processing routines use this method to map an element into its internal structure. This is needed to support the Heap methods
that affect elements that are not are the top of the heap - decrease_key and delete.
The Heap processing routines will ensure that this value is undef when this elem is removed from a heap, and is not undef after it is
inserted into a heap. This means that you can check whether an element is currently contained within a heap or not. (It cannot be
used to determine which heap an element is contained in, if you have multiple heaps. Keeping that information accurate would make the
operation of merging two heaps into a single one take longer - it would have to traverse all of the elements in the merged heap to
update them; for Binomial and Fibonacci heaps that would turn an O(1) operation into an O(n) one.)
$elem1->cmp($elem2)
A routine to compare two elements. It must return a negative value if this element should go higher on the heap than $elem2, 0 if they
are equal, or a positive value if this element should go lower on the heap than $elem2. Just as with sort, the Perl operators <=> and
cmp cause the smaller value to be returned first; similarly you can negate the meaning to reverse the order - causing the heap to
always return the largest element instead of the smallest.
INHERITING
This class can be inherited to provide an oject with the ability to be heaped. If the object is implemented as a hash, and if it can deal
with a key of heap, leaving it unchanged for use by the heap routines, then the following implemetation will work.
package myObject;
require Exporter;
@ISA = qw(Heap::Elem);
sub new {
my $self = shift;
my $class = ref($self) || $self;
my $self = SUPER::new($class);
# set $self->{key} = $value;
}
sub cmp {
my $self = shift;
my $other = shift;
$self->{key} cmp $other->{key};
}
# other methods for the rest of myObject's functionality
AUTHOR
John Macdonald, jmm@perlwolf.com
COPYRIGHT
Copyright 1998-2003, O'Reilly & Associates.
This code is distributed under the same copyright terms as perl itself.
SEE ALSO
Heap(3), Heap::Elem::Num(3), Heap::Elem::NumRev(3), Heap::Elem::Str(3), Heap::Elem::StrRev(3).
perl v5.10.0 2007-08-11 Heap071::Elem(3pm)