nodehvs.h

Go to the documentation of this file.

/**********************************************************************
 *
 * Verball Model Storage Library, Common Information Model Library 
 * for integration of Intelligent Services.
 * Copyright (C) 2005 Nikita Vinokurov, Orgway LLC.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; 
 * version 2.1 of the License.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, 
 * Boston, MA  02110-1301  USA
 *
 * $Id: nodehvs.h,v 1.9 2006/09/18 21:38:32 sbreg Exp $
 **********************************************************************/


#ifndef _NODEHVS_H_
#define _NODEHVS_H_

#include "node.h"



typedef uword64 nhash_t;


typedef struct _nhvs_seq_list {
    nhash_t hash_value; 
    Node node_value; 
    struct _nhvs_seq_list *next; 
} NHVSSeqList;

typedef struct _nhvs_tree_node {
    struct _nhvs_tree_node *left; 
    struct _nhvs_tree_node *right; 
    struct _nhvs_seq_list *first; 
    int last_id; 
    nhash_t hash_value; 
} NHVSTreeNode;

#if defined(_WIN32) && !defined(__MINGW32__)
#define NHASH_SEQ_MASK 0xFF00000000000000i64
#define NHASH_HASH_MASK 0x00FFFFFFFFFFFFFFi64
#else
#define NHASH_SEQ_MASK 0xFF00000000000000LL
#define NHASH_HASH_MASK 0x00FFFFFFFFFFFFFFLL
#endif

#if defined(_WIN32) && !defined(__MINGW32__)
#define NHASH_SEQ(n) (((n) >> 56 ) & 0xFFi64) 
#else
#define NHASH_SEQ(n) (((n) >> 56 ) & 0xFFLL) 
#endif

#define NHASH_HASH(n) ((n) & NHASH_HASH_MASK)

#define SET_NHASH_HASH(n,h) (((n) & NHASH_SEQ_MASK) | ((h) & NHASH_HASH_MASK))

#if defined(_WIN32) && !defined(__MINGW32__)
#define SET_NHASH_SEQ(n,s) (((n) & NHASH_HASH_MASK) | (((s) & 0xFFLL) << 56  ))
#else
#define SET_NHASH_SEQ(n,s) (((n) & NHASH_HASH_MASK) | (((s) & 0xFFLL) << 56  ))
#endif




nhash_t nhvs_get_hash( Node *node );

STORAGE_TYPE
Node *nhvs_get_node( nhash_t hash );

int nhvs_put_local( nhash_t hash, Node *node );

STORAGE_TYPE
void nhvs_update_hash ( nhash_t *hash, Node *node);


/*
STORAGE_TYPE
int nhvs_dict_set(Node *node,  unsigned long id, const char *string);
*/

/* Lookup for dictionary item.
 * Searches the item id, associated with the string.
 * If the string is found, fills the Node::id and Node::parsed fields
 *  of \a node structure.
 * \returns positive value in case of success and zero otherwise.
 */

STORAGE_TYPE
int nhvs_dict_lookup(Node *node, const char *string);

void nhvs_parsed_set(Node *node, const char *string);


int nhvs_gen_set(Node *node, const char *string); 

nhash_t nhash_hash_func ( Node *node);

STORAGE_TYPE
int nhvs_new();

STORAGE_TYPE
int nhvs_free();


#endif /* _NODEHVS_H_ */
#ifdef DMALLOC
#include<dmalloc.h>
#endif

---