| 1 |
/*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*\ |
| 2 |
|
| 3 |
File: octapi_bt0.h |
| 4 |
|
| 5 |
Copyright (c) 2001-2007 Octasic Inc. |
| 6 |
|
| 7 |
Description: |
| 8 |
|
| 9 |
Library used to manage a binary tree of variable max size. Library is |
| 10 |
made to use one block of contiguous memory to manage the tree. |
| 11 |
|
| 12 |
This file is part of the Octasic OCT6100 GPL API . The OCT6100 GPL API is |
| 13 |
free software; you can redistribute it and/or modify it under the terms of |
| 14 |
the GNU General Public License as published by the Free Software Foundation; |
| 15 |
either version 2 of the License, or (at your option) any later version. |
| 16 |
|
| 17 |
The OCT6100 GPL API is distributed in the hope that it will be useful, but |
| 18 |
WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY |
| 19 |
or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License |
| 20 |
for more details. |
| 21 |
|
| 22 |
You should have received a copy of the GNU General Public License |
| 23 |
along with the OCT6100 GPL API; if not, write to the Free Software |
| 24 |
Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 25 |
|
| 26 |
$Octasic_Release: OCT612xAPI-01.00-PR49 $ |
| 27 |
|
| 28 |
$Octasic_Revision: 11 $ |
| 29 |
|
| 30 |
\*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*-*/ |
| 31 |
#ifndef __OCTAPI_BT0_H__ |
| 32 |
#define __OCTAPI_BT0_H__ |
| 33 |
|
| 34 |
#include "octdef.h" |
| 35 |
|
| 36 |
#define OCTAPI_BT0_BASE 0xFFFF0000 |
| 37 |
#define OCTAPI_BT0_KEY_SIZE_NOT_MUTLIPLE_OF_UINT32 OCTAPI_BT0_BASE+0x0001 |
| 38 |
#define OCTAPI_BT0_DATA_SIZE_NOT_MUTLIPLE_OF_UINT32 OCTAPI_BT0_BASE+0x0002 |
| 39 |
#define OCTAPI_BT0_MALLOC_FAILED OCTAPI_BT0_BASE+0x0003 |
| 40 |
#define OCTAPI_BT0_NO_NODES_AVAILABLE OCTAPI_BT0_BASE+0x0004 |
| 41 |
#define OCTAPI_BT0_KEY_ALREADY_IN_TREE OCTAPI_BT0_BASE+0x0005 |
| 42 |
#define OCTAPI_BT0_KEY_NOT_IN_TREE OCTAPI_BT0_BASE+0x0006 |
| 43 |
|
| 44 |
/* Possible result for Find Or Add function. */ |
| 45 |
#define OCTAPI0_BT0_NODE_FOUND 0 |
| 46 |
#define OCTAPI0_BT0_NODE_ADDDED 1 |
| 47 |
|
| 48 |
#define OCTAPI_BT0_NO_SMALLER_KEY 0xAAAAAAAA |
| 49 |
|
| 50 |
#ifdef __cplusplus |
| 51 |
extern "C" { |
| 52 |
#endif /* __cplusplus */ |
| 53 |
|
| 54 |
#define octapi_bt0_get_size( number_of_items, key_size, data_size, b_size ) OctApiBt0GetSize( (UINT32) number_of_items,(UINT32) key_size, (UINT32) data_size, (PUINT32) b_size ) |
| 55 |
#define octapi_bt0_init( b, number_of_items, key_size, data_size ) OctApiBt0Init( (void **) b,(UINT32) number_of_items,(UINT32) key_size, (UINT32) data_size ) |
| 56 |
#define octapi_bt0_add_node( b, key, data ) OctApiBt0AddNode( (void *) b,(void *) key,(void **) data ) |
| 57 |
#define octapi_bt0_remove_node( b, key ) OctApiBt0RemoveNode( (void *) b,(void *) key ) |
| 58 |
#define octapi_bt0_query_node( b, key, data ) OctApiBt0QueryNode( (void *) b,(void *) key,(void **) data ) |
| 59 |
#define octapi_bt0_get_first_node( b, key, data ) OctApiBt0GetFirstNode( (void *) b,(void **) key, (void **) data ) |
| 60 |
|
| 61 |
UINT32 OctApiBt0GetSize( UINT32 number_of_items, UINT32 key_size, UINT32 data_size, UINT32 * b_size ); |
| 62 |
UINT32 OctApiBt0Init( void ** b, UINT32 number_of_items, UINT32 key_size, UINT32 data_size ); |
| 63 |
UINT32 OctApiBt0AddNode( void * b, void * key, void ** data ); |
| 64 |
UINT32 OctApiBt0RemoveNode( void * b, void * key ); |
| 65 |
UINT32 OctApiBt0QueryNode( void * b, void * key, void ** data ); |
| 66 |
UINT32 OctApiBt0GetFirstNode( void * b, void ** key, void ** data ); |
| 67 |
UINT32 OctApiBt0FindOrAddNode( void * b, void * key, void ** data, UINT32 *fnct_result ); |
| 68 |
|
| 69 |
UINT32 OctApiBt0AddNodeReportPrevNodeData( void * b, void * key, void ** data, void ** prev_data, UINT32 *fnct_result ); |
| 70 |
|
| 71 |
#ifdef __cplusplus |
| 72 |
} |
| 73 |
#endif /* __cplusplus */ |
| 74 |
|
| 75 |
#endif /*__OCTAPI_BT0_H__*/ |