db/hash/hash_bigkey.c

70 #include "page.h"
94 	cp = bufp->page;		/* Character pointer of p. */
127 				 * next page; otherwise the invariant that the
128 				 * data must end on a page with FREESPACE
146 		p = (u_int16_t *)bufp->page;
147 		cp = bufp->page;
157 		 * same page as the key ends, FREESPACE is at least one.
175 			cp = bufp->page;
185  * Called when bufp's page  contains a partial key (index should be 1)
188  * free bufp because the page pointing to it is lost and we can't get rid
204 	bp = (u_int16_t *)bufp->page;
213 		 * If there is freespace left on a FULL_KEY_DATA page, then
214 		 * the data is short and fits entirely on this page, and this
215 		 * is the last page.
227 		bp = (u_int16_t *)rbufp->page;
231 	 * If we get here then rbufp points to the last page of the big
233 	 * empty pointing to the next page after this pair.  Can't free it
234 	 * because we don't have the page pointing to it.
237 	/* This is information from the last page of the pair. */
241 	/* Now, bp is the first page of the pair. */
242 	bp = (u_int16_t *)bufp->page;
244 		/* There is an overflow page. */
249 		/* This is the last page. */
268  * -1 = get next overflow page
281 	bp = (u_int16_t *)bufp->page;
282 	p = bufp->page;
296 		p = bufp->page;
311  * Given the buffer pointer of the first overflow page of a big pair,
314  * This will set bpp to the buffer header of the last page of the big pair.
315  * It will return the pageno of the overflow page following the last page
327 	bp = (u_int16_t *)bufp->page;
332 		 * This is the last page if: the tag is FULL_KEY_DATA and
334 		 * is freespace on the page.
344 		bp = (u_int16_t *)bufp->page;
355  * Return the data for the key/data pair that begins on this page at this
365 	bp = (u_int16_t *)bufp->page;
370 		bp = (u_int16_t *)bufp->page;
378 		bp = (u_int16_t *)bufp->page;
399 			bp = (u_int16_t *)bufp->page;
401 			/* The data is all on one page. */
419 					    hashp->cpage->page)[0]) {
436 	memmove(hashp->tmp_buf, (save_p->page) + off, len);
453 	p = bufp->page;
474 				else if (!((u_int16_t *)hashp->cpage->page)[0]) {
490 	memmove(&hashp->tmp_buf[len], (bufp->page) + bp[1], mylen);
519 	p = bufp->page;
542 	memmove(&hashp->tmp_key[len], (bufp->page) + bp[1], mylen);
554     BUFHEAD *np,	/* Pointer to new bucket page */
555     BUFHEAD *big_keyp,	/* Pointer to first page containing the big key/data */
595 	tp = (u_int16_t *)tmpp->page;
610 	 * pointer to the last page of the big key_data pair. Make sure that
611 	 * big_keyp has no following page (2 elements) or create an empty
612 	 * following page.
618 	tp = (u_int16_t *)big_keyp->page;
622 		 * There may be either one or two offsets on this page.  If
623 		 * there is one, then the overflow page is linked on normally
626 		 * next overflow page is added.