1 /*****************************************************************************
2 * FullFAT - High Performance, Thread-Safe Embedded FAT File-System *
3 * Copyright (C) 2009 James Walmsley (james@worm.me.uk) *
5 * This program is free software: you can redistribute it and/or modify *
6 * it under the terms of the GNU General Public License as published by *
7 * the Free Software Foundation, either version 3 of the License, or *
8 * (at your option) any later version. *
10 * This program is distributed in the hope that it will be useful, *
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of *
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *
13 * GNU General Public License for more details. *
15 * You should have received a copy of the GNU General Public License *
16 * along with this program. If not, see <http://www.gnu.org/licenses/>. *
20 * Alternative Licensing is available directly from the Copyright holder, *
21 * (James Walmsley). For more information consult LICENSING.TXT to obtain *
22 * a Commercial license. *
24 * See RESTRICTIONS.TXT for extra restrictions on the use of FullFAT. *
26 * Removing the above notice is illegal and will invalidate this license. *
27 *****************************************************************************
28 * See http://worm.me.uk/fullfat for more information. *
29 * Or http://fullfat.googlecode.com/ for latest releases and the wiki. *
30 *****************************************************************************/
34 * @author James Walmsley
37 * @defgroup HASH HASH Table
38 * @brief Provides a simple HASH lookup table.
47 struct _FF_HASH_TABLE
{
48 FF_T_UINT8 bitTable
[FF_HASH_TABLE_SIZE
];
55 FF_HASH_TABLE
FF_CreateHashTable() {
56 FF_HASH_TABLE pHash
= (FF_HASH_TABLE
) FF_MALLOC(sizeof(struct _FF_HASH_TABLE
));
59 FF_ClearHashTable(pHash
);
66 FF_ERROR
FF_ClearHashTable(FF_HASH_TABLE pHash
) {
68 memset(pHash
->bitTable
, 0, FF_HASH_TABLE_SIZE
);
72 return FF_ERR_NULL_POINTER
;
75 FF_ERROR
FF_SetHash(FF_HASH_TABLE pHash
, FF_T_UINT32 nHash
) {
76 FF_T_UINT32 tblIndex
= ((nHash
/ 8) % FF_HASH_TABLE_SIZE
);
77 FF_T_UINT32 tblBit
= nHash
% 8;
80 pHash
->bitTable
[tblIndex
] |= (0x80 >> tblBit
);
84 return FF_ERR_NULL_POINTER
;
87 FF_ERROR
FF_ClearHash(FF_HASH_TABLE pHash
, FF_T_UINT32 nHash
) {
88 FF_T_UINT32 tblIndex
= ((nHash
/ 8) % FF_HASH_TABLE_SIZE
);
89 FF_T_UINT32 tblBit
= nHash
% 8;
92 pHash
->bitTable
[tblIndex
] &= ~(0x80 >> tblBit
);
96 return FF_ERR_NULL_POINTER
;
99 FF_T_BOOL
FF_isHashSet(FF_HASH_TABLE pHash
, FF_T_UINT32 nHash
) {
100 FF_T_UINT32 tblIndex
= ((nHash
/ 8) % FF_HASH_TABLE_SIZE
);
101 FF_T_UINT32 tblBit
= nHash
% 8;
104 if(pHash
->bitTable
[tblIndex
] & (0x80 >> tblBit
)) {
111 FF_ERROR
FF_DestroyHashTable(FF_HASH_TABLE pHash
) {
116 return FF_ERR_NULL_POINTER
;