Add references to tour of pintos.

diff --git a/src/lib/kernel/hash.c b/src/lib/kernel/hash.c
index 55e01c45c15847e85736b61770f60411d31e419e..57eed450c91cc5dbae214445d16b72f52d7a7c3c 100644 (file)
--- a/src/lib/kernel/hash.c
+++ b/src/lib/kernel/hash.c
@@ -1,3 +1,10 @@
+/* Hash table.
+
+   This data structure is thoroughly documented in the Tour of
+   Pintos for Project 3.
+
+   See hash.h for basic information. */
+
 #include "hash.h"
 #include "../debug.h"
 #include "threads/malloc.h"

diff --git a/src/lib/kernel/hash.h b/src/lib/kernel/hash.h
index 7f25c1025769327a88eeee4e202dffa20f28cedd..3f2e43cd595e31be32b524dd36d79204ab8990b4 100644 (file)
--- a/src/lib/kernel/hash.h
+++ b/src/lib/kernel/hash.h
@@ -3,6 +3,9 @@
 
 /* Hash table.
 
+   This data structure is thoroughly documented in the Tour of
+   Pintos for Project 3.
+
    This is a standard hash table with chaining.  To locate an
    element in the table, we compute a hash function over the
    element's data and use that as an index into an array of
@@ -15,10 +18,7 @@
    conversion from a struct hash_elem back to a structure object
    that contains it.  This is the same technique used in the
    linked list implementation.  Refer to lib/kernel/list.h for a
-   detailed explanation.
-
-   The FAQ for the VM project contains a detailed example of how
-   to use the hash table. */
+   detailed explanation. */
 
 #include <stdbool.h>
 #include <stddef.h>