Sponsored Content
Full Discussion: Hashtable + shared memory
Top Forums Programming Hashtable + shared memory Post 302487005 by andrew.paul on Tuesday 11th of January 2011 06:37:00 AM
Old 01-11-2011
Hi crona,,

Here i am attaching my code that handle single hashtable operation.I need to modify this program that should handle nested hashtable.The hashtable whose KEYs are strings and Values are again hashtables.

Code:
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
typedef size_t hash_size;
 struct hashnode_s {
        char *key;
        void *data;
        struct hashnode_s *next;
};
typedef struct hashtbl {
        hash_size size;
        struct hashnode_s **nodes;
        hash_size (*hashfunc)(const char *);
} HASHTBL;
static char *mystrdup(const char *s)
{
    char *b;
    if(!(b=malloc(strlen(s)+1))) return NULL;
    strcpy(b, s);
    return b;
}
static hash_size def_hashfunc(const char *key)
{
    hash_size hash=0;
    while(*key) hash+=(unsigned char)*key++;
    return hash;
}
HASHTBL *hashtbl_create(hash_size size, hash_size(*hashfunc)(const char *))
{
    HASHTBL *hashtbl;
    if(!(hashtbl=malloc(sizeof(HASHTBL)))) return NULL;      if(!(hashtbl->nodes=calloc(size, sizeof(struct hashnode_s*)))) {
        free(hashtbl);
        return NULL;
    }
    hashtbl->size=size;
    if(hashfunc) hashtbl->hashfunc=hashfunc;
    else hashtbl->hashfunc=def_hashfunc;
    return hashtbl;
}

int hashtbl_insert(HASHTBL *hashtbl, const char *key, void *data)
{
    struct hashnode_s *node;
    hash_size hash=hashtbl->hashfunc(key)%hashtbl->size;    
    node=hashtbl->nodes[hash];
    while(node) {
        if(!strcmp(node->key, key)) {
            node->data=data;
            return 0;
        }
        node=node->next;
                  }
    if(!(node=malloc(sizeof(struct hashnode_s)))) return -1;
    if(!(node->key=mystrdup(key))) {
        free(node);
        return -1;
    }
    node->data=data;      /*this data should point to the another hash table*/
    node->next=hashtbl->nodes[hash];
    hashtbl->nodes[hash]=node; 
    return 0;
}
void *hashtbl_get(HASHTBL *hashtbl, const char *key)
{
    struct hashnode_s *node;
    hash_size hash=hashtbl->hashfunc(key)%hashtbl->size;
    node=hashtbl->nodes[hash];
    while(node) {
        if(!strcmp(node->key, key)) return node->data;
        node=node->next;
    }
       return NULL;
}

int main()
{

HASHTBL *hashtbl;
    if(!(hashtbl=hashtbl_create(16, NULL))) {
                fprintf(stderr, "ERROR: hashtbl_create() failed\n");
                exit(EXIT_FAILURE);
        }
 hashtbl_insert(hashtbl, "Sports", "cricket");
 printf("After insert:%s\n",hashtbl_get(hashtbl, "Sports"));
return 0;
}

Now i am trying to implement h(sports)=>hashtable,ie it should contain hash table that should contain records of cricket,football,tennis etc.....
Code:
H=>
key           data

Sports              H1
Animals           H2
H1=>
cricket               ....
football            ....
H2=> 
cat                          ......
dog                        ......

Thanks in advance

Last edited by Franklin52; 01-13-2011 at 02:53 PM.. Reason: Code tags
 

10 More Discussions You Might Find Interesting

1. Programming

Shared memory

Dear Reader, Is is necessary to attach / dettach the shared memory segments for write operations , if more than one program is accessing same shared memory segments.. I have used semaphore mutex and still I'm getting segmentation fault when I write to the segment when other program is already... (1 Reply)
Discussion started by: joseph_shibu
1 Replies

2. UNIX for Advanced & Expert Users

Shared memory shortage but lots of unused memory

I am running HP-UX B.11.11. I'm increasing a parameter for a database engine so that it uses more memory to buffer the disk drive (to speed up performance). I have over 5GB of memory not being used. But when I try to start the DB with the increased buffer parameter I get told. "Not... (1 Reply)
Discussion started by: cjcamaro
1 Replies

3. Linux

all about shared memory

Hi all :confused: , I am new to unix.I have been asked to implement shared memory in user's mode.What does this mean?What is the difference it makes in kernel mode and in users mode?What are the advantages of this impemenation(user's mode)? And also i would like to know why exactly shared... (0 Replies)
Discussion started by: vijaya2006
0 Replies

4. Programming

help with shared memory

what i want to do is have an int that can been written into by 2 processes but my code doesn't seem to work. #include <sys/types.h> #include <sys/ipc.h> #include <sys/sem.h> #include <sys/shm.h> #include<stdio.h> #define KEY1 (1492) int main() { int shmid; volatile int * addr;... (6 Replies)
Discussion started by: ddx08
6 Replies

5. Programming

memory sharing - not shared memory -

hi, this is the problem: i want to swap a linked list between 4 processes (unrelated), is there any way i can do that just by sending a pointer to a structure? //example typedef struct node { int x; char c; struct node *next; } node; or i should send the items ( x,c ) by... (9 Replies)
Discussion started by: elzalem
9 Replies

6. Programming

Shared memory in shared library

I need to create a shared library to access an in memory DB. The DB is not huge, but big enough to make it cumbersome to carry around in every single process using the shared library. Luckily, it is pretty static information, so I don't need to worry much about synchronizing the data between... (12 Replies)
Discussion started by: DreamWarrior
12 Replies

7. Programming

Shared memory for shared library

I am writing a shared library in Linux (but compatible with other UNIXes) and I want to allow multiple instances to share a piece of memory -- 1 byte is enough. What's the "best" way to do this? I want to optimize for speed and portability. Obviously, I'll have to worry about mutual exclusion. (0 Replies)
Discussion started by: otheus
0 Replies

8. UNIX for Advanced & Expert Users

Shared Memory

Hi, Using ipcs we can see shared memory, etc.. details. How can I add/remove shared memory(command name)? Thanks, Naga:cool: (2 Replies)
Discussion started by: Nagapandi
2 Replies

9. AIX

shared memory

1.How to know wich process is using the shared memory? 2.How to flush (release) the process from the shared memory? (1 Reply)
Discussion started by: pchangba
1 Replies

10. Programming

Shared library with acces to shared memory.

Hello. I am new to this forum and I would like to ask for advice about low level POSIX programming. I have to implement a POSIX compliant C shared library. A file will have some variables and the shared library will have some functions which need those variables. There is one special... (5 Replies)
Discussion started by: iamjag
5 Replies
HASH(9) 						   BSD Kernel Developer's Manual						   HASH(9)

NAME
hash, hash32, hash32_buf, hash32_str, hash32_strn, hash32_stre, hash32_strne -- general kernel hashing functions SYNOPSIS
#include <sys/hash.h> uint32_t hash32_buf(const void *buf, size_t len, uint32_t hash); uint32_t hash32_str(const void *buf, uint32_t hash); uint32_t hash32_strn(const void *buf, size_t len, uint32_t hash); uint32_t hash32_stre(const void *buf, int end, const char **ep, uint32_t hash); uint32_t hash32_strne(const void *buf, size_t len, int end, const char **ep, uint32_t hash); DESCRIPTION
The hash32() functions are used to give a consistent and general interface to a decent hashing algorithm within the kernel. These functions can be used to hash ASCII NUL terminated strings, as well as blocks of memory. The hash32_buf() function is used as a general buffer hashing function. The argument buf is used to pass in the location, and len is the length of the buffer. The argument hash is used to extend an existing hash, or is passed the initial value HASHINIT to start a new hash. The hash32_str() function is used to hash a NUL terminated string passed in buf with initial hash value given in hash. The hash32_strn() function is like the hash32_str() function, except it also takes a len argument, which is the maximal length of the expected string. The hash32_stre() and hash32_strne() functions are helper functions used by the kernel to hash pathname components. These functions have the additional termination condition of terminating when they find a character given by end in the string to be hashed. If the argument ep is not NULL, it is set to the point in the buffer at which the hash function terminated hashing. RETURN VALUES
The hash32() functions return a 32 bit hash value of the buffer or string. EXAMPLES
LIST_HEAD(head, cache) *hashtbl = NULL; u_long mask = 0; void sample_init(void) { hashtbl = hashinit(numwanted, type, flags, &mask); } void sample_use(char *str, int len) { uint32_t hash; hash = hash32_str(str, HASHINIT); hash = hash32_buf(&len, sizeof(len), hash); hashtbl[hash & mask] = len; } SEE ALSO
free(9), hashinit(9), malloc(9) LIMITATIONS
The hash32() functions are only 32 bit functions. They will prove to give poor 64 bit performance, especially for the top 32 bits. At the current time, this is not seen as a great limitation, as these hash values are usually used to index into an array. Should these hash values be used for other means, this limitation should be revisited. HISTORY
The hash functions were first committed to NetBSD 1.6. The OpenBSD versions were written and massaged for OpenBSD 2.3 by Tobias Weingartner, and finally committed for OpenBSD 3.2. BSD
April 3, 2007 BSD
All times are GMT -4. The time now is 08:24 AM.
Unix & Linux Forums Content Copyright 1993-2022. All Rights Reserved.
Privacy Policy