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 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298
// Copyright 2023 RisingWave Labs
//
// 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.
use std::any::Any;
use std::fmt::{Debug, Display};
use std::hash::Hash;
use std::sync::{Arc, Weak};
use derive_builder::Builder;
use parking_lot::RwLock;
use weak_table::WeakValueHashMap;
use crate::context::{ContextId, Tree, TreeContext};
use crate::obj_utils::{DynEq, DynHash};
use crate::{Span, TreeRoot};
/// Configuration for an await-tree registry, which affects the behavior of all await-trees in the
/// registry.
#[derive(Debug, Clone, Builder)]
#[builder(default)]
pub struct Config {
/// Whether to include the **verbose** span in the await-tree.
verbose: bool,
}
#[allow(clippy::derivable_impls)]
impl Default for Config {
fn default() -> Self {
Self { verbose: false }
}
}
/// A key that can be used to identify a task and its await-tree in the [`Registry`].
///
/// All thread-safe types that can be used as a key of a hash map are automatically implemented with
/// this trait.
pub trait Key: Hash + Eq + Debug + Send + Sync + 'static {}
impl<T> Key for T where T: Hash + Eq + Debug + Send + Sync + 'static {}
/// The object-safe version of [`Key`], automatically implemented.
trait ObjKey: DynHash + DynEq + Debug + Send + Sync + 'static {}
impl<T> ObjKey for T where T: DynHash + DynEq + Debug + Send + Sync + 'static {}
/// Type-erased key for the [`Registry`].
#[derive(Clone)]
pub struct AnyKey(Arc<dyn ObjKey>);
impl PartialEq for AnyKey {
fn eq(&self, other: &Self) -> bool {
self.0.dyn_eq(other.0.as_dyn_eq())
}
}
impl Eq for AnyKey {}
impl Hash for AnyKey {
fn hash<H: std::hash::Hasher>(&self, state: &mut H) {
self.0.dyn_hash(state);
}
}
impl Debug for AnyKey {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
self.0.fmt(f)
}
}
impl Display for AnyKey {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
// TODO: for all `impl Display`?
if let Some(s) = self.as_any().downcast_ref::<String>() {
write!(f, "{}", s)
} else if let Some(s) = self.as_any().downcast_ref::<&str>() {
write!(f, "{}", s)
} else {
write!(f, "{:?}", self)
}
}
}
impl AnyKey {
fn new(key: impl ObjKey) -> Self {
Self(Arc::new(key))
}
/// Cast the key to `dyn Any`.
pub fn as_any(&self) -> &dyn Any {
self.0.as_ref().as_any()
}
/// Returns whether the key is of type `K`.
///
/// Equivalent to `self.as_any().is::<K>()`.
pub fn is<K: Any>(&self) -> bool {
self.as_any().is::<K>()
}
/// Returns whether the key corresponds to an anonymous await-tree.
pub fn is_anonymous(&self) -> bool {
self.as_any().is::<ContextId>()
}
/// Returns the key as a reference to type `K`, if it is of type `K`.
///
/// Equivalent to `self.as_any().downcast_ref::<K>()`.
pub fn downcast_ref<K: Any>(&self) -> Option<&K> {
self.as_any().downcast_ref()
}
}
type Contexts = RwLock<WeakValueHashMap<AnyKey, Weak<TreeContext>>>;
struct RegistryCore {
contexts: Contexts,
config: Config,
}
/// The registry of multiple await-trees.
///
/// Can be cheaply cloned to share the same registry.
pub struct Registry(Arc<RegistryCore>);
impl Debug for Registry {
fn fmt(&self, f: &mut std::fmt::Formatter<'_>) -> std::fmt::Result {
f.debug_struct("Registry")
.field("config", self.config())
.finish_non_exhaustive()
}
}
impl Clone for Registry {
fn clone(&self) -> Self {
Self(Arc::clone(&self.0))
}
}
impl Registry {
fn contexts(&self) -> &Contexts {
&self.0.contexts
}
fn config(&self) -> &Config {
&self.0.config
}
}
impl Registry {
/// Create a new registry with given `config`.
pub fn new(config: Config) -> Self {
Self(
RegistryCore {
contexts: Default::default(),
config,
}
.into(),
)
}
fn register_inner(&self, key: impl Key, context: Arc<TreeContext>) -> TreeRoot {
self.contexts()
.write()
.insert(AnyKey::new(key), Arc::clone(&context));
TreeRoot {
context,
registry: WeakRegistry(Arc::downgrade(&self.0)),
}
}
/// Register with given key. Returns a [`TreeRoot`] that can be used to instrument a future.
///
/// If the key already exists, a new [`TreeRoot`] is returned and the reference to the old
/// [`TreeRoot`] is dropped.
pub fn register(&self, key: impl Key, root_span: impl Into<Span>) -> TreeRoot {
let context = Arc::new(TreeContext::new(root_span.into(), self.config().verbose));
self.register_inner(key, context)
}
/// Register an anonymous await-tree without specifying a key. Returns a [`TreeRoot`] that can
/// be used to instrument a future.
///
/// Anonymous await-trees are not able to be retrieved through the [`Registry::get`] method. Use
/// [`Registry::collect_anonymous`] or [`Registry::collect_all`] to collect them.
pub fn register_anonymous(&self, root_span: impl Into<Span>) -> TreeRoot {
let context = Arc::new(TreeContext::new(root_span.into(), self.config().verbose));
self.register_inner(context.id(), context) // use the private id as the key
}
/// Get a clone of the await-tree with given key.
///
/// Returns `None` if the key does not exist or the tree root has been dropped.
pub fn get(&self, key: impl Key) -> Option<Tree> {
self.contexts()
.read()
.get(&AnyKey::new(key)) // TODO: accept ref can?
.map(|v| v.tree().clone())
}
/// Remove all the registered await-trees.
pub fn clear(&self) {
self.contexts().write().clear();
}
/// Collect the snapshots of all await-trees with the key of type `K`.
pub fn collect<K: Key + Clone>(&self) -> Vec<(K, Tree)> {
self.contexts()
.read()
.iter()
.filter_map(|(k, v)| {
k.0.as_ref()
.as_any()
.downcast_ref::<K>()
.map(|k| (k.clone(), v.tree().clone()))
})
.collect()
}
/// Collect the snapshots of all await-trees registered with [`Registry::register_anonymous`].
pub fn collect_anonymous(&self) -> Vec<Tree> {
self.contexts()
.read()
.iter()
.filter_map(|(k, v)| {
if k.is_anonymous() {
Some(v.tree().clone())
} else {
None
}
})
.collect()
}
/// Collect the snapshots of all await-trees regardless of the key type.
pub fn collect_all(&self) -> Vec<(AnyKey, Tree)> {
self.contexts()
.read()
.iter()
.map(|(k, v)| (k.clone(), v.tree().clone()))
.collect()
}
}
pub(crate) struct WeakRegistry(Weak<RegistryCore>);
impl WeakRegistry {
pub fn upgrade(&self) -> Option<Registry> {
self.0.upgrade().map(Registry)
}
}
#[cfg(test)]
mod tests {
use super::*;
#[test]
fn test_registry() {
let registry = Registry::new(Config::default());
let _0_i32 = registry.register(0_i32, "0");
let _1_i32 = registry.register(1_i32, "1");
let _2_i32 = registry.register(2_i32, "2");
let _0_str = registry.register("0", "0");
let _1_str = registry.register("1", "1");
let _unit = registry.register((), "()");
let _unit_replaced = registry.register((), "[]");
let _anon = registry.register_anonymous("anon");
let _anon = registry.register_anonymous("anon");
let i32s = registry.collect::<i32>();
assert_eq!(i32s.len(), 3);
let strs = registry.collect::<&'static str>();
assert_eq!(strs.len(), 2);
let units = registry.collect::<()>();
assert_eq!(units.len(), 1);
let anons = registry.collect_anonymous();
assert_eq!(anons.len(), 2);
let all = registry.collect_all();
assert_eq!(all.len(), 8);
}
}