Lines Matching full:head
943 struct Head { ... }
948 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) };
952 struct Head* head = (struct Head*)(chunks[0]);
1520 chunks into bigger chunks fast. The head fields also hold bits
1525 the high 31 bits of the head field of its header through the
1634 PINUSE_BIT in their head fields. Because they are allocated
1645 size_t head; /* Size and inuse bits. */
1695 /* ------------------ Operations on head and foot fields ----------------- */
1698 The head field of a chunk is or'ed with PINUSE_BIT when previous
1709 /* Head value for fenceposts */
1712 /* extraction of fields from head words */
1713 #define cinuse(p) ((p)->head & CINUSE_BIT)
1714 #define pinuse(p) ((p)->head & PINUSE_BIT)
1715 #define chunksize(p) ((p)->head & ~(INUSE_BITS))
1717 #define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT)
1718 #define clear_cinuse(p) ((p)->head &= ~CINUSE_BIT)
1725 #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~INUSE_BITS)))
1729 #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT)
1737 ((p)->head = (s|PINUSE_BIT), set_foot(p, s))
1744 (!((p)->head & PINUSE_BIT) && ((p)->prev_foot & IS_MMAPPED_BIT))
1769 `head:' | Size of chunk, in bytes |P|
1790 `head:' | Size of chunk, in bytes |P|
1851 size_t head;
2421 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
2422 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
2426 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2427 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
2431 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT))
2444 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
2445 head |= PINUSE_BIT), \
2449 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2450 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\
2454 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2565 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
2574 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
2589 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
2593 assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD);
2594 assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0);
2610 size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT);
2635 size_t sz = p->head & ~(PINUSE_BIT|CINUSE_BIT);
2647 tchunkptr head = 0;
2671 assert(head == 0); /* only one node on chain has parent */
2672 head = u;
2693 assert(head != 0);
2725 if (q->head != FENCEPOST_HEAD)
2778 q != m->top && q->head != FENCEPOST_HEAD) {
2843 q != m->top && q->head != FENCEPOST_HEAD) {
2885 q != m->top && q->head != FENCEPOST_HEAD) {
3174 (p)->head = (psize|CINUSE_BIT);
3176 chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD;
3177 chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0;
3210 newp->head = (psize|CINUSE_BIT);
3212 chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD;
3213 chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0;
3237 p->head = psize | PINUSE_BIT;
3239 chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE;
3290 q->head = tsize | PINUSE_BIT;
3347 p->head = FENCEPOST_HEAD;
3349 if ((char*)(&(nextp->head)) < old_end)
3548 r->head = rsize | PINUSE_BIT;
3817 newtop->head = newtopsize |PINUSE_BIT;
3900 newp->head = (newsize|CINUSE_BIT);
4185 r->head = rsize | PINUSE_BIT;
4243 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4259 p->head = tsize | PINUSE_BIT;
4423 msp->head = (msize|PINUSE_BIT|CINUSE_BIT);
4592 r->head = rsize | PINUSE_BIT;
4644 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4660 p->head = tsize | PINUSE_BIT;
