Lines Matching refs:htab
275 @c hcreate_r dup @mtsrace:htab @ascuheap @acucorrupt @acsmem
306 @c hdestroy_r dup @mtsrace:htab @ascuheap @acucorrupt @acsmem
355 @c hsearch_r dup @mtsrace:htab @acucorrupt/action==ENTER
383 @deftypefun int hcreate_r (size_t @var{nel}, struct hsearch_data *@var{htab})
385 @safety{@prelim{}@mtsafe{@mtsrace{:htab}}@asunsafe{@ascuheap{}}@acunsafe{@acucorrupt{} @acsmem{}}}
386 @c Unlike the lsearch array, the htab is (at least in part) opaque, so
390 @c Cancellation is unlikely to leave the htab in a corrupt state: the
400 @c hcreate_r @mtsrace:htab @ascuheap @acucorrupt @acsmem
404 @var{htab} to contain a hashing table with at least @var{nel} elements.
418 @deftypefun void hdestroy_r (struct hsearch_data *@var{htab})
420 @safety{@prelim{}@mtsafe{@mtsrace{:htab}}@asunsafe{@ascuheap{}}@acunsafe{@acucorrupt{} @acsmem{}}}
428 @c hdestroy_r @mtsrace:htab @ascuheap @acucorrupt @acsmem
431 @code{hcreate_r} function for this very same object @var{htab}. As for
436 …ch_r (ENTRY @var{item}, ACTION @var{action}, ENTRY **@var{retval}, struct hsearch_data *@var{htab})
438 @safety{@prelim{}@mtsafe{@mtsrace{:htab}}@assafe{}@acunsafe{@acucorrupt{/action==ENTER}}}
442 @c hsearch_r @mtsrace:htab @acucorrupt/action==ENTER
448 table described by the object pointed to by @var{htab} (which is