HomeSort by: relevance | last modified time | path
    Searched refs:frag_next (Results 1 - 4 of 4) sorted by relevancy

  /src/sys/ufs/chfs/
chfs_readinode.c 586 frag_next(newfrag) may be a fragment which is overlapped by it
588 while ((this = frag_next(fragtree, newfrag)) && newfrag->ofs + newfrag->size >= this->ofs + this->size) {
624 next = frag_next(fragtree, this);
646 next = frag_next(fragtree, this);
670 frag = frag_next(fragtree, frag);
675 struct chfs_node_frag *next = frag_next(fragtree, frag);
769 struct chfs_node_frag *next = frag_next(&ip->fragtree, newfrag);
chfs.h 264 #define frag_next(tree, frag) (struct chfs_node_frag *)rb_tree_iterate(tree, frag, RB_DIR_RIGHT) macro
chfs_gc.c 879 frag; frag = frag_next(&ip->fragtree, frag)) {
  /src/sys/dist/pf/net/
pf_norm.c 94 TAILQ_ENTRY(pf_fragment) frag_next;
329 TAILQ_REMOVE(&pf_fragqueue, frag, frag_next);
330 TAILQ_INSERT_HEAD(&pf_fragqueue, frag, frag_next);
332 TAILQ_REMOVE(&pf_cachequeue, frag, frag_next);
333 TAILQ_INSERT_HEAD(&pf_cachequeue, frag, frag_next);
347 TAILQ_REMOVE(&pf_fragqueue, frag, frag_next);
351 TAILQ_REMOVE(&pf_cachequeue, frag, frag_next);
396 TAILQ_INSERT_HEAD(&pf_fragqueue, *frag, frag_next);
605 TAILQ_INSERT_HEAD(&pf_cachequeue, *frag, frag_next);

Completed in 121 milliseconds