Lines Matching defs:PL_DHashTableOperate
50 #define PL_DHashTableOperate VBoxNsplPL_DHashTableOperate
122 * maintained automatically by PL_DHashTableOperate -- users should never set
131 * returned by PL_DHashTableOperate, as PL_DHashTableOperate never returns a
133 * more details on PL_DHashTableOperate's calling rules.
323 * PL_DHashTableOperate's PL_DHASH_ADD case finds no existing entry for the
350 * entry storage: On successful PL_DHashTableOperate(tbl, key, PL_DHASH_ADD),
506 * entry = PL_DHashTableOperate(table, key, PL_DHASH_LOOKUP);
513 * entry = PL_DHashTableOperate(table, key, PL_DHASH_ADD);
527 * (void) PL_DHashTableOperate(table, key, PL_DHASH_REMOVE);
534 PL_DHashTableOperate(PLDHashTable *table, const void *key, PLDHashOperator op);
540 * the inefficiency of a full PL_DHashTableOperate (which rehashes in order
567 * If etor calls PL_DHashTableOperate on table with op != PL_DHASH_LOOKUP, it
577 * to PL_DHashTableOperate, or to an "unstable" form of Enumerate, which might