Lines Matching defs:head
899 struct Head { ... }
904 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) };
908 struct Head* head = (struct Head*)(chunks[0]);
1474 chunks into bigger chunks fast. The head fields also hold bits
1479 the high 31 bits of the head field of its header through the
1588 PINUSE_BIT in their head fields. Because they are allocated
1599 size_t head; /* Size and inuse bits. */
1649 /* ------------------ Operations on head and foot fields ----------------- */
1652 The head field of a chunk is or'ed with PINUSE_BIT when previous
1663 /* Head value for fenceposts */
1666 /* extraction of fields from head words */
1667 #define cinuse(p) ((p)->head & CINUSE_BIT)
1668 #define pinuse(p) ((p)->head & PINUSE_BIT)
1669 #define chunksize(p) ((p)->head & ~(INUSE_BITS))
1671 #define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT)
1672 #define clear_cinuse(p) ((p)->head &= ~CINUSE_BIT)
1679 #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~INUSE_BITS)))
1683 #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT)
1691 ((p)->head = (s|PINUSE_BIT), set_foot(p, s))
1698 (!((p)->head & PINUSE_BIT) && ((p)->prev_foot & IS_MMAPPED_BIT))
1723 `head:' | Size of chunk, in bytes |P|
1744 `head:' | Size of chunk, in bytes |P|
1805 size_t head;
2411 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
2412 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
2416 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2417 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
2421 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT))
2434 ((p)->head = (((p)->head
2435 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \
2439 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2440 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\
2444 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2555 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
2564 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
2579 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
2583 assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD);
2584 assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0);
2600 size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT);
2625 size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT);
2637 tchunkptr head = 0;
2661 assert(head == 0); /* only one node on chain has parent */
2662 head = u;
2683 assert(head != 0);
2715 if (q->head != FENCEPOST_HEAD)
2768 q != m->top && q->head != FENCEPOST_HEAD) {
2833 q != m->top && q->head != FENCEPOST_HEAD) {
2875 q != m->top && q->head != FENCEPOST_HEAD) {
3162 (p)->head = (psize|CINUSE_BIT);
3164 chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD;
3165 chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0;
3198 newp->head = (psize|CINUSE_BIT);
3200 chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD;
3201 chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0;
3225 p->head = psize | PINUSE_BIT;
3227 chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE;
3278 q->head = tsize | PINUSE_BIT;
3335 p->head = FENCEPOST_HEAD;
3337 if ((char*)(&(nextp->head)) < old_end)
3538 r->head = rsize | PINUSE_BIT;
3807 newtop->head = newtopsize |PINUSE_BIT;
3890 newp->head = (newsize|CINUSE_BIT);
4175 r->head = rsize | PINUSE_BIT;
4233 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4249 p->head = tsize | PINUSE_BIT;
4413 msp->head = (msize|PINUSE_BIT|CINUSE_BIT);
4582 r->head = rsize | PINUSE_BIT;
4634 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4650 p->head = tsize | PINUSE_BIT;
