Coverage Report

Created: 2025-10-10 07:03

next uncovered line (L), next uncovered region (R), next uncovered branch (B)
/src/leveldb/table/iterator_wrapper.h
Line
Count
Source
1
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
2
// Use of this source code is governed by a BSD-style license that can be
3
// found in the LICENSE file. See the AUTHORS file for names of contributors.
4
5
#ifndef STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
6
#define STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_
7
8
#include "leveldb/iterator.h"
9
#include "leveldb/slice.h"
10
11
namespace leveldb {
12
13
// A internal wrapper class with an interface similar to Iterator that
14
// caches the valid() and key() results for an underlying iterator.
15
// This can help avoid virtual function calls and also gives better
16
// cache locality.
17
class IteratorWrapper {
18
 public:
19
683k
  IteratorWrapper() : iter_(nullptr), valid_(false) {}
20
1.98M
  explicit IteratorWrapper(Iterator* iter) : iter_(nullptr) { Set(iter); }
21
2.66M
  ~IteratorWrapper() { delete iter_; }
22
15.9M
  Iterator* iter() const { return iter_; }
23
24
  // Takes ownership of "iter" and will delete it when destroyed, or
25
  // when Set() is invoked again.
26
4.85M
  void Set(Iterator* iter) {
27
4.85M
    delete iter_;
28
4.85M
    iter_ = iter;
29
4.85M
    if (iter_ == nullptr) {
30
2.19M
      valid_ = false;
31
2.66M
    } else {
32
2.66M
      Update();
33
2.66M
    }
34
4.85M
  }
35
36
  // Iterator interface methods
37
45.6M
  bool Valid() const { return valid_; }
38
31.3M
  Slice key() const {
39
31.3M
    assert(Valid());
40
31.3M
    return key_;
41
31.3M
  }
42
14.6M
  Slice value() const {
43
14.6M
    assert(Valid());
44
14.6M
    return iter_->value();
45
14.6M
  }
46
  // Methods below require iter() != nullptr
47
1.57M
  Status status() const {
48
1.57M
    assert(iter_);
49
1.57M
    return iter_->status();
50
1.57M
  }
51
16.3M
  void Next() {
52
16.3M
    assert(iter_);
53
16.3M
    iter_->Next();
54
16.3M
    Update();
55
16.3M
  }
56
0
  void Prev() {
57
0
    assert(iter_);
58
0
    iter_->Prev();
59
0
    Update();
60
0
  }
61
0
  void Seek(const Slice& k) {
62
0
    assert(iter_);
63
0
    iter_->Seek(k);
64
0
    Update();
65
0
  }
66
1.99M
  void SeekToFirst() {
67
1.99M
    assert(iter_);
68
1.99M
    iter_->SeekToFirst();
69
1.99M
    Update();
70
1.99M
  }
71
0
  void SeekToLast() {
72
0
    assert(iter_);
73
0
    iter_->SeekToLast();
74
0
    Update();
75
0
  }
76
77
 private:
78
21.0M
  void Update() {
79
21.0M
    valid_ = iter_->Valid();
80
21.0M
    if (valid_) {
81
16.5M
      key_ = iter_->key();
82
16.5M
    }
83
21.0M
  }
84
85
  Iterator* iter_;
86
  bool valid_;
87
  Slice key_;
88
};
89
90
}  // namespace leveldb
91
92
#endif  // STORAGE_LEVELDB_TABLE_ITERATOR_WRAPPER_H_