123456789101112131415161718192021222324252627282930313233 |
- /* s2 - perfect hash table lookups
- Copyright (C) 2019 Ariadne Devos
- This program is free software: you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation, either version 3 of the License, or
- (at your option) any later version.
- This program 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 General Public License for more details.
- You should have received a copy of the GNU General Public License
- along with this program. If not, see <http://www.gnu.org/licenses/>. */
- #include <stddef.h>
- #include <stdint.h>
- #include <sHT/phash.h>
- #include <sHT/nospec.h>
- #include <sHT/string.h>
- size_t
- sHT_perfect_lookup(const struct sHT_perfect_table *table, const uint8_t string[], size_t length, size_t hash)
- {
- const struct sHT_perfect_entry *e;
- hash = sHT_index_nospec(hash, table->values_length);
- e = &table->values[hash];
- /* try to do a tail call */
- return sHT_streq(table->string_pool + e->name, string, e->value, 0, e->length, length);
- }
|