Commit | Line | Data |
---|---|---|
86530b38 AT |
1 | /* |
2 | * ========== Copyright Header Begin ========================================== | |
3 | * | |
4 | * OpenSPARC T2 Processor File: b_ary.h | |
5 | * Copyright (C) 1995-2007 Sun Microsystems, Inc. All Rights Reserved | |
6 | * 4150 Network Circle, Santa Clara, California 95054, U.S.A. | |
7 | * | |
8 | * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. | |
9 | * | |
10 | * This program is free software; you can redistribute it and/or modify | |
11 | * it under the terms of the GNU General Public License as published by | |
12 | * the Free Software Foundation; version 2 of the License. | |
13 | * | |
14 | * This program is distributed in the hope that it will be useful, | |
15 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
16 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
17 | * GNU General Public License for more details. | |
18 | * | |
19 | * You should have received a copy of the GNU General Public License | |
20 | * along with this program; if not, write to the Free Software | |
21 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
22 | * | |
23 | * For the avoidance of doubt, and except that if any non-GPL license | |
24 | * choice is available it will apply instead, Sun elects to use only | |
25 | * the General Public License version 2 (GPLv2) at this time for any | |
26 | * software where a choice of GPL license versions is made | |
27 | * available with the language indicating that GPLv2 or any later version | |
28 | * may be used, or where a choice of which version of the GPL is applied is | |
29 | * otherwise unspecified. | |
30 | * | |
31 | * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, | |
32 | * CA 95054 USA or visit www.sun.com if you need additional information or | |
33 | * have any questions. | |
34 | * | |
35 | * | |
36 | * ========== Copyright Header End ============================================ | |
37 | */ | |
38 | #ifndef _B_ARY_H_ | |
39 | #define _B_ARY_H_ | |
40 | #define B_TREE_ORDER 2 | |
41 | #define B_TREE_MAX 2*B_TREE_ORDER | |
42 | #define KeyType unsigned long long | |
43 | #define ATOM_DATA_SIZE 64 //hold 64 bytes | |
44 | #include <stdio.h> | |
45 | #include "/import/vcs-release/vcs7.1R13/include/vcsuser.h" | |
46 | #include "/import/vcs-release/vcs7.1R13/include/acc_user.h" | |
47 | //declare B-tree atom | |
48 | typedef struct b_tree_atom{ | |
49 | unsigned long long key; | |
50 | int size; | |
51 | //data type | |
52 | char data[ATOM_DATA_SIZE+1]; | |
53 | }*b_tree_atom_ptr; | |
54 | ||
55 | //delare B-tree node | |
56 | typedef struct b_tree_node{ | |
57 | int size; | |
58 | struct b_tree_atom* data [B_TREE_MAX+1]; | |
59 | struct b_tree_node* child[B_TREE_MAX+2]; | |
60 | struct b_tree_node* parent; | |
61 | } *b_tree_node_ptr; | |
62 | ||
63 | //define protype of b-tree. | |
64 | b_tree_node_ptr b_create(); | |
65 | void b_copy(b_tree_node_ptr p, int pLo, int pHi, | |
66 | b_tree_node_ptr q, int qLo, int qHi); | |
67 | int b_scanNode(b_tree_node_ptr node, | |
68 | KeyType key, | |
69 | int* low); | |
70 | ||
71 | void b_addData(b_tree_atom_ptr atom, | |
72 | int index, | |
73 | b_tree_node_ptr* node, | |
74 | b_tree_node_ptr* rp, | |
75 | b_tree_atom_ptr* promoted); | |
76 | void b_recursiveInsert(b_tree_node_ptr* node, | |
77 | b_tree_atom_ptr* promoted, | |
78 | b_tree_node_ptr* rp, | |
79 | b_tree_atom_ptr* atom); | |
80 | void b_insert(b_tree_node_ptr* root, | |
81 | b_tree_atom_ptr* atom); | |
82 | b_tree_atom_ptr b_Find(b_tree_node_ptr* p, | |
83 | KeyType* key); | |
84 | int b_update(b_tree_atom_ptr* atom, | |
85 | b_tree_node_ptr* p); | |
86 | int b_rmFind(b_tree_node_ptr* p, | |
87 | b_tree_node_ptr* parent, | |
88 | b_tree_atom_ptr* atom); | |
89 | int b_delete(b_tree_node_ptr* root, | |
90 | KeyType key); | |
91 | void b_destory(b_tree_node_ptr* root); | |
92 | ||
93 | #endif |