|
|
|
// Copyright 2020 The Abseil 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 ABSL_STRINGS_INTERNAL_STR_FORMAT_PARSER_H_
|
|
|
|
#define ABSL_STRINGS_INTERNAL_STR_FORMAT_PARSER_H_
|
|
|
|
|
|
|
|
#include <limits.h>
|
|
|
|
#include <stddef.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
|
|
|
|
#include <cassert>
|
|
|
|
#include <cstdint>
|
|
|
|
#include <initializer_list>
|
|
|
|
#include <iosfwd>
|
|
|
|
#include <iterator>
|
|
|
|
#include <memory>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include "absl/strings/internal/str_format/checker.h"
|
|
|
|
#include "absl/strings/internal/str_format/extension.h"
|
|
|
|
|
|
|
|
namespace absl {
|
|
|
|
ABSL_NAMESPACE_BEGIN
|
|
|
|
namespace str_format_internal {
|
|
|
|
|
|
|
|
enum class LengthMod : std::uint8_t { h, hh, l, ll, L, j, z, t, q, none };
|
|
|
|
|
|
|
|
std::string LengthModToString(LengthMod v);
|
|
|
|
|
|
|
|
// The analyzed properties of a single specified conversion.
|
|
|
|
struct UnboundConversion {
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
UnboundConversion() {}
|
|
|
|
|
|
|
|
class InputValue {
|
|
|
|
public:
|
|
|
|
void set_value(int value) {
|
|
|
|
assert(value >= 0);
|
|
|
|
value_ = value;
|
|
|
|
}
|
|
|
|
int value() const { return value_; }
|
|
|
|
|
|
|
|
// Marks the value as "from arg". aka the '*' format.
|
|
|
|
// Requires `value >= 1`.
|
|
|
|
// When set, is_from_arg() return true and get_from_arg() returns the
|
|
|
|
// original value.
|
|
|
|
// `value()`'s return value is unspecfied in this state.
|
|
|
|
void set_from_arg(int value) {
|
|
|
|
assert(value > 0);
|
|
|
|
value_ = -value - 1;
|
|
|
|
}
|
|
|
|
bool is_from_arg() const { return value_ < -1; }
|
|
|
|
int get_from_arg() const {
|
|
|
|
assert(is_from_arg());
|
|
|
|
return -value_ - 1;
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
int value_ = -1;
|
|
|
|
};
|
|
|
|
|
|
|
|
// No need to initialize. It will always be set in the parser.
|
|
|
|
int arg_position;
|
|
|
|
|
|
|
|
InputValue width;
|
|
|
|
InputValue precision;
|
|
|
|
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
Flags flags = Flags::kBasic;
|
|
|
|
LengthMod length_mod = LengthMod::none;
|
|
|
|
FormatConversionChar conv = FormatConversionCharInternal::kNone;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Consume conversion spec prefix (not including '%') of [p, end) if valid.
|
|
|
|
// Examples of valid specs would be e.g.: "s", "d", "-12.6f".
|
|
|
|
// If valid, it returns the first character following the conversion spec,
|
|
|
|
// and the spec part is broken down and returned in 'conv'.
|
|
|
|
// If invalid, returns nullptr.
|
|
|
|
const char* ConsumeUnboundConversion(const char* p, const char* end,
|
|
|
|
UnboundConversion* conv, int* next_arg);
|
|
|
|
|
|
|
|
// Helper tag class for the table below.
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
// It allows fast `char -> ConversionChar/LengthMod/Flags` checking and
|
|
|
|
// conversions.
|
|
|
|
class ConvTag {
|
|
|
|
public:
|
|
|
|
constexpr ConvTag(FormatConversionChar conversion_char) // NOLINT
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
: tag_(static_cast<uint8_t>(conversion_char)) {}
|
|
|
|
constexpr ConvTag(LengthMod length_mod) // NOLINT
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
: tag_(0x80 | static_cast<uint8_t>(length_mod)) {}
|
|
|
|
constexpr ConvTag(Flags flags) // NOLINT
|
|
|
|
: tag_(0xc0 | static_cast<uint8_t>(flags)) {}
|
|
|
|
constexpr ConvTag() : tag_(0xFF) {}
|
|
|
|
|
|
|
|
bool is_conv() const { return (tag_ & 0x80) == 0; }
|
|
|
|
bool is_length() const { return (tag_ & 0xC0) == 0x80; }
|
|
|
|
bool is_flags() const { return (tag_ & 0xE0) == 0xC0; }
|
|
|
|
|
|
|
|
FormatConversionChar as_conv() const {
|
|
|
|
assert(is_conv());
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
assert(!is_length());
|
|
|
|
assert(!is_flags());
|
|
|
|
return static_cast<FormatConversionChar>(tag_);
|
|
|
|
}
|
|
|
|
LengthMod as_length() const {
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
assert(!is_conv());
|
|
|
|
assert(is_length());
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
assert(!is_flags());
|
|
|
|
return static_cast<LengthMod>(tag_ & 0x3F);
|
|
|
|
}
|
|
|
|
Flags as_flags() const {
|
|
|
|
assert(!is_conv());
|
|
|
|
assert(!is_length());
|
|
|
|
assert(is_flags());
|
|
|
|
return static_cast<Flags>(tag_ & 0x1F);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
Export of internal Abseil changes
--
9fc37c11b9e46287acef00ee06ed9adcba54dd13 by Greg Falcon <gfalcon@google.com>:
Rename absl::hash_internal::HashState to absl::hash_internal::MixingHashState.
Before this change, we had two classes named HashState: absl::HashState, the public API used for type erasure, and absl::hash_internal::HashState, the internal concrete implementation ordinarily used.
The internal class used to be named `CityHashState`, but we renamed it to `HashState` it when we changed underlying hash implementation to wyhash. This inadvertent naming conflict made the code much harder to read, and this change intends to undo that.
PiperOrigin-RevId: 373481959
--
4aec55ffddebd085c239352a2e20721091f719a1 by Greg Falcon <gfalcon@google.com>:
Introduce absl::HashOf(), a convenience wrapper around absl::Hash that calculates hashes from the values of its arguments.
PiperOrigin-RevId: 373461406
--
86b5fd8db50bbc8bd0aa9258523527381fe0445d by Abseil Team <absl-team@google.com>:
Improve speed of BlockingCounter by making its most common path lock free.
With the new implementation, the fast path of BlockingCounter::DecrementCount()
is only a fetch_sub operation. This is most times much more efficient than the
previous implementation (full mutex lock/unlock). As a matter of fact, in most
actual usecases in practice, the waiter thread is already waiting on the
Wait() call when DecrementCount() is called, which makes Mutex::Unlock() take
the slow path as there's a waiter thread that it might need to wake up.
PiperOrigin-RevId: 373394164
--
65c876be5eac0cd32583ff8535ede4109d39cf3f by Martijn Vels <mvels@google.com>:
Move the 'sample copied cord' logic into MaybeTrackCord(),
This changes move the logic for selecting if a cord should remain being sampled from Cord to CordzInfo::MaybeTrackCord, and updates the documentation for the latter method.
PiperOrigin-RevId: 373363168
--
e84410bd0aada293a81dfb82656c952e209e21fb by Martijn Vels <mvels@google.com>:
Add check for the first call to cordz_should_profile() for each thread.
This prevents the first cord of a newly created thread to be always sampled, which is a 'bad' kind of determinism for sampling.
PiperOrigin-RevId: 373229768
--
bf09c589dc099ac8f4af780bf7e609c53c27574c by Samuel Benzaquen <sbenza@google.com>:
Refactor the Flags structure into an enum.
This gives us more control over the representation and allows for easier
merging during parsing.
PiperOrigin-RevId: 373163038
--
b947b0c51083b7b6508284b5d31819596c91729e by Derek Mauro <dmauro@google.com>:
Fixes warnings about shadowed variables
Fixes #956
PiperOrigin-RevId: 373158133
GitOrigin-RevId: 9fc37c11b9e46287acef00ee06ed9adcba54dd13
Change-Id: I91f35699f9bf439d1a870c6493946a310afe088c
4 years ago
|
|
|
uint8_t tag_;
|
|
|
|
};
|
|
|
|
|
|
|
|
extern const ConvTag kTags[256];
|
|
|
|
// Keep a single table for all the conversion chars and length modifiers.
|
|
|
|
inline ConvTag GetTagForChar(char c) {
|
|
|
|
return kTags[static_cast<unsigned char>(c)];
|
|
|
|
}
|
|
|
|
|
|
|
|
// Parse the format string provided in 'src' and pass the identified items into
|
|
|
|
// 'consumer'.
|
|
|
|
// Text runs will be passed by calling
|
|
|
|
// Consumer::Append(string_view);
|
|
|
|
// ConversionItems will be passed by calling
|
|
|
|
// Consumer::ConvertOne(UnboundConversion, string_view);
|
|
|
|
// In the case of ConvertOne, the string_view that is passed is the
|
|
|
|
// portion of the format string corresponding to the conversion, not including
|
|
|
|
// the leading %. On success, it returns true. On failure, it stops and returns
|
|
|
|
// false.
|
|
|
|
template <typename Consumer>
|
|
|
|
bool ParseFormatString(string_view src, Consumer consumer) {
|
|
|
|
int next_arg = 0;
|
|
|
|
const char* p = src.data();
|
|
|
|
const char* const end = p + src.size();
|
|
|
|
while (p != end) {
|
|
|
|
const char* percent =
|
|
|
|
static_cast<const char*>(memchr(p, '%', static_cast<size_t>(end - p)));
|
|
|
|
if (!percent) {
|
|
|
|
// We found the last substring.
|
|
|
|
return consumer.Append(string_view(p, end - p));
|
|
|
|
}
|
|
|
|
// We found a percent, so push the text run then process the percent.
|
|
|
|
if (ABSL_PREDICT_FALSE(!consumer.Append(string_view(p, percent - p)))) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
if (ABSL_PREDICT_FALSE(percent + 1 >= end)) return false;
|
|
|
|
|
|
|
|
auto tag = GetTagForChar(percent[1]);
|
|
|
|
if (tag.is_conv()) {
|
|
|
|
if (ABSL_PREDICT_FALSE(next_arg < 0)) {
|
|
|
|
// This indicates an error in the format string.
|
|
|
|
// The only way to get `next_arg < 0` here is to have a positional
|
|
|
|
// argument first which sets next_arg to -1 and then a non-positional
|
|
|
|
// argument.
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
p = percent + 2;
|
|
|
|
|
|
|
|
// Keep this case separate from the one below.
|
|
|
|
// ConvertOne is more efficient when the compiler can see that the `basic`
|
|
|
|
// flag is set.
|
|
|
|
UnboundConversion conv;
|
|
|
|
conv.conv = tag.as_conv();
|
|
|
|
conv.arg_position = ++next_arg;
|
|
|
|
if (ABSL_PREDICT_FALSE(
|
|
|
|
!consumer.ConvertOne(conv, string_view(percent + 1, 1)))) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else if (percent[1] != '%') {
|
|
|
|
UnboundConversion conv;
|
|
|
|
p = ConsumeUnboundConversion(percent + 1, end, &conv, &next_arg);
|
|
|
|
if (ABSL_PREDICT_FALSE(p == nullptr)) return false;
|
|
|
|
if (ABSL_PREDICT_FALSE(!consumer.ConvertOne(
|
|
|
|
conv, string_view(percent + 1, p - (percent + 1))))) {
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
if (ABSL_PREDICT_FALSE(!consumer.Append("%"))) return false;
|
|
|
|
p = percent + 2;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Always returns true, or fails to compile in a constexpr context if s does not
|
|
|
|
// point to a constexpr char array.
|
|
|
|
constexpr bool EnsureConstexpr(string_view s) {
|
|
|
|
return s.empty() || s[0] == s[0];
|
|
|
|
}
|
|
|
|
|
|
|
|
class ParsedFormatBase {
|
|
|
|
public:
|
|
|
|
explicit ParsedFormatBase(
|
|
|
|
string_view format, bool allow_ignored,
|
|
|
|
std::initializer_list<FormatConversionCharSet> convs);
|
|
|
|
|
|
|
|
ParsedFormatBase(const ParsedFormatBase& other) { *this = other; }
|
|
|
|
|
|
|
|
ParsedFormatBase(ParsedFormatBase&& other) { *this = std::move(other); }
|
|
|
|
|
|
|
|
ParsedFormatBase& operator=(const ParsedFormatBase& other) {
|
|
|
|
if (this == &other) return *this;
|
|
|
|
has_error_ = other.has_error_;
|
|
|
|
items_ = other.items_;
|
|
|
|
size_t text_size = items_.empty() ? 0 : items_.back().text_end;
|
|
|
|
data_.reset(new char[text_size]);
|
|
|
|
memcpy(data_.get(), other.data_.get(), text_size);
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
ParsedFormatBase& operator=(ParsedFormatBase&& other) {
|
|
|
|
if (this == &other) return *this;
|
|
|
|
has_error_ = other.has_error_;
|
|
|
|
data_ = std::move(other.data_);
|
|
|
|
items_ = std::move(other.items_);
|
|
|
|
// Reset the vector to make sure the invariants hold.
|
|
|
|
other.items_.clear();
|
|
|
|
return *this;
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename Consumer>
|
|
|
|
bool ProcessFormat(Consumer consumer) const {
|
|
|
|
const char* const base = data_.get();
|
|
|
|
string_view text(base, 0);
|
|
|
|
for (const auto& item : items_) {
|
|
|
|
const char* const end = text.data() + text.size();
|
|
|
|
text =
|
|
|
|
string_view(end, static_cast<size_t>((base + item.text_end) - end));
|
|
|
|
if (item.is_conversion) {
|
|
|
|
if (!consumer.ConvertOne(item.conv, text)) return false;
|
|
|
|
} else {
|
|
|
|
if (!consumer.Append(text)) return false;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return !has_error_;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool has_error() const { return has_error_; }
|
|
|
|
|
|
|
|
private:
|
|
|
|
// Returns whether the conversions match and if !allow_ignored it verifies
|
|
|
|
// that all conversions are used by the format.
|
|
|
|
bool MatchesConversions(
|
|
|
|
bool allow_ignored,
|
|
|
|
std::initializer_list<FormatConversionCharSet> convs) const;
|
|
|
|
|
|
|
|
struct ParsedFormatConsumer;
|
|
|
|
|
|
|
|
struct ConversionItem {
|
|
|
|
bool is_conversion;
|
|
|
|
// Points to the past-the-end location of this element in the data_ array.
|
|
|
|
size_t text_end;
|
|
|
|
UnboundConversion conv;
|
|
|
|
};
|
|
|
|
|
|
|
|
bool has_error_;
|
|
|
|
std::unique_ptr<char[]> data_;
|
|
|
|
std::vector<ConversionItem> items_;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// A value type representing a preparsed format. These can be created, copied
|
|
|
|
// around, and reused to speed up formatting loops.
|
|
|
|
// The user must specify through the template arguments the conversion
|
|
|
|
// characters used in the format. This will be checked at compile time.
|
|
|
|
//
|
|
|
|
// This class uses Conv enum values to specify each argument.
|
|
|
|
// This allows for more flexibility as you can specify multiple possible
|
|
|
|
// conversion characters for each argument.
|
|
|
|
// ParsedFormat<char...> is a simplified alias for when the user only
|
|
|
|
// needs to specify a single conversion character for each argument.
|
|
|
|
//
|
|
|
|
// Example:
|
|
|
|
// // Extended format supports multiple characters per argument:
|
|
|
|
// using MyFormat = ExtendedParsedFormat<Conv::d | Conv::x>;
|
|
|
|
// MyFormat GetFormat(bool use_hex) {
|
|
|
|
// if (use_hex) return MyFormat("foo %x bar");
|
|
|
|
// return MyFormat("foo %d bar");
|
|
|
|
// }
|
|
|
|
// // 'format' can be used with any value that supports 'd' and 'x',
|
|
|
|
// // like `int`.
|
|
|
|
// auto format = GetFormat(use_hex);
|
|
|
|
// value = StringF(format, i);
|
|
|
|
//
|
|
|
|
// This class also supports runtime format checking with the ::New() and
|
|
|
|
// ::NewAllowIgnored() factory functions.
|
|
|
|
// This is the only API that allows the user to pass a runtime specified format
|
|
|
|
// string. These factory functions will return NULL if the format does not match
|
|
|
|
// the conversions requested by the user.
|
|
|
|
template <FormatConversionCharSet... C>
|
|
|
|
class ExtendedParsedFormat : public str_format_internal::ParsedFormatBase {
|
|
|
|
public:
|
|
|
|
explicit ExtendedParsedFormat(string_view format)
|
|
|
|
#ifdef ABSL_INTERNAL_ENABLE_FORMAT_CHECKER
|
|
|
|
__attribute__((
|
|
|
|
enable_if(str_format_internal::EnsureConstexpr(format),
|
|
|
|
"Format string is not constexpr."),
|
|
|
|
enable_if(str_format_internal::ValidFormatImpl<C...>(format),
|
|
|
|
"Format specified does not match the template arguments.")))
|
|
|
|
#endif // ABSL_INTERNAL_ENABLE_FORMAT_CHECKER
|
|
|
|
: ExtendedParsedFormat(format, false) {
|
|
|
|
}
|
|
|
|
|
|
|
|
// ExtendedParsedFormat factory function.
|
|
|
|
// The user still has to specify the conversion characters, but they will not
|
|
|
|
// be checked at compile time. Instead, it will be checked at runtime.
|
|
|
|
// This delays the checking to runtime, but allows the user to pass
|
|
|
|
// dynamically sourced formats.
|
|
|
|
// It returns NULL if the format does not match the conversion characters.
|
|
|
|
// The user is responsible for checking the return value before using it.
|
|
|
|
//
|
|
|
|
// The 'New' variant will check that all the specified arguments are being
|
|
|
|
// consumed by the format and return NULL if any argument is being ignored.
|
|
|
|
// The 'NewAllowIgnored' variant will not verify this and will allow formats
|
|
|
|
// that ignore arguments.
|
|
|
|
static std::unique_ptr<ExtendedParsedFormat> New(string_view format) {
|
|
|
|
return New(format, false);
|
|
|
|
}
|
|
|
|
static std::unique_ptr<ExtendedParsedFormat> NewAllowIgnored(
|
|
|
|
string_view format) {
|
|
|
|
return New(format, true);
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
static std::unique_ptr<ExtendedParsedFormat> New(string_view format,
|
|
|
|
bool allow_ignored) {
|
|
|
|
std::unique_ptr<ExtendedParsedFormat> conv(
|
|
|
|
new ExtendedParsedFormat(format, allow_ignored));
|
|
|
|
if (conv->has_error()) return nullptr;
|
|
|
|
return conv;
|
|
|
|
}
|
|
|
|
|
|
|
|
ExtendedParsedFormat(string_view s, bool allow_ignored)
|
|
|
|
: ParsedFormatBase(s, allow_ignored, {C...}) {}
|
|
|
|
};
|
|
|
|
} // namespace str_format_internal
|
|
|
|
ABSL_NAMESPACE_END
|
|
|
|
} // namespace absl
|
|
|
|
|
|
|
|
#endif // ABSL_STRINGS_INTERNAL_STR_FORMAT_PARSER_H_
|