fork of https://github.com/rust-rocksdb/rust-rocksdb for nextgraph
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
165 lines
6.9 KiB
165 lines
6.9 KiB
/* -*- mode: C++; c-basic-offset: 4; indent-tabs-mode: nil -*- */
|
|
// vim: ft=cpp:expandtab:ts=8:sw=4:softtabstop=4:
|
|
#ident "$Id$"
|
|
/*======
|
|
This file is part of PerconaFT.
|
|
|
|
|
|
Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved.
|
|
|
|
PerconaFT is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU General Public License, version 2,
|
|
as published by the Free Software Foundation.
|
|
|
|
PerconaFT is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU General Public License for more details.
|
|
|
|
You should have received a copy of the GNU General Public License
|
|
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
----------------------------------------
|
|
|
|
PerconaFT is free software: you can redistribute it and/or modify
|
|
it under the terms of the GNU Affero General Public License, version 3,
|
|
as published by the Free Software Foundation.
|
|
|
|
PerconaFT is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
GNU Affero General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Affero General Public License
|
|
along with PerconaFT. If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
----------------------------------------
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
you may not use this file except in compliance with the License.
|
|
You may obtain a copy of the License at
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
See the License for the specific language governing permissions and
|
|
limitations under the License.
|
|
======= */
|
|
|
|
#ident \
|
|
"Copyright (c) 2006, 2015, Percona and/or its affiliates. All rights reserved."
|
|
|
|
#pragma once
|
|
|
|
// Overview: A partitioned_counter provides a counter that can be incremented
|
|
// and the running sum can be read at any time.
|
|
// We assume that increments are frequent, whereas reading is infrequent.
|
|
// Implementation hint: Use thread-local storage so each thread increments its
|
|
// own data. The increment does not require a lock or atomic operation.
|
|
// Reading the data can be performed by iterating over the thread-local
|
|
// versions, summing them up. The data structure also includes a sum for all
|
|
// the threads that have died. Use a pthread_key to create the thread-local
|
|
// versions. When a thread finishes, the system calls pthread_key destructor
|
|
// which can add that thread's copy into the sum_of_dead counter.
|
|
// Rationale: For statistics such as are found in engine status, we need a
|
|
// counter that requires no cache misses to increment. We've seen significant
|
|
// performance speedups by removing certain counters. Rather than removing
|
|
// those statistics, we would like to just make the counter fast. We generally
|
|
// increment the counters frequently, and want to fetch the values
|
|
// infrequently. The counters are monotonic. The counters can be split into
|
|
// many counters, which can be summed up at the end. We don't care if we get
|
|
// slightly out-of-date counter sums when we read the counter. We don't care
|
|
// if there is a race on reading the a counter
|
|
// variable and incrementing.
|
|
// See tests/test_partitioned_counter.c for some performance measurements.
|
|
// Operations:
|
|
// create_partitioned_counter Create a counter initialized to zero.
|
|
// destroy_partitioned_counter Destroy it.
|
|
// increment_partitioned_counter Increment it. This is the frequent
|
|
// operation. read_partitioned_counter Get the current value. This is
|
|
// infrequent.
|
|
// See partitioned_counter.cc for the abstraction function and representation
|
|
// invariant.
|
|
//
|
|
// The google style guide says to avoid using constructors, and it appears that
|
|
// constructors may have broken all the tests, because they called
|
|
// pthread_key_create before the key was actually created. So the google style
|
|
// guide may have some wisdom there...
|
|
//
|
|
// This version does not use constructors, essentially reverrting to the google
|
|
// C++ style guide.
|
|
//
|
|
|
|
// The old C interface. This required a bunch of explicit
|
|
// ___attribute__((__destructor__)) functions to remember to destroy counters at
|
|
// the end.
|
|
#if defined(__cplusplus)
|
|
extern "C" {
|
|
#endif
|
|
|
|
typedef struct partitioned_counter *PARTITIONED_COUNTER;
|
|
PARTITIONED_COUNTER create_partitioned_counter(void);
|
|
// Effect: Create a counter, initialized to zero.
|
|
|
|
void destroy_partitioned_counter(PARTITIONED_COUNTER);
|
|
// Effect: Destroy the counter. No operations on that counter are permitted
|
|
// after this.
|
|
|
|
void increment_partitioned_counter(PARTITIONED_COUNTER, uint64_t amount);
|
|
// Effect: Increment the counter by amount.
|
|
// Requires: No overflows. This is a 64-bit unsigned counter.
|
|
|
|
uint64_t read_partitioned_counter(PARTITIONED_COUNTER)
|
|
__attribute__((__visibility__("default")));
|
|
// Effect: Return the current value of the counter.
|
|
|
|
void partitioned_counters_init(void);
|
|
// Effect: Initialize any partitioned counters data structures that must be set
|
|
// up before any partitioned counters run.
|
|
|
|
void partitioned_counters_destroy(void);
|
|
// Effect: Destroy any partitioned counters data structures.
|
|
|
|
#if defined(__cplusplus)
|
|
};
|
|
#endif
|
|
|
|
#if 0
|
|
#include <pthread.h>
|
|
|
|
#include "fttypes.h"
|
|
|
|
// Used inside the PARTITIONED_COUNTER.
|
|
struct linked_list_head {
|
|
struct linked_list_element *first;
|
|
};
|
|
|
|
|
|
class PARTITIONED_COUNTER {
|
|
public:
|
|
PARTITIONED_COUNTER(void);
|
|
// Effect: Construct a counter, initialized to zero.
|
|
|
|
~PARTITIONED_COUNTER(void);
|
|
// Effect: Destruct the counter.
|
|
|
|
void increment(uint64_t amount);
|
|
// Effect: Increment the counter by amount. This is a 64-bit unsigned counter, and if you overflow it, you will get overflowed results (that is mod 2^64).
|
|
// Requires: Don't use this from a static constructor or destructor.
|
|
|
|
uint64_t read(void);
|
|
// Effect: Read the sum.
|
|
// Requires: Don't use this from a static constructor or destructor.
|
|
|
|
private:
|
|
uint64_t _sum_of_dead; // The sum of all thread-local counts from threads that have terminated.
|
|
pthread_key_t _key; // The pthread_key which gives us the hook to construct and destruct thread-local storage.
|
|
struct linked_list_head _ll_counter_head; // A linked list of all the thread-local information for this counter.
|
|
|
|
// This function is used to destroy the thread-local part of the state when a thread terminates.
|
|
// But it's not the destructor for the local part of the counter, it's a destructor on a "dummy" key just so that we get a notification when a thread ends.
|
|
friend void destroy_thread_local_part_of_partitioned_counters (void *);
|
|
};
|
|
#endif
|
|
|