Lines Matching refs:entries
90 /* Both entries should have been visited exactly once. */
125 struct hashtable_test_entry entries[3];
130 /* Add three entries to the hashtable. */
132 entries[i].key = i;
133 entries[i].data = i + 10;
134 entries[i].visited = 0;
135 hash_add(hash, &entries[i].node, entries[i].key);
149 KUNIT_EXPECT_EQ(test, entries[j].visited, 1);
154 struct hashtable_test_entry entries[3];
160 /* Add three entries to the hashtable. */
162 entries[i].key = i;
163 entries[i].data = i + 10;
164 entries[i].visited = 0;
165 hash_add(hash, &entries[i].node, entries[i].key);
182 KUNIT_EXPECT_EQ(test, entries[j].visited, 1);
187 struct hashtable_test_entry entries[4];
193 /* Add three entries with key = 0 to the hashtable. */
195 entries[i].key = 0;
196 entries[i].data = i;
197 entries[i].visited = 0;
198 hash_add(hash, &entries[i].node, entries[i].key);
202 entries[3].key = 1;
203 entries[3].data = 3;
204 entries[3].visited = 0;
205 hash_add(hash, &entries[3].node, entries[3].key);
217 KUNIT_EXPECT_EQ(test, entries[j].visited, 1);
226 /* If entry with key = 1 is in the same bucket as the entries with
228 * entries were visited.
232 KUNIT_EXPECT_EQ(test, entries[3].visited, 1);
235 KUNIT_EXPECT_EQ(test, entries[3].visited, 0);
241 struct hashtable_test_entry entries[4];
248 /* Add three entries with key = 0 to the hashtable. */
250 entries[i].key = 0;
251 entries[i].data = i;
252 entries[i].visited = 0;
253 hash_add(hash, &entries[i].node, entries[i].key);
257 entries[3].key = 1;
258 entries[3].data = 3;
259 entries[3].visited = 0;
260 hash_add(hash, &entries[3].node, entries[3].key);
275 KUNIT_EXPECT_EQ(test, entries[j].visited, 1);
284 /* If entry with key = 1 is in the same bucket as the entries with
286 * entries were visited.
290 KUNIT_EXPECT_EQ(test, entries[3].visited, 1);
293 KUNIT_EXPECT_EQ(test, entries[3].visited, 0);