summaryrefslogtreecommitdiffstats
path: root/src/mesa/program/hash_table.h
diff options
context:
space:
mode:
Diffstat (limited to 'src/mesa/program/hash_table.h')
-rw-r--r--src/mesa/program/hash_table.h327
1 files changed, 0 insertions, 327 deletions
diff --git a/src/mesa/program/hash_table.h b/src/mesa/program/hash_table.h
deleted file mode 100644
index d75781869a3..00000000000
--- a/src/mesa/program/hash_table.h
+++ /dev/null
@@ -1,327 +0,0 @@
-/*
- * Copyright © 2008 Intel Corporation
- *
- * Permission is hereby granted, free of charge, to any person obtaining a
- * copy of this software and associated documentation files (the "Software"),
- * to deal in the Software without restriction, including without limitation
- * the rights to use, copy, modify, merge, publish, distribute, sublicense,
- * and/or sell copies of the Software, and to permit persons to whom the
- * Software is furnished to do so, subject to the following conditions:
- *
- * The above copyright notice and this permission notice (including the next
- * paragraph) shall be included in all copies or substantial portions of the
- * Software.
- *
- * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
- * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
- * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
- * THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
- * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
- * FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
- * DEALINGS IN THE SOFTWARE.
- */
-
-/**
- * \file hash_table.h
- * \brief Implementation of a generic, opaque hash table data type.
- *
- * \author Ian Romanick <[email protected]>
- */
-
-#ifndef HASH_TABLE_H
-#define HASH_TABLE_H
-
-#include <string.h>
-#include <stdbool.h>
-#include <stdlib.h>
-#include <stdint.h>
-#include <limits.h>
-#include <assert.h>
-#include "util/hash_table.h"
-
-struct string_to_uint_map;
-
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-typedef unsigned (*hash_func_t)(const void *key);
-typedef bool (*hash_compare_func_t)(const void *key1, const void *key2);
-
-/**
- * Hash table constructor
- *
- * Creates a hash table with the specified number of buckets. The supplied
- * \c hash and \c compare routines are used when adding elements to the table
- * and when searching for elements in the table.
- *
- * \param num_buckets Number of buckets (bins) in the hash table.
- * \param hash Function used to compute hash value of input keys.
- * \param compare Function used to compare keys.
- */
-static inline struct hash_table *hash_table_ctor(UNUSED unsigned num_buckets,
- hash_func_t hash, hash_compare_func_t compare)
-{
- return _mesa_hash_table_create(NULL, hash, compare);
-}
-
-/**
- * Release all memory associated with a hash table
- *
- * \warning
- * This function does not release memory occupied either by keys or data.
- */
-static inline void hash_table_dtor(struct hash_table *ht)
-{
- return _mesa_hash_table_destroy(ht, NULL);
-}
-
-/**
- * Flush all entries from a hash table
- *
- * \param ht Table to be cleared of its entries.
- */
-static inline void hash_table_clear(struct hash_table *ht)
-{
- return _mesa_hash_table_clear(ht, NULL);
-}
-
-/**
- * Search a hash table for a specific element
- *
- * \param ht Table to be searched
- * \param key Key of the desired element
- *
- * \return
- * The \c data value supplied to \c hash_table_insert when the element with
- * the matching key was added. If no matching key exists in the table,
- * \c NULL is returned.
- */
-static inline void *hash_table_find(struct hash_table *ht, const void *key)
-{
- struct hash_entry *entry = _mesa_hash_table_search(ht, key);
- if (!entry)
- return NULL;
- return entry->data;
-}
-
-/**
- * Add an element to a hash table
- *
- * \warning
- * The value passed by \c key is kept in the hash table and is used by later
- * calls to \c hash_table_find.
- */
-static inline void hash_table_insert(struct hash_table *ht, void *data,
- const void *key)
-{
- _mesa_hash_table_insert(ht, key, data);
-}
-
-/**
- * Remove a specific element from a hash table.
- */
-static inline void hash_table_remove(struct hash_table *ht, const void *key)
-{
- struct hash_entry *entry = _mesa_hash_table_search(ht, key);
-
- if (entry)
- _mesa_hash_table_remove(ht, entry);
-}
-
-/**
- * Compute hash value of a string
- *
- * \param key Pointer to a NUL terminated string to be hashed.
- *
- * \sa hash_table_string_compare
- */
-static unsigned
-hash_table_string_hash(const void *key)
-{
- const char *str = (const char *) key;
- uint32_t hash = _mesa_hash_string(str);
- return hash;
-}
-
-/**
- * Compare two strings used as keys
- *
- * This is just a wrapper around \c strcmp.
- *
- * \sa hash_table_string_hash
- */
-static bool
-hash_table_string_compare(const void *a, const void *b)
-{
- return _mesa_key_string_equal(a, b);
-}
-
-/**
- * Compute hash value of a pointer
- *
- * \param key Pointer to be used as a hash key
- *
- * \note
- * The memory pointed to by \c key is \b never accessed. The value of \c key
- * itself is used as the hash key
- *
- * \sa hash_table_pointer_compare
- */
-static unsigned
-hash_table_pointer_hash(const void *key)
-{
- return _mesa_hash_pointer(key);
-}
-
-/**
- * Compare two pointers used as keys
- *
- * \sa hash_table_pointer_hash
- */
-static bool
-hash_table_pointer_compare(const void *key1, const void *key2)
-{
- return _mesa_key_pointer_equal(key1, key2);
-}
-
-struct string_to_uint_map *
-string_to_uint_map_ctor();
-
-void
-string_to_uint_map_dtor(struct string_to_uint_map *);
-
-
-#ifdef __cplusplus
-}
-
-struct string_map_iterate_wrapper_closure {
- void (*callback)(const char *key, unsigned value, void *closure);
- void *closure;
-};
-
-/**
- * Map from a string (name) to an unsigned integer value
- *
- * \note
- * Because of the way this class interacts with the \c hash_table
- * implementation, values of \c UINT_MAX cannot be stored in the map.
- */
-struct string_to_uint_map {
-public:
- string_to_uint_map()
- {
- this->ht = _mesa_hash_table_create(NULL, _mesa_key_hash_string,
- _mesa_key_string_equal);
- }
-
- ~string_to_uint_map()
- {
- hash_table_call_foreach(this->ht, delete_key, NULL);
- _mesa_hash_table_destroy(this->ht, NULL);
- }
-
- /**
- * Remove all mappings from this map.
- */
- void clear()
- {
- hash_table_call_foreach(this->ht, delete_key, NULL);
- _mesa_hash_table_clear(this->ht, NULL);
- }
-
- /**
- * Runs a passed callback for the hash
- */
- void iterate(void (*func)(const char *, unsigned, void *), void *closure)
- {
- struct string_map_iterate_wrapper_closure *wrapper;
-
- wrapper = (struct string_map_iterate_wrapper_closure *)
- malloc(sizeof(struct string_map_iterate_wrapper_closure));
- if (wrapper == NULL)
- return;
-
- wrapper->callback = func;
- wrapper->closure = closure;
-
- hash_table_call_foreach(this->ht, subtract_one_wrapper, wrapper);
- free(wrapper);
- }
-
- /**
- * Get the value associated with a particular key
- *
- * \return
- * If \c key is found in the map, \c true is returned. Otherwise \c false
- * is returned.
- *
- * \note
- * If \c key is not found in the table, \c value is not modified.
- */
- bool get(unsigned &value, const char *key)
- {
- hash_entry *entry = _mesa_hash_table_search(this->ht,
- (const void *) key);
-
- if (!entry)
- return false;
-
- const intptr_t v = (intptr_t) entry->data;
- value = (unsigned)(v - 1);
- return true;
- }
-
- void put(unsigned value, const char *key)
- {
- /* The low-level hash table structure returns NULL if key is not in the
- * hash table. However, users of this map might want to store zero as a
- * valid value in the table. Bias the value by +1 so that a
- * user-specified zero is stored as 1. This enables ::get to tell the
- * difference between a user-specified zero (returned as 1 by
- * _mesa_hash_table_search) and the key not in the table (returned as 0 by
- * _mesa_hash_table_search).
- *
- * The net effect is that we can't store UINT_MAX in the table. This is
- * because UINT_MAX+1 = 0.
- */
- assert(value != UINT_MAX);
- char *dup_key = strdup(key);
-
- struct hash_entry *entry = _mesa_hash_table_search(this->ht, dup_key);
- if (entry) {
- entry->data = (void *) (intptr_t) (value + 1);
- } else {
- _mesa_hash_table_insert(this->ht, dup_key,
- (void *) (intptr_t) (value + 1));
- }
-
- if (entry)
- free(dup_key);
- }
-
-private:
- static void delete_key(const void *key, void *data, void *closure)
- {
- (void) data;
- (void) closure;
-
- free((char *)key);
- }
-
- static void subtract_one_wrapper(const void *key, void *data, void *closure)
- {
- struct string_map_iterate_wrapper_closure *wrapper =
- (struct string_map_iterate_wrapper_closure *) closure;
- unsigned value = (intptr_t) data;
-
- value -= 1;
-
- wrapper->callback((const char *) key, value, wrapper->closure);
- }
-
- struct hash_table *ht;
-};
-
-#endif /* __cplusplus */
-#endif /* HASH_TABLE_H */
generated by cgit v1.2.3 (git 2.39.1) at 2024-12-27 10:42:26 +0000