Home | History | Annotate | Download | only in netinet

Lines Matching defs:fat

41  * One such ad-hoc technique is fat pointers.  Additional degrees of
45  * The 'fat pointer' approach aggregates, for x86_32, 15 linked-list
47  * cache line are used for linking fat pointers, and for
55  * All the fat pointers are from a contiguous allocation arena.  Thus,
62  * In order to add a data element to a fat pointer, a key value is
97  * search time, and use fat pointers to reduce the cache impacts of
106  * expiration.  It will be added to a hash bucket implemented with fat
109  * will be added to this.  As more entries are added, the fat pointer
110  * cache line will fill, requiring additional cache lines for fat
113  * expire, the corresponding slot in the fat pointer will be
150  * fat pointers, MI.
171  * 15 tags per cacheline.  At most 2^17 fat pointers per fatp_ctl_t.
177 	fatp_word_t	nxt	: FATP_NXT_WIDTH;/* at most 2^17 fat pointers */
249 	fatp_ctl_t	*fat;		/* collection of fatp to use	*/
268 /*!\brief Collections of fat pointers.
305 fatp_next(fatp_ctl_t *fat, fatp_t *fp)
307 	return fp->nxt ? fat->base + fp->nxt-1 : 0;
310 /*!\brief determine a collection-relative fat pointer index.
313 fatp_index(fatp_ctl_t *fat, fatp_t *fp)
315 	return fp ? 1 + (fp - fat->base) : 0;