HomeSort by: relevance | last modified time | path
    Searched defs:uc_entries (Results 1 - 3 of 3) sorted by relevancy

  /src/lib/libc/rpc/
svc_dg.c 392 cache_ptr *uc_entries; /* hash table of entries in cache */ member in struct:cl_cache
440 uc->uc_entries = ALLOC(cache_ptr, size * SPARSENESS);
441 if (uc->uc_entries == NULL) {
447 MEMZERO(uc->uc_entries, cache_ptr, size * SPARSENESS);
451 FREE(uc->uc_entries, cache_ptr, size * SPARSENESS);
502 for (vicp = &uc->uc_entries[loc];
558 victim->cache_next = uc->uc_entries[loc];
559 uc->uc_entries[loc] = victim;
591 for (ent = uc->uc_entries[loc]; ent != NULL; ent = ent->cache_next) {
svc_dg.c 392 cache_ptr *uc_entries; /* hash table of entries in cache */ member in struct:cl_cache
440 uc->uc_entries = ALLOC(cache_ptr, size * SPARSENESS);
441 if (uc->uc_entries == NULL) {
447 MEMZERO(uc->uc_entries, cache_ptr, size * SPARSENESS);
451 FREE(uc->uc_entries, cache_ptr, size * SPARSENESS);
502 for (vicp = &uc->uc_entries[loc];
558 victim->cache_next = uc->uc_entries[loc];
559 uc->uc_entries[loc] = victim;
591 for (ent = uc->uc_entries[loc]; ent != NULL; ent = ent->cache_next) {
svc_dg.c 392 cache_ptr *uc_entries; /* hash table of entries in cache */ member in struct:cl_cache
440 uc->uc_entries = ALLOC(cache_ptr, size * SPARSENESS);
441 if (uc->uc_entries == NULL) {
447 MEMZERO(uc->uc_entries, cache_ptr, size * SPARSENESS);
451 FREE(uc->uc_entries, cache_ptr, size * SPARSENESS);
502 for (vicp = &uc->uc_entries[loc];
558 victim->cache_next = uc->uc_entries[loc];
559 uc->uc_entries[loc] = victim;
591 for (ent = uc->uc_entries[loc]; ent != NULL; ent = ent->cache_next) {

Completed in 33 milliseconds