1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64
|
/*
* Copyright (C) 2013 The Android Open Source Project
*
* 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.
*/
#ifndef ART_COMPILER_UTILS_DEDUPE_SET_H_
#define ART_COMPILER_UTILS_DEDUPE_SET_H_
#include <stdint.h>
#include <memory>
#include <string>
#include "base/macros.h"
namespace art HIDDEN {
class Thread;
// A set of Keys that support a HashFunc returning HashType. Used to find duplicates of Key in the
// Add method. The data-structure is thread-safe through the use of internal locks, it also
// supports the lock being sharded.
template <typename InKey,
typename StoreKey,
typename Alloc,
typename HashType,
typename HashFunc,
HashType kShard = 1>
class DedupeSet {
public:
// Add a new key to the dedupe set if not present. Return the equivalent deduplicated stored key.
const StoreKey* Add(Thread* self, const InKey& key);
DedupeSet(const char* set_name, const Alloc& alloc);
~DedupeSet();
size_t Size(Thread* self) const;
std::string DumpStats(Thread* self) const;
private:
struct Stats;
class Shard;
std::unique_ptr<Shard> shards_[kShard];
uint64_t hash_time_;
DISALLOW_COPY_AND_ASSIGN(DedupeSet);
};
} // namespace art
#endif // ART_COMPILER_UTILS_DEDUPE_SET_H_
|