virtualx-engine/core/string/string_name.h

Ignoring revisions in .git-blame-ignore-revs. Click here to bypass and see the normal blame view.

213 lines
7.2 KiB
C++
Raw Normal View History

2014-02-10 02:10:30 +01:00
/*************************************************************************/
/* string_name.h */
2014-02-10 02:10:30 +01:00
/*************************************************************************/
/* This file is part of: */
/* GODOT ENGINE */
/* https://godotengine.org */
2014-02-10 02:10:30 +01:00
/*************************************************************************/
/* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
/* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */
2014-02-10 02:10:30 +01:00
/* */
/* Permission is hereby granted, free of charge, to any person obtaining */
/* a copy of this software and associated documentation files (the */
/* "Software"), to deal in the Software without restriction, including */
/* without limitation the rights to use, copy, modify, merge, publish, */
/* distribute, sublicense, and/or sell copies of the Software, and to */
/* permit persons to whom the Software is furnished to do so, subject to */
/* the following conditions: */
/* */
/* The above copyright notice and this permission notice shall be */
/* included in all copies or substantial portions of the Software. */
/* */
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
/*************************************************************************/
#ifndef STRING_NAME_H
#define STRING_NAME_H
2014-02-10 02:10:30 +01:00
#include "core/os/mutex.h"
#include "core/string/ustring.h"
#include "core/templates/safe_refcount.h"
2014-02-10 02:10:30 +01:00
#define UNIQUE_NODE_PREFIX "%"
class Main;
2014-02-10 02:10:30 +01:00
struct StaticCString {
const char *ptr;
static StaticCString create(const char *p_ptr);
};
class StringName {
enum {
STRING_TABLE_BITS = 16,
2014-02-10 02:10:30 +01:00
STRING_TABLE_LEN = 1 << STRING_TABLE_BITS,
STRING_TABLE_MASK = STRING_TABLE_LEN - 1
};
2016-03-09 00:00:52 +01:00
struct _Data {
2014-02-10 02:10:30 +01:00
SafeRefCount refcount;
SafeNumeric<uint32_t> static_count;
const char *cname = nullptr;
2014-02-10 02:10:30 +01:00
String name;
#ifdef DEBUG_ENABLED
uint32_t debug_references = 0;
#endif
2014-02-10 02:10:30 +01:00
String get_name() const { return cname ? String(cname) : name; }
int idx = 0;
uint32_t hash = 0;
_Data *prev = nullptr;
_Data *next = nullptr;
_Data() {}
2014-02-10 02:10:30 +01:00
};
2016-03-09 00:00:52 +01:00
2014-02-10 02:10:30 +01:00
static _Data *_table[STRING_TABLE_LEN];
2016-03-09 00:00:52 +01:00
_Data *_data = nullptr;
2016-03-09 00:00:52 +01:00
2014-02-10 02:10:30 +01:00
union _HashUnion {
_Data *ptr = nullptr;
2014-02-10 02:10:30 +01:00
uint32_t hash;
};
2016-03-09 00:00:52 +01:00
2014-02-10 02:10:30 +01:00
void unref();
friend void register_core_types();
friend void unregister_core_types();
friend class Main;
2020-02-28 11:02:20 +01:00
static Mutex mutex;
2014-02-10 02:10:30 +01:00
static void setup();
static void cleanup();
static bool configured;
#ifdef DEBUG_ENABLED
struct DebugSortReferences {
bool operator()(const _Data *p_left, const _Data *p_right) const {
return p_left->debug_references > p_right->debug_references;
}
};
static bool debug_stringname;
#endif
2016-03-09 00:00:52 +01:00
2014-02-10 02:10:30 +01:00
StringName(_Data *p_data) { _data = p_data; }
public:
2020-12-15 13:04:21 +01:00
operator const void *() const { return (_data && (_data->cname || !_data->name.is_empty())) ? (void *)1 : nullptr; }
2016-03-09 00:00:52 +01:00
2014-02-10 02:10:30 +01:00
bool operator==(const String &p_name) const;
bool operator==(const char *p_name) const;
bool operator!=(const String &p_name) const;
bool operator!=(const char *p_name) const;
_FORCE_INLINE_ bool is_node_unique_name() const {
if (!_data) {
return false;
}
if (_data->cname != nullptr) {
return (char32_t)_data->cname[0] == (char32_t)UNIQUE_NODE_PREFIX[0];
} else {
return (char32_t)_data->name[0] == (char32_t)UNIQUE_NODE_PREFIX[0];
}
}
2014-02-10 02:10:30 +01:00
_FORCE_INLINE_ bool operator<(const StringName &p_name) const {
return _data < p_name._data;
}
_FORCE_INLINE_ bool operator==(const StringName &p_name) const {
2016-03-09 00:00:52 +01:00
// the real magic of all this mess happens here.
2014-02-10 02:10:30 +01:00
// this is why path comparisons are very fast
return _data == p_name._data;
2016-03-09 00:00:52 +01:00
}
2014-02-10 02:10:30 +01:00
_FORCE_INLINE_ uint32_t hash() const {
if (_data) {
2014-02-10 02:10:30 +01:00
return _data->hash;
} else {
2014-02-10 02:10:30 +01:00
return 0;
}
2014-02-10 02:10:30 +01:00
}
2017-09-05 18:07:13 +02:00
_FORCE_INLINE_ const void *data_unique_pointer() const {
return (void *)_data;
}
2014-02-10 02:10:30 +01:00
bool operator!=(const StringName &p_name) const;
2016-03-09 00:00:52 +01:00
_FORCE_INLINE_ operator String() const {
if (_data) {
if (_data->cname) {
return String(_data->cname);
} else {
return _data->name;
}
}
return String();
}
2014-02-10 02:10:30 +01:00
static StringName search(const char *p_name);
static StringName search(const char32_t *p_name);
2014-02-10 02:10:30 +01:00
static StringName search(const String &p_name);
struct AlphCompare {
_FORCE_INLINE_ bool operator()(const StringName &l, const StringName &r) const {
const char *l_cname = l._data ? l._data->cname : "";
const char *r_cname = r._data ? r._data->cname : "";
if (l_cname) {
if (r_cname) {
return is_str_less(l_cname, r_cname);
} else {
return is_str_less(l_cname, r._data->name.ptr());
}
} else {
if (r_cname) {
return is_str_less(l._data->name.ptr(), r_cname);
} else {
return is_str_less(l._data->name.ptr(), r._data->name.ptr());
}
}
2014-02-10 02:10:30 +01:00
}
};
void operator=(const StringName &p_name);
StringName(const char *p_name, bool p_static = false);
2014-02-10 02:10:30 +01:00
StringName(const StringName &p_name);
StringName(const String &p_name, bool p_static = false);
StringName(const StaticCString &p_static_string, bool p_static = false);
StringName() {}
_FORCE_INLINE_ ~StringName() {
if (likely(configured) && _data) { //only free if configured
unref();
}
}
#ifdef DEBUG_ENABLED
static void set_debug_stringnames(bool p_enable) { debug_stringname = p_enable; }
#endif
2014-02-10 02:10:30 +01:00
};
bool operator==(const String &p_name, const StringName &p_string_name);
bool operator!=(const String &p_name, const StringName &p_string_name);
bool operator==(const char *p_name, const StringName &p_string_name);
bool operator!=(const char *p_name, const StringName &p_string_name);
StringName _scs_create(const char *p_chr, bool p_static = false);
/*
* The SNAME macro is used to speed up StringName creation, as it allows caching it after the first usage in a very efficient way.
* It should NOT be used everywhere, but instead in places where high performance is required and the creation of a StringName
* can be costly. Places where it should be used are:
* - Control::get_theme_*(<name> and Window::get_theme_*(<name> functions.
* - emit_signal(<name>,..) function
* - call_deferred(<name>,..) function
* - Comparisons to a StringName in overridden _set and _get methods.
*
* Use in places that can be called hundreds of times per frame (or more) is recommended, but this situation is very rare. If in doubt, do not use.
*/
#define SNAME(m_arg) ([]() -> const StringName & { static StringName sname = _scs_create(m_arg, true); return sname; })()
2014-02-10 02:10:30 +01:00
#endif // STRING_NAME_H