summaryrefslogtreecommitdiff
path: root/src/gallium/auxiliary/cso_cache
diff options
context:
space:
mode:
authorZack Rusin <zack@tungstengraphics.com>2008-03-12 21:42:33 -0400
committerZack Rusin <zack@tungstengraphics.com>2008-03-12 21:49:06 -0400
commita1d56728655a3fc87360b45ac8b348bcfdf6ac15 (patch)
tree8261c03cf720f5f05ac9ca964e464f4d2327de86 /src/gallium/auxiliary/cso_cache
parent329c5431348117e5b99adf14936d2f57f2ef5f1f (diff)
document hash collision resolutions
Diffstat (limited to 'src/gallium/auxiliary/cso_cache')
-rw-r--r--src/gallium/auxiliary/cso_cache/cso_hash.h10
1 files changed, 10 insertions, 0 deletions
diff --git a/src/gallium/auxiliary/cso_cache/cso_hash.h b/src/gallium/auxiliary/cso_cache/cso_hash.h
index d5bca9d591..84b45a5963 100644
--- a/src/gallium/auxiliary/cso_cache/cso_hash.h
+++ b/src/gallium/auxiliary/cso_cache/cso_hash.h
@@ -25,6 +25,16 @@
*
**************************************************************************/
+/**
+ This file provides a hash implementation that is capable of dealing
+ with collisions. It stores colliding entries in linked list. All
+ functions operating on the hash return an iterator. The iterator
+ itself points to the collision list. If there wasn't any collision
+ the list will have just one entry, otherwise client code should
+ iterate over the entries to find the exact entry among ones that
+ had the same key (e.g. memcmp could be used on the data to check
+ that)
+*/
/*
* Authors:
* Zack Rusin <zack@tungstengraphics.com>