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.
144 lines
5.4 KiB
144 lines
5.4 KiB
// Copyright 2023 The Centipede Authors.
|
|
//
|
|
// 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
|
|
//
|
|
// https://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 THIRD_PARTY_CENTIPEDE_FEATURE_SET_H_
|
|
#define THIRD_PARTY_CENTIPEDE_FEATURE_SET_H_
|
|
|
|
#include <bitset>
|
|
#include <cstddef>
|
|
#include <cstdint>
|
|
#include <initializer_list>
|
|
#include <ostream>
|
|
#include <string>
|
|
|
|
#include "absl/log/log.h"
|
|
#include "./centipede/control_flow.h"
|
|
#include "./centipede/feature.h"
|
|
#include "./centipede/util.h"
|
|
|
|
namespace fuzztest::internal {
|
|
|
|
// Set of features with their frequencies.
|
|
// Features that have a frequency >= frequency_threshold
|
|
// are considered too frequent and thus less interesting for further fuzzing.
|
|
// All features must be in [0, feature_domains::kLastDomain.begin()).
|
|
class FeatureSet {
|
|
public:
|
|
using FeatureDomainSet = std::bitset<feature_domains::kNumDomains>;
|
|
|
|
explicit FeatureSet(uint8_t frequency_threshold,
|
|
FeatureDomainSet should_discard_domain)
|
|
: frequency_threshold_(frequency_threshold),
|
|
should_discard_domain_(should_discard_domain) {}
|
|
|
|
// Returns true if there are features in `features` not present in `this`.
|
|
bool HasUnseenFeatures(const FeatureVec &features) const;
|
|
|
|
// Removes all features from `features` that are too frequent or are in
|
|
// discarded domains.
|
|
// Returns the number of unpruned features in `features` that were not
|
|
// previously present in `this`.
|
|
size_t PruneFeaturesAndCountUnseen(FeatureVec &features) const;
|
|
|
|
// Prune the features that are in discarded domains.
|
|
// Effectively a subset of PruneFeaturesAndCountUnseen.
|
|
void PruneDiscardedDomains(FeatureVec &features) const;
|
|
|
|
// For every feature in `features` increment its frequency.
|
|
// If a feature wasn't seen before, it is added to `this`.
|
|
void IncrementFrequencies(const FeatureVec &features);
|
|
|
|
// How many different features are in the set.
|
|
size_t size() const { return num_features_; }
|
|
|
|
// Returns features that originate from CFG counters, converted to PCIndexVec.
|
|
PCIndexVec ToCoveragePCs() const;
|
|
|
|
// Returns the number of features in `this` from the given feature domain.
|
|
size_t CountFeatures(feature_domains::Domain domain) const;
|
|
// Returns the number of features in `this` from the given feature domains.
|
|
template <typename DomainListT>
|
|
size_t CountFeatures(const DomainListT &domains) const {
|
|
size_t count = 0;
|
|
for (auto domain : domains) {
|
|
count += features_per_domain_[domain.domain_id()];
|
|
}
|
|
return count;
|
|
}
|
|
// The same for an `initializer_list`, to enable usages like
|
|
// `CountFeatures({kPCs, kCMP})`.
|
|
size_t CountFeatures(
|
|
std::initializer_list<feature_domains::Domain> domains) const {
|
|
return CountFeatures<>(domains);
|
|
}
|
|
|
|
// Returns the frequency associated with `feature`.
|
|
size_t Frequency(feature_t feature) const { return frequencies_[feature]; }
|
|
|
|
// Computes combined weight of `features`.
|
|
// The less frequent the feature is, the bigger its weight.
|
|
// The weight of a FeatureVec is a sum of individual feature weights.
|
|
uint64_t ComputeWeight(const FeatureVec &features) const;
|
|
|
|
// Returns a debug string representing the state of *this.
|
|
std::string DebugString() const;
|
|
|
|
private:
|
|
// Computes the frequency threshold based on the domain of `feature`.
|
|
// For now, just uses 1 for kPCPair and frequency_threshold_ for all others.
|
|
// Rationale: the kPCPair features might be too numerous, we don't want to
|
|
// store more than one of each such feature in the corpus.
|
|
uint8_t FrequencyThreshold(feature_t feature) const {
|
|
if (feature_domains::kPCPair.Contains(feature)) return 1;
|
|
return frequency_threshold_;
|
|
}
|
|
|
|
// Returns 'true' if we should always filter out this specific feature ID.
|
|
// This is a configurable policy that does not depend on the frequency of the
|
|
// feature.
|
|
bool ShouldDiscardFeature(feature_t feature) const {
|
|
size_t domain_id = feature_domains::Domain::FeatureToDomainId(feature);
|
|
// TODO(b/385774476): Remove this check once the root cause is fixed.
|
|
if (domain_id >= feature_domains::kNumDomains) {
|
|
LOG(ERROR) << "Unexpected feature with id: " << feature;
|
|
return true;
|
|
}
|
|
return should_discard_domain_.test(domain_id);
|
|
}
|
|
|
|
const uint8_t frequency_threshold_;
|
|
|
|
static constexpr size_t kSize = feature_domains::kLastDomain.begin();
|
|
|
|
// Maps features to their frequencies.
|
|
// This array is huge but sparse, and depending on the enabled features
|
|
// some parts of it will never be written to or read from.
|
|
// Unused parts of MmapNoReserveArray don't actually reserve memory.
|
|
MmapNoReserveArray<kSize> frequencies_;
|
|
|
|
// Counts all unique features added to this.
|
|
size_t num_features_ = 0;
|
|
|
|
// Counts features in each domain.
|
|
size_t features_per_domain_[feature_domains::kNumDomains] = {};
|
|
|
|
FeatureDomainSet should_discard_domain_;
|
|
};
|
|
|
|
// Stream out description and count of features in feature set.
|
|
std::ostream &operator<<(std::ostream &out, const FeatureSet &fs);
|
|
|
|
} // namespace fuzztest::internal
|
|
|
|
#endif // THIRD_PARTY_CENTIPEDE_FEATURE_SET_H_
|
|
|