mirror of
https://github.com/facebook/rocksdb.git
synced 2024-11-26 16:30:56 +00:00
b135d01e7b
Summary: Provide a framework to profile a query in detail to figure out latency bottleneck. Currently, in Get(), Put() and iterators, 2-3 simple timing is used. We can easily add more profile counters to the framework later. Test Plan: Enable this profiling in seveal existing tests. Reviewers: haobo, dhruba, kailiu, emayanke, vamsi, igor CC: leveldb Differential Revision: https://reviews.facebook.net/D14001 Conflicts: table/merger.cc
30 lines
1.1 KiB
C++
30 lines
1.1 KiB
C++
// Copyright (c) 2013, Facebook, Inc. All rights reserved.
|
|
// This source code is licensed under the BSD-style license found in the
|
|
// LICENSE file in the root directory of this source tree. An additional grant
|
|
// of patent rights can be found in the PATENTS file in the same directory.
|
|
//
|
|
// Copyright (c) 2011 The LevelDB Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
// found in the LICENSE file. See the AUTHORS file for names of contributors.
|
|
|
|
#pragma once
|
|
|
|
namespace rocksdb {
|
|
|
|
class Comparator;
|
|
class Iterator;
|
|
class Env;
|
|
|
|
// Return an iterator that provided the union of the data in
|
|
// children[0,n-1]. Takes ownership of the child iterators and
|
|
// will delete them when the result iterator is deleted.
|
|
//
|
|
// The result does no duplicate suppression. I.e., if a particular
|
|
// key is present in K child iterators, it will be yielded K times.
|
|
//
|
|
// REQUIRES: n >= 0
|
|
extern Iterator* NewMergingIterator(
|
|
Env* const env, const Comparator* comparator, Iterator** children, int n);
|
|
|
|
} // namespace rocksdb
|