140     unsigned int l,llen;  in zipmapLookupRaw()  local
146         l = zipmapDecodeLength(p);  in zipmapLookupRaw()
147         llen = zipmapEncodeLength(NULL,l);  in zipmapLookupRaw()
148         if (key != NULL && k == NULL && l == klen && !memcmp(p+llen,key,l)) {  in zipmapLookupRaw()
157         p += llen+l;  in zipmapLookupRaw()
159         l = zipmapDecodeLength(p);  in zipmapLookupRaw()
160         p += zipmapEncodeLength(NULL,l);  in zipmapLookupRaw()
162         p += l+1+free; /* +1 to skip the free byte */  in zipmapLookupRaw()
169     unsigned int l;  in zipmapRequiredLength()  local
171     l = klen+vlen+3;  in zipmapRequiredLength()
172     if (klen >= ZIPMAP_BIGLEN) l += 4;  in zipmapRequiredLength()
173     if (vlen >= ZIPMAP_BIGLEN) l += 4;  in zipmapRequiredLength()
174     return l;  in zipmapRequiredLength()
179     unsigned int l = zipmapDecodeLength(p);  in zipmapRawKeyLength()  local
180     return zipmapEncodeLength(NULL,l) + l;  in zipmapRawKeyLength()
186     unsigned int l = zipmapDecodeLength(p);  in zipmapRawValueLength()  local
189     used = zipmapEncodeLength(NULL,l);  in zipmapRawValueLength()
190     used += p[used] + 1 + l;  in zipmapRawValueLength()
198     unsigned int l = zipmapRawKeyLength(p);  in zipmapRawEntryLength()  local
199     return l + zipmapRawValueLength(p+l);  in zipmapRawEntryLength()
375     unsigned int l;  in zipmapRepr()  local
385             l = zipmapDecodeLength(p);  in zipmapRepr()
386             printf("{key %u}",l);  in zipmapRepr()
387             p += zipmapEncodeLength(NULL,l);  in zipmapRepr()
388             if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite");  in zipmapRepr()
389             p += l;  in zipmapRepr()
391             l = zipmapDecodeLength(p);  in zipmapRepr()
392             printf("{value %u}",l);  in zipmapRepr()
393             p += zipmapEncodeLength(NULL,l);  in zipmapRepr()
395             if (l != 0 && fwrite(p,l,1,stdout) == 0) perror("fwrite");  in zipmapRepr()
396             p += l+e;  in zipmapRepr()