/usr/include/OS/table.h is in ivtools-dev 1.2.11a1-11.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 | /*
* Copyright (c) 1987, 1988, 1989, 1990, 1991 Stanford University
* Copyright (c) 1991 Silicon Graphics, Inc.
*
* Permission to use, copy, modify, distribute, and sell this software and
* its documentation for any purpose is hereby granted without fee, provided
* that (i) the above copyright notices and this permission notice appear in
* all copies of the software and related documentation, and (ii) the names of
* Stanford and Silicon Graphics may not be used in any advertising or
* publicity relating to the software without the specific, prior written
* permission of Stanford and Silicon Graphics.
*
* THE SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND,
* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY
* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE.
*
* IN NO EVENT SHALL STANFORD OR SILICON GRAPHICS BE LIABLE FOR
* ANY SPECIAL, INCIDENTAL, INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND,
* OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS,
* WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF
* LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE
* OF THIS SOFTWARE.
*/
/*
* Generic object association table.
*/
#ifndef os_table_h
#define os_table_h
#include <OS/enter-scope.h>
#if defined(__STDC__) || defined(__ANSI_CPP__)
#define __TableEntry(Table) Table##_Entry
#define TableEntry(Table) __TableEntry(Table)
#define __TableIterator(Table) Table##_Iterator
#define TableIterator(Table) __TableIterator(Table)
#else
#define __TableEntry(Table) Table/**/_Entry
#define TableEntry(Table) __TableEntry(Table)
#define __TableIterator(Table) Table/**/_Iterator
#define TableIterator(Table) __TableIterator(Table)
#endif
#define declareTable(Table,Key,Value) \
struct TableEntry(Table); \
\
class Table { \
public: \
Table(int); \
~Table(); \
\
void insert(Key, Value); \
boolean find(Value&, Key); \
boolean find_and_remove(Value&, Key); \
void remove(Key); \
private: \
friend class TableIterator(Table); \
\
int size_; \
TableEntry(Table)** first_; \
TableEntry(Table)** last_; \
\
TableEntry(Table)*& probe(Key); \
}; \
\
struct TableEntry(Table) { \
private: \
friend class Table; \
friend class TableIterator(Table); \
\
Key key_; \
Value value_; \
TableEntry(Table)* chain_; \
}; \
\
class TableIterator(Table) { \
public: \
TableIterator(Table)(Table&); \
\
TableEntry(Table)* cur_entry(); \
Key& cur_key(); \
Value& cur_value(); \
boolean more(); \
boolean next(); \
private: \
TableEntry(Table)* cur_; \
TableEntry(Table)** entry_; \
TableEntry(Table)** last_; \
}; \
\
inline TableEntry(Table)* TableIterator(Table)::cur_entry() { return cur_; } \
inline Key& TableIterator(Table)::cur_key() { return cur_->key_; } \
inline Value& TableIterator(Table)::cur_value() { return cur_->value_; } \
inline boolean TableIterator(Table)::more() { return entry_ <= last_; }
/*
* Predefined hash functions
*/
#ifndef os_table2_h
inline unsigned long key_to_hash(long k) { return (unsigned long)k; }
inline unsigned long key_to_hash(const void* k) { return (unsigned long)k; }
#endif
/*
* Table implementation
*/
#define implementTable(Table,Key,Value) \
Table::Table(int n) { \
for (size_ = 32; size_ < n; size_ <<= 1); \
first_ = new TableEntry(Table)*[size_]; \
--size_; \
last_ = &first_[size_]; \
for (register TableEntry(Table)** e = first_; e <= last_; e++) { \
*e = nil; \
} \
} \
\
Table::~Table() { \
for (register TableEntry(Table)** e = first_; e <= last_; e++) { \
TableEntry(Table)* t = *e; \
delete t; \
} \
delete[] first_; \
} \
\
inline TableEntry(Table)*& Table::probe(Key i) { \
return first_[key_to_hash(i) & size_]; \
} \
\
void Table::insert(Key k, Value v) { \
register TableEntry(Table)* e = new TableEntry(Table); \
e->key_ = k; \
e->value_ = v; \
register TableEntry(Table)** a = &probe(k); \
e->chain_ = *a; \
*a = e; \
} \
\
boolean Table::find(Value& v, Key k) { \
for (register TableEntry(Table)* e = probe(k); e != nil; e = e->chain_) { \
if (e->key_ == k) { \
v = e->value_; \
return true; \
} \
} \
return false; \
} \
\
boolean Table::find_and_remove(Value& v, Key k) { \
TableEntry(Table)** a = &probe(k); \
register TableEntry(Table)* e = *a; \
if (e != nil) { \
if (e->key_ == k) { \
v = e->value_; \
*a = e->chain_; \
delete e; \
return true; \
} else { \
register TableEntry(Table)* prev; \
do { \
prev = e; \
e = e->chain_; \
} while (e != nil && e->key_ != k); \
if (e != nil) { \
v = e->value_; \
prev->chain_ = e->chain_; \
delete e; \
return true; \
} \
} \
} \
return false; \
} \
\
void Table::remove(Key k) { \
TableEntry(Table)** a = &probe(k); \
register TableEntry(Table)* e = *a; \
if (e != nil) { \
if (e->key_ == k) { \
*a = e->chain_; \
delete e; \
} else { \
register TableEntry(Table)* prev; \
do { \
prev = e; \
e = e->chain_; \
} while (e != nil && e->key_ != k); \
if (e != nil) { \
prev->chain_ = e->chain_; \
delete e; \
} \
} \
} \
} \
\
TableIterator(Table)::TableIterator(Table)(Table& t) { \
last_ = t.last_; \
for (entry_ = t.first_; entry_ <= last_; entry_++) { \
cur_ = *entry_; \
if (cur_ != nil) { \
break; \
} \
} \
} \
\
boolean TableIterator(Table)::next() { \
cur_ = cur_->chain_; \
if (cur_ != nil) { \
return true; \
} \
for (++entry_; entry_ <= last_; entry_++) { \
cur_ = *entry_; \
if (cur_ != nil) { \
return true; \
} \
} \
return false; \
}
#endif
|