Lines Matching defs:head
1021 struct Head { ... }
1026 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) };
1030 struct Head* head = (struct Head*)(chunks[0]);
1935 chunks into bigger chunks fast. The head fields also hold bits
1940 the high 31 bits of the head field of its header through the
2049 cleared in their head fields. Because they are allocated
2060 size_t head; /* Size and inuse bits. */
2110 /* ------------------ Operations on head and foot fields ----------------- */
2113 The head field of a chunk is or'ed with PINUSE_BIT when previous
2126 /* Head value for fenceposts */
2129 /* extraction of fields from head words */
2130 #define cinuse(p) ((p)->head & CINUSE_BIT)
2131 #define pinuse(p) ((p)->head & PINUSE_BIT)
2132 #define is_inuse(p) (((p)->head & INUSE_BITS) != PINUSE_BIT)
2133 #define is_mmapped(p) (((p)->head & INUSE_BITS) == 0)
2135 #define chunksize(p) ((p)->head & ~(FLAG_BITS))
2137 #define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT)
2144 #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~FLAG_BITS)))
2148 #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT)
2156 ((p)->head = (s|PINUSE_BIT), set_foot(p, s))
2185 `head:' | Size of chunk, in bytes |P|
2206 `head:' | Size of chunk, in bytes |P|
2267 size_t head;
2909 /* Macros for setting head/foot of non-mmapped chunks */
2913 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
2914 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
2918 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2919 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
2923 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT))
2936 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
2937 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \
2941 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
2942 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\
2946 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
3067 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
3074 size_t sz = p->head & ~INUSE_BITS; /* third-lowest bit can be set! */
3076 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
3091 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
3095 assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD);
3096 assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0);
3137 size_t sz = p->head & ~INUSE_BITS;
3149 tchunkptr head = 0;
3173 assert(head == 0); /* only one node on chain has parent */
3174 head = u;
3195 assert(head != 0);
3227 if (q->head != FENCEPOST_HEAD)
3280 q != m->top && q->head != FENCEPOST_HEAD) {
3346 q != m->top && q->head != FENCEPOST_HEAD) {
3389 q != m->top && q->head != FENCEPOST_HEAD) {
3676 p->head = psize;
3678 chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD;
3679 chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0;
3711 newp->head = psize;
3713 chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD;
3714 chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0;
3738 p->head = psize | PINUSE_BIT;
3740 chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE;
3791 q->head = tsize | PINUSE_BIT;
3847 p->head = FENCEPOST_HEAD;
3849 if ((char*)(&(nextp->head)) < old_end)
4059 r->head = rsize | PINUSE_BIT;
4334 newtop->head = newtopsize |PINUSE_BIT;
4421 newp->head = newsize;
4711 r->head = rsize | PINUSE_BIT;
4768 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4784 p->head = tsize | PINUSE_BIT;
4959 msp->head = (msize|INUSE_BITS);
5146 r->head = rsize | PINUSE_BIT;
5198 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
5214 p->head = tsize | PINUSE_BIT;
