Lines Matching +refs:Num +refs:ro
81 return newTableFile(storage.FileDesc{Type: storage.TypeTable, Num: r.num}, r.size, r.imin, r.imax)
96 x += fmt.Sprint(f.fd.Num)
108 return a.fd.Num < b.fd.Num
116 return tf[i].fd.Num > tf[j].fd.Num
230 func (tf tFiles) newIndexIterator(tops *tOps, icmp *iComparer, slice *util.Range, ro *opt.ReadOptio…
248 ro: ro,
258 ro *opt.ReadOptions member
267 return a.tops.newIterator(a.tFiles[i], a.slice, a.ro)
269 return a.tops.newIterator(a.tFiles[i], nil, a.ro)
303 fd := storage.FileDesc{Type: storage.TypeTable, Num: t.s.allocFileNum()}
348 ch = t.cache.Get(0, uint64(f.fd.Num), func() (size int, value cache.Value) {
357 bcache = &cache.NamespaceGetter{Cache: t.bcache, NS: uint64(f.fd.Num)}
377 func (t *tOps) find(f *tFile, key []byte, ro *opt.ReadOptions) (rkey, rvalue []byte, err error) {
383 return ch.Value().(*table.Reader).Find(key, true, ro)
387 func (t *tOps) findKey(f *tFile, key []byte, ro *opt.ReadOptions) (rkey []byte, err error) {
393 return ch.Value().(*table.Reader).FindKey(key, true, ro)
407 func (t *tOps) newIterator(f *tFile, slice *util.Range, ro *opt.ReadOptions) iterator.Iterator {
412 iter := ch.Value().(*table.Reader).NewIterator(slice, ro)
420 t.cache.Delete(0, uint64(f.fd.Num), func() {
422 t.s.logf("table@remove removing @%d %q", f.fd.Num, err)
424 t.s.logf("table@remove removed @%d", f.fd.Num)
427 t.bcache.EvictNS(uint64(f.fd.Num))
527 w.t.s.reuseFileNum(w.fd.Num)