Lines Matching refs:table
54 hash_table_t *table;
64 /* This results in removing entry from hash table and freeing the value. */
65 sss_ptr_hash_delete(spy->table, spy->key, false);
71 hash_table_t *table,
89 spy->table = table;
109 sss_ptr_hash_value_create(hash_table_t *table,
115 value = talloc_zero(table, struct sss_ptr_hash_value);
120 value->spy = sss_ptr_hash_spy_create(talloc_ptr, table, key, value);
170 hash_table_t *table;
181 ret = sss_hash_create_ex(mem_ctx, 10, &table, 0, 0, 0, 0,
184 DEBUG(SSSDBG_CRIT_FAILURE, "Unable to create hash table [%d]: %s\n",
190 talloc_steal(table, data);
192 return table;
195 errno_t _sss_ptr_hash_add(hash_table_t *table,
206 if (table == NULL || key == NULL) {
215 value = sss_ptr_hash_value_create(table, key, talloc_ptr);
226 if (override == false && hash_has_key(table, &table_key)) {
230 hret = hash_enter(table, &table_key, &table_value);
241 sss_ptr_hash_lookup_internal(hash_table_t *table,
251 hret = hash_lookup(table, &table_key, &table_value);
255 DEBUG(SSSDBG_CRIT_FAILURE, "Unable to search hash table [%d]\n", hret);
273 void *_sss_ptr_hash_lookup(hash_table_t *table,
279 value = sss_ptr_hash_lookup_internal(table, key);
291 void sss_ptr_hash_delete(hash_table_t *table,
300 if (table == NULL || key == NULL) {
304 value = sss_ptr_hash_lookup_internal(table, key);
315 /* Delete table entry. This will free value and spy in delete callback. */
316 hret = hash_delete(table, &table_key);
318 DEBUG(SSSDBG_CRIT_FAILURE, "Unable to remove key from table [%d]\n",
330 void sss_ptr_hash_delete_all(hash_table_t *table,
340 if (table == NULL) {
344 hret = hash_values(table, &count, &values);
354 /* This will remove the entry from hash table and free value. */
366 bool sss_ptr_hash_has_key(hash_table_t *table,
374 return hash_has_key(table, &table_key);