ck/src/ck_rhs.c

124 		struct ck_rhs_entry_desc *descs;
127 			struct ck_rhs_no_entry_desc *descs;
141 		return (map->entries.descs[offset].entry);
151 		return (&map->entries.descs[offset].entry);
159 		return ((struct ck_rhs_entry_desc *)(void *)&map->entries.no_entries.descs[offset]);
161 		return (&map->entries.descs[offset]);
169 		map->entries.no_entries.descs[offset].wanted++;
171 		map->entries.descs[offset].wanted++;
179 		return (map->entries.no_entries.descs[offset].probes);
181 		return (map->entries.descs[offset].probes);
189 		map->entries.no_entries.descs[offset].probes = value;
191 		map->entries.descs[offset].probes = value;
199 		return (map->entries.no_entries.descs[offset].probe_bound);
201 		return (map->entries.descs[offset].probe_bound);
209 		return (&map->entries.no_entries.descs[offset].probe_bound);
211 		return (&map->entries.descs[offset].probe_bound);
220 		return (map->entries.no_entries.descs[offset].in_rh);
222 		return (map->entries.descs[offset].in_rh);
230 		map->entries.no_entries.descs[offset].in_rh = true;
232 		map->entries.descs[offset].in_rh = true;
240 		map->entries.no_entries.descs[offset].in_rh = false;
242 		map->entries.descs[offset].in_rh = false;
378 		map->entries.no_entries.descs = (void *)(((uintptr_t)map->entries.no_entries.entries + (sizeof(void *) * n_entries) + CK_MD_CACHELINE - 1) &~ (CK_MD_CACHELINE - 1));
381 		memset(map->entries.no_entries.descs, 0,
387 		map->entries.descs = (void *)(((uintptr_t)&map[1] +
389 		memset(map->entries.descs, 0, sizeof(struct ck_rhs_entry_desc) * n_entries);
463 		desc = &m->entries.descs[offset];
486 		r = CK_RHS_LOAD(&m->entries.descs[offset].probe_bound);
637 			struct ck_rhs_entry_desc *desc = (void *)&map->entries.no_entries.descs[offset];
747 		k = ck_pr_load_ptr(&map->entries.descs[offset].entry);
751 			struct ck_rhs_entry_desc *desc = &map->entries.descs[offset];