Lines Matching defs:head
1159 struct Head { ... }
1164 size_t sizes[3] = { sizeof(struct Head), msglen, sizeof(struct Foot) };
1168 struct Head* head = (struct Head*)(chunks[0]);
2061 chunks into bigger chunks fast. The head fields also hold bits
2066 the high 31 bits of the head
2175 cleared in their head fields. Because they are allocated
2186 size_t head; /* Size and inuse bits. */
2236 /* ------------------ Operations on head and foot fields ----------------- */
2239 The head field of a chunk is or'ed with PINUSE_BIT when previous
2252 /* Head value for fenceposts */
2255 /* extraction of fields from head words */
2256 #define cinuse(p) ((p)->head & CINUSE_BIT)
2257 #define pinuse(p) ((p)->head & PINUSE_BIT)
2258 #define flag4inuse(p) ((p)->head & FLAG4_BIT)
2259 #define is_inuse(p) (((p)->head & INUSE_BITS) != PINUSE_BIT)
2260 #define is_mmapped(p) (((p)->head & INUSE_BITS) == 0)
2262 #define chunksize(p) ((p)->head & ~(FLAG_BITS))
2264 #define clear_pinuse(p) ((p)->head &= ~PINUSE_BIT)
2265 #define set_flag4(p) ((p)->head |= FLAG4_BIT)
2266 #define clear_flag4(p) ((p)->head &= ~FLAG4_BIT)
2273 #define next_chunk(p) ((mchunkptr)( ((char*)(p)) + ((p)->head & ~FLAG_BITS)))
2277 #define next_pinuse(p) ((next_chunk(p)->head) & PINUSE_BIT)
2285 ((p)->head = (s|PINUSE_BIT), set_foot(p, s))
2314 `head:' | Size of chunk, in bytes |P|
2335 `head:' | Size of chunk, in bytes |P|
2396 size_t head;
3050 /* Macros for setting head/foot of non-mmapped chunks */
3054 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
3055 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
3059 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
3060 ((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT)
3064 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT))
3077 ((p)->head = (((p)->head & PINUSE_BIT)|s|CINUSE_BIT),\
3078 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT), \
3082 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
3083 (((mchunkptr)(((char*)(p)) + (s)))->head |= PINUSE_BIT),\
3087 ((p)->head = (s|PINUSE_BIT|CINUSE_BIT),\
3234 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
3241 size_t sz = p->head & ~INUSE_BITS; /* third-lowest bit can be set! */
3243 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
3258 assert((is_aligned(chunk2mem(p))) || (p->head == FENCEPOST_HEAD));
3262 assert(chunk_plus_offset(p, sz)->head == FENCEPOST_HEAD);
3263 assert(chunk_plus_offset(p, sz+SIZE_T_SIZE)->head == 0);
3304 size_t sz = p->head & ~INUSE_BITS;
3316 tchunkptr head = 0;
3340 assert(head == 0); /* only one node on chain has parent */
3341 head = u;
3362 assert(head != 0);
3394 if (q->head != FENCEPOST_HEAD)
3447 q != m->top && q->head != FENCEPOST_HEAD) {
3514 q != m->top && q->head != FENCEPOST_HEAD) {
3558 q != m->top && q->head != FENCEPOST_HEAD) {
3854 p->head = psize;
3856 chunk_plus_offset(p, psize)->head = FENCEPOST_HEAD;
3857 chunk_plus_offset(p, psize+SIZE_T_SIZE)->head = 0;
3890 newp->head = psize;
3892 chunk_plus_offset(newp, psize)->head = FENCEPOST_HEAD;
3893 chunk_plus_offset(newp, psize+SIZE_T_SIZE)->head = 0;
3918 p->head = psize | PINUSE_BIT;
3920 chunk_plus_offset(p, psize)->head = TOP_FOOT_SIZE;
3971 q->head = tsize | PINUSE_BIT;
4027 p->head = FENCEPOST_HEAD;
4029 if ((char*)(&(nextp->head)) < old_end)
4255 r->head = rsize | PINUSE_BIT;
4403 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4419 p->head = tsize | PINUSE_BIT;
4684 r->head = rsize | PINUSE_BIT;
4743 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
4759 p->head = tsize | PINUSE_BIT;
4859 newtop->head = newtopsize |PINUSE_BIT;
4954 newp->head = newsize;
5174 while (segment_holds(s, q) && q->head != FENCEPOST_HEAD) {
5430 msp->head = (msize|INUSE_BITS);
5620 r->head = rsize | PINUSE_BIT;
5672 else if ((next->head & INUSE_BITS) == INUSE_BITS) {
5688 p->head = tsize | PINUSE_BIT;
