Lines Matching defs:node
62 } *node;
77 } *node;
190 if (pos<=offset && pos+s->node->len>offset) break;
191 pos += s->node->len;
196 if (pos+s->node->len>offset && pos!=offset) {
198 tail->len = s->node->len-(offset-pos);
199 tail->data = s->node->data+(offset-pos);
200 s->node->len = offset-pos;
238 if (spos<=offset && spos+s->node->len>offset) break;
239 spos += s->node->len;
246 if (epos<=end && epos+e->node->len>end) break;
247 epos += e->node->len;
254 if (spos == offset && ( end >= spos+s->node->len)) {
256 spos += s->node->len;
257 offset += s->node->len;
261 } else if (spos < offset && ( end >= spos+s->node->len)) {
263 size_t clip = s->node->len - (offset - spos);
264 offset = spos+s->node->len;
265 spos += s->node->len;
266 s->node->len -= clip;
270 s->node->len -= clip;
271 s->node->data += clip;
277 tail->len = s->node->len-(offset-spos)-clip;
278 tail->data = s->node->data+(offset-spos)+clip;
279 s->node->len = offset-spos; //wrong?
302 if (spos<=offset && spos+s->node->len>offset) break;
304 spos += s->node->len;
325 for (; i < s->node->len; i++, epos++)
326 if (s->node->data[i] == c) return epos;
347 if (s->node->data[i] == c) return epos;
349 i = s->node->len-1;
361 pos += s->node->len;
376 for (; i < s->node->len && spos+i<end; i++)
377 if (s->node->data[i] == c) count++;
380 spos += s->node->len;
395 return s->node->data[offset-spos];
467 for (; i < s->node->len && j; i++, j--, dest++)
468 *dest = s->node->data[i];
497 static void block_list_free(void *node)
499 struct block_list *d = node;
501 if (d->node->alloc == HEAP) free((void *)d->node->data);
502 else if (d->node->alloc == MMAP) munmap((void *)d->node->data, d->node->size);
504 free(d->node);
551 xwrite(fd, (void *)s->node->data, s->node->len );