2017-01-13 18:25:43 +01:00
|
|
|
/*************************************************************************/
|
|
|
|
/* engine.cpp */
|
|
|
|
/*************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* GODOT ENGINE */
|
2017-08-27 14:16:55 +02:00
|
|
|
/* https://godotengine.org */
|
2017-01-13 18:25:43 +01:00
|
|
|
/*************************************************************************/
|
2022-01-03 21:27:34 +01:00
|
|
|
/* Copyright (c) 2007-2022 Juan Linietsky, Ariel Manzur. */
|
|
|
|
/* Copyright (c) 2014-2022 Godot Engine contributors (cf. AUTHORS.md). */
|
2017-01-13 18:25:43 +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. */
|
|
|
|
/*************************************************************************/
|
2018-01-05 00:50:27 +01:00
|
|
|
|
2017-01-13 16:51:14 +01:00
|
|
|
#include "engine.h"
|
2017-01-16 08:04:19 +01:00
|
|
|
|
2018-09-11 18:13:45 +02:00
|
|
|
#include "core/authors.gen.h"
|
2021-05-25 02:25:11 +02:00
|
|
|
#include "core/config/project_settings.h"
|
2018-09-11 18:13:45 +02:00
|
|
|
#include "core/donors.gen.h"
|
2022-08-19 14:21:43 +02:00
|
|
|
#include "core/io/json.h"
|
2018-09-11 18:13:45 +02:00
|
|
|
#include "core/license.gen.h"
|
2022-08-19 14:21:43 +02:00
|
|
|
#include "core/os/os.h"
|
2022-08-05 03:41:48 +02:00
|
|
|
#include "core/variant/typed_array.h"
|
2018-09-11 18:13:45 +02:00
|
|
|
#include "core/version.h"
|
2017-01-13 16:51:14 +01:00
|
|
|
|
2021-08-11 02:35:16 +02:00
|
|
|
void Engine::set_physics_ticks_per_second(int p_ips) {
|
2019-09-25 10:28:50 +02:00
|
|
|
ERR_FAIL_COND_MSG(p_ips <= 0, "Engine iterations per second must be greater than 0.");
|
2017-03-05 16:44:50 +01:00
|
|
|
ips = p_ips;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
2020-05-14 14:29:06 +02:00
|
|
|
|
2021-08-11 02:35:16 +02:00
|
|
|
int Engine::get_physics_ticks_per_second() const {
|
2017-01-13 16:51:14 +01:00
|
|
|
return ips;
|
|
|
|
}
|
|
|
|
|
2022-09-15 18:57:34 +02:00
|
|
|
void Engine::set_max_physics_steps_per_frame(int p_max_physics_steps) {
|
|
|
|
ERR_FAIL_COND_MSG(p_max_physics_steps <= 0, "Maximum number of physics steps per frame must be greater than 0.");
|
|
|
|
max_physics_steps_per_frame = p_max_physics_steps;
|
|
|
|
}
|
|
|
|
|
|
|
|
int Engine::get_max_physics_steps_per_frame() const {
|
|
|
|
return max_physics_steps_per_frame;
|
|
|
|
}
|
|
|
|
|
2021-02-02 03:16:37 +01:00
|
|
|
void Engine::set_physics_jitter_fix(double p_threshold) {
|
2020-05-14 16:41:43 +02:00
|
|
|
if (p_threshold < 0) {
|
Add hysteresis to physics timestep count per frame
Add new class _TimerSync to manage timestep calculations.
The new class handles the decisions about simulation progression
previously handled by main::iteration(). It is fed the current timer
ticks and determines how many physics updates are to be run and what
the delta argument to the _process() functions should be.
The new class tries to keep the number of physics updates per frame as
constant as possible from frame to frame. Ideally, it would be N steps
every render frame, but even with perfectly regular rendering, the
general case is that N or N+1 steps are required per frame, for some
fixed N. The best guess for N is stored in typical_physics_steps.
When determining the number of steps to take, no restrictions are
imposed between the choice of typical_physics_steps and
typical_physics_steps+1 steps. Should more or less steps than that be
required, the accumulated remaining time (as before, stored in
time_accum) needs to surpass its boundaries by some minimal threshold.
Once surpassed, typical_physics_steps is updated to allow the new step
count for future updates.
Care is taken that the modified calculation of the number of physics
steps is not observable from game code that only checks the delta
parameters to the _process and _physics_process functions; in addition
to modifying the number of steps, the _process argument is modified as
well to stay in expected bounds. Extra care is taken that the accumulated
steps still sum up to roughly the real elapsed time, up to a maximum
tolerated difference.
To allow the hysteresis code to work correctly on higher refresh
monitors, the number of typical physics steps is not only recorded and
kept consistent for single render frames, but for groups of them.
Currently, up to 12 frames are grouped that way.
The engine parameter physics_jitter_fix controls both the maximum
tolerated difference between wall clock time and summed up _process
arguments and the threshold for changing typical_physics_steps. It is
given in units of the real physics frame slice 1/physics_fps. Set
physics_jitter_fix to 0 to disable the effects of the new code here.
It starts to be effective against the random physics jitter at around
0.02 to 0.05. at values greater than 1 it starts having ill effects on
the engine's ability to react sensibly to dropped frames and framerate
changes.
2018-02-11 00:03:31 +01:00
|
|
|
p_threshold = 0;
|
2020-05-14 16:41:43 +02:00
|
|
|
}
|
Add hysteresis to physics timestep count per frame
Add new class _TimerSync to manage timestep calculations.
The new class handles the decisions about simulation progression
previously handled by main::iteration(). It is fed the current timer
ticks and determines how many physics updates are to be run and what
the delta argument to the _process() functions should be.
The new class tries to keep the number of physics updates per frame as
constant as possible from frame to frame. Ideally, it would be N steps
every render frame, but even with perfectly regular rendering, the
general case is that N or N+1 steps are required per frame, for some
fixed N. The best guess for N is stored in typical_physics_steps.
When determining the number of steps to take, no restrictions are
imposed between the choice of typical_physics_steps and
typical_physics_steps+1 steps. Should more or less steps than that be
required, the accumulated remaining time (as before, stored in
time_accum) needs to surpass its boundaries by some minimal threshold.
Once surpassed, typical_physics_steps is updated to allow the new step
count for future updates.
Care is taken that the modified calculation of the number of physics
steps is not observable from game code that only checks the delta
parameters to the _process and _physics_process functions; in addition
to modifying the number of steps, the _process argument is modified as
well to stay in expected bounds. Extra care is taken that the accumulated
steps still sum up to roughly the real elapsed time, up to a maximum
tolerated difference.
To allow the hysteresis code to work correctly on higher refresh
monitors, the number of typical physics steps is not only recorded and
kept consistent for single render frames, but for groups of them.
Currently, up to 12 frames are grouped that way.
The engine parameter physics_jitter_fix controls both the maximum
tolerated difference between wall clock time and summed up _process
arguments and the threshold for changing typical_physics_steps. It is
given in units of the real physics frame slice 1/physics_fps. Set
physics_jitter_fix to 0 to disable the effects of the new code here.
It starts to be effective against the random physics jitter at around
0.02 to 0.05. at values greater than 1 it starts having ill effects on
the engine's ability to react sensibly to dropped frames and framerate
changes.
2018-02-11 00:03:31 +01:00
|
|
|
physics_jitter_fix = p_threshold;
|
|
|
|
}
|
|
|
|
|
2021-02-02 03:16:37 +01:00
|
|
|
double Engine::get_physics_jitter_fix() const {
|
Add hysteresis to physics timestep count per frame
Add new class _TimerSync to manage timestep calculations.
The new class handles the decisions about simulation progression
previously handled by main::iteration(). It is fed the current timer
ticks and determines how many physics updates are to be run and what
the delta argument to the _process() functions should be.
The new class tries to keep the number of physics updates per frame as
constant as possible from frame to frame. Ideally, it would be N steps
every render frame, but even with perfectly regular rendering, the
general case is that N or N+1 steps are required per frame, for some
fixed N. The best guess for N is stored in typical_physics_steps.
When determining the number of steps to take, no restrictions are
imposed between the choice of typical_physics_steps and
typical_physics_steps+1 steps. Should more or less steps than that be
required, the accumulated remaining time (as before, stored in
time_accum) needs to surpass its boundaries by some minimal threshold.
Once surpassed, typical_physics_steps is updated to allow the new step
count for future updates.
Care is taken that the modified calculation of the number of physics
steps is not observable from game code that only checks the delta
parameters to the _process and _physics_process functions; in addition
to modifying the number of steps, the _process argument is modified as
well to stay in expected bounds. Extra care is taken that the accumulated
steps still sum up to roughly the real elapsed time, up to a maximum
tolerated difference.
To allow the hysteresis code to work correctly on higher refresh
monitors, the number of typical physics steps is not only recorded and
kept consistent for single render frames, but for groups of them.
Currently, up to 12 frames are grouped that way.
The engine parameter physics_jitter_fix controls both the maximum
tolerated difference between wall clock time and summed up _process
arguments and the threshold for changing typical_physics_steps. It is
given in units of the real physics frame slice 1/physics_fps. Set
physics_jitter_fix to 0 to disable the effects of the new code here.
It starts to be effective against the random physics jitter at around
0.02 to 0.05. at values greater than 1 it starts having ill effects on
the engine's ability to react sensibly to dropped frames and framerate
changes.
2018-02-11 00:03:31 +01:00
|
|
|
return physics_jitter_fix;
|
|
|
|
}
|
|
|
|
|
2022-09-22 22:15:07 +02:00
|
|
|
void Engine::set_max_fps(int p_fps) {
|
|
|
|
_max_fps = p_fps > 0 ? p_fps : 0;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
|
|
|
|
2022-09-22 22:15:07 +02:00
|
|
|
int Engine::get_max_fps() const {
|
|
|
|
return _max_fps;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
uint64_t Engine::get_frames_drawn() {
|
|
|
|
return frames_drawn;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Engine::set_frame_delay(uint32_t p_msec) {
|
2017-03-05 16:44:50 +01:00
|
|
|
_frame_delay = p_msec;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
uint32_t Engine::get_frame_delay() const {
|
|
|
|
return _frame_delay;
|
|
|
|
}
|
|
|
|
|
2021-02-02 03:16:37 +01:00
|
|
|
void Engine::set_time_scale(double p_scale) {
|
2017-03-05 16:44:50 +01:00
|
|
|
_time_scale = p_scale;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
|
|
|
|
2021-02-02 03:16:37 +01:00
|
|
|
double Engine::get_time_scale() const {
|
2017-01-13 16:51:14 +01:00
|
|
|
return _time_scale;
|
|
|
|
}
|
|
|
|
|
2017-01-13 18:25:43 +01:00
|
|
|
Dictionary Engine::get_version_info() const {
|
|
|
|
Dictionary dict;
|
|
|
|
dict["major"] = VERSION_MAJOR;
|
|
|
|
dict["minor"] = VERSION_MINOR;
|
|
|
|
dict["patch"] = VERSION_PATCH;
|
2019-02-17 13:38:52 +01:00
|
|
|
dict["hex"] = VERSION_HEX;
|
2017-11-19 21:18:01 +01:00
|
|
|
dict["status"] = VERSION_STATUS;
|
2017-11-19 21:26:05 +01:00
|
|
|
dict["build"] = VERSION_BUILD;
|
2017-01-13 18:25:43 +01:00
|
|
|
dict["year"] = VERSION_YEAR;
|
2017-01-13 16:51:14 +01:00
|
|
|
|
2022-02-08 20:50:37 +01:00
|
|
|
String hash = String(VERSION_HASH);
|
|
|
|
dict["hash"] = hash.is_empty() ? String("unknown") : hash;
|
2017-07-10 10:47:38 +02:00
|
|
|
|
2017-01-13 18:25:43 +01:00
|
|
|
String stringver = String(dict["major"]) + "." + String(dict["minor"]);
|
2020-05-14 16:41:43 +02:00
|
|
|
if ((int)dict["patch"] != 0) {
|
2017-01-13 18:25:43 +01:00
|
|
|
stringver += "." + String(dict["patch"]);
|
2020-05-14 16:41:43 +02:00
|
|
|
}
|
2017-11-19 21:26:05 +01:00
|
|
|
stringver += "-" + String(dict["status"]) + " (" + String(dict["build"]) + ")";
|
2017-01-13 18:25:43 +01:00
|
|
|
dict["string"] = stringver;
|
2017-01-13 16:51:14 +01:00
|
|
|
|
2017-01-13 18:25:43 +01:00
|
|
|
return dict;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
|
|
|
|
2018-05-16 06:54:22 +02:00
|
|
|
static Array array_from_info(const char *const *info_list) {
|
|
|
|
Array arr;
|
2020-04-02 01:20:12 +02:00
|
|
|
for (int i = 0; info_list[i] != nullptr; i++) {
|
2021-10-13 17:42:41 +02:00
|
|
|
arr.push_back(String::utf8(info_list[i]));
|
2018-05-16 06:54:22 +02:00
|
|
|
}
|
|
|
|
return arr;
|
|
|
|
}
|
|
|
|
|
|
|
|
static Array array_from_info_count(const char *const *info_list, int info_count) {
|
|
|
|
Array arr;
|
|
|
|
for (int i = 0; i < info_count; i++) {
|
2021-10-13 17:42:41 +02:00
|
|
|
arr.push_back(String::utf8(info_list[i]));
|
2018-05-16 06:54:22 +02:00
|
|
|
}
|
|
|
|
return arr;
|
|
|
|
}
|
|
|
|
|
|
|
|
Dictionary Engine::get_author_info() const {
|
|
|
|
Dictionary dict;
|
|
|
|
|
|
|
|
dict["lead_developers"] = array_from_info(AUTHORS_LEAD_DEVELOPERS);
|
|
|
|
dict["project_managers"] = array_from_info(AUTHORS_PROJECT_MANAGERS);
|
|
|
|
dict["founders"] = array_from_info(AUTHORS_FOUNDERS);
|
|
|
|
dict["developers"] = array_from_info(AUTHORS_DEVELOPERS);
|
|
|
|
|
|
|
|
return dict;
|
|
|
|
}
|
|
|
|
|
2022-08-05 03:41:48 +02:00
|
|
|
TypedArray<Dictionary> Engine::get_copyright_info() const {
|
|
|
|
TypedArray<Dictionary> components;
|
2018-05-16 06:54:22 +02:00
|
|
|
for (int component_index = 0; component_index < COPYRIGHT_INFO_COUNT; component_index++) {
|
|
|
|
const ComponentCopyright &cp_info = COPYRIGHT_INFO[component_index];
|
|
|
|
Dictionary component_dict;
|
2021-10-13 17:42:41 +02:00
|
|
|
component_dict["name"] = String::utf8(cp_info.name);
|
2018-05-16 06:54:22 +02:00
|
|
|
Array parts;
|
|
|
|
for (int i = 0; i < cp_info.part_count; i++) {
|
|
|
|
const ComponentCopyrightPart &cp_part = cp_info.parts[i];
|
|
|
|
Dictionary part_dict;
|
|
|
|
part_dict["files"] = array_from_info_count(cp_part.files, cp_part.file_count);
|
|
|
|
part_dict["copyright"] = array_from_info_count(cp_part.copyright_statements, cp_part.copyright_count);
|
2021-10-13 17:42:41 +02:00
|
|
|
part_dict["license"] = String::utf8(cp_part.license);
|
2018-05-16 06:54:22 +02:00
|
|
|
parts.push_back(part_dict);
|
|
|
|
}
|
|
|
|
component_dict["parts"] = parts;
|
|
|
|
|
|
|
|
components.push_back(component_dict);
|
|
|
|
}
|
|
|
|
return components;
|
|
|
|
}
|
|
|
|
|
|
|
|
Dictionary Engine::get_donor_info() const {
|
|
|
|
Dictionary donors;
|
2020-08-13 23:54:30 +02:00
|
|
|
donors["platinum_sponsors"] = array_from_info(DONORS_SPONSOR_PLATINUM);
|
2018-05-16 06:54:22 +02:00
|
|
|
donors["gold_sponsors"] = array_from_info(DONORS_SPONSOR_GOLD);
|
2020-08-13 23:54:30 +02:00
|
|
|
donors["silver_sponsors"] = array_from_info(DONORS_SPONSOR_SILVER);
|
|
|
|
donors["bronze_sponsors"] = array_from_info(DONORS_SPONSOR_BRONZE);
|
2018-05-16 06:54:22 +02:00
|
|
|
donors["mini_sponsors"] = array_from_info(DONORS_SPONSOR_MINI);
|
|
|
|
donors["gold_donors"] = array_from_info(DONORS_GOLD);
|
|
|
|
donors["silver_donors"] = array_from_info(DONORS_SILVER);
|
|
|
|
donors["bronze_donors"] = array_from_info(DONORS_BRONZE);
|
|
|
|
return donors;
|
|
|
|
}
|
|
|
|
|
|
|
|
Dictionary Engine::get_license_info() const {
|
|
|
|
Dictionary licenses;
|
|
|
|
for (int i = 0; i < LICENSE_COUNT; i++) {
|
|
|
|
licenses[LICENSE_NAMES[i]] = LICENSE_BODIES[i];
|
|
|
|
}
|
|
|
|
return licenses;
|
|
|
|
}
|
|
|
|
|
|
|
|
String Engine::get_license_text() const {
|
|
|
|
return String(GODOT_LICENSE_TEXT);
|
|
|
|
}
|
|
|
|
|
2022-07-20 19:05:49 +02:00
|
|
|
String Engine::get_architecture_name() const {
|
|
|
|
#if defined(__x86_64) || defined(__x86_64__) || defined(__amd64__) || defined(_M_X64)
|
|
|
|
return "x86_64";
|
|
|
|
|
|
|
|
#elif defined(__i386) || defined(__i386__) || defined(_M_IX86)
|
|
|
|
return "x86_32";
|
|
|
|
|
2022-08-26 11:55:23 +02:00
|
|
|
#elif defined(__aarch64__) || defined(_M_ARM64) || defined(_M_ARM64EC)
|
2022-07-20 19:05:49 +02:00
|
|
|
return "arm64";
|
|
|
|
|
2022-09-03 13:36:40 +02:00
|
|
|
#elif defined(__arm__) || defined(_M_ARM)
|
2022-08-26 11:55:23 +02:00
|
|
|
return "arm32";
|
2022-07-20 19:05:49 +02:00
|
|
|
|
|
|
|
#elif defined(__riscv)
|
|
|
|
#if __riscv_xlen == 8
|
|
|
|
return "rv64";
|
|
|
|
#else
|
|
|
|
return "riscv";
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#elif defined(__powerpc__)
|
|
|
|
#if defined(__powerpc64__)
|
|
|
|
return "ppc64";
|
|
|
|
#else
|
|
|
|
return "ppc";
|
|
|
|
#endif
|
|
|
|
|
|
|
|
#elif defined(__wasm__)
|
|
|
|
#if defined(__wasm64__)
|
|
|
|
return "wasm64";
|
|
|
|
#elif defined(__wasm32__)
|
|
|
|
return "wasm32";
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
}
|
|
|
|
|
2020-10-27 16:00:15 +01:00
|
|
|
bool Engine::is_abort_on_gpu_errors_enabled() const {
|
|
|
|
return abort_on_gpu_errors;
|
|
|
|
}
|
|
|
|
|
2021-11-15 13:55:41 +01:00
|
|
|
int32_t Engine::get_gpu_index() const {
|
|
|
|
return gpu_idx;
|
|
|
|
}
|
|
|
|
|
2020-10-27 16:00:15 +01:00
|
|
|
bool Engine::is_validation_layers_enabled() const {
|
|
|
|
return use_validation_layers;
|
|
|
|
}
|
|
|
|
|
2021-05-01 23:09:48 +02:00
|
|
|
void Engine::set_print_error_messages(bool p_enabled) {
|
2022-05-20 14:28:44 +02:00
|
|
|
CoreGlobals::print_error_enabled = p_enabled;
|
2021-05-01 23:09:48 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
bool Engine::is_printing_error_messages() const {
|
2022-05-20 14:28:44 +02:00
|
|
|
return CoreGlobals::print_error_enabled;
|
2021-05-01 23:09:48 +02:00
|
|
|
}
|
|
|
|
|
2017-11-13 21:46:57 +01:00
|
|
|
void Engine::add_singleton(const Singleton &p_singleton) {
|
2021-08-25 00:03:10 +02:00
|
|
|
ERR_FAIL_COND_MSG(singleton_ptrs.has(p_singleton.name), "Can't register singleton that already exists: " + String(p_singleton.name));
|
2017-11-13 21:46:57 +01:00
|
|
|
singletons.push_back(p_singleton);
|
|
|
|
singleton_ptrs[p_singleton.name] = p_singleton.ptr;
|
|
|
|
}
|
|
|
|
|
2021-08-25 00:03:10 +02:00
|
|
|
Object *Engine::get_singleton_object(const StringName &p_name) const {
|
2022-05-13 15:04:37 +02:00
|
|
|
HashMap<StringName, Object *>::ConstIterator E = singleton_ptrs.find(p_name);
|
2021-08-25 00:03:10 +02:00
|
|
|
ERR_FAIL_COND_V_MSG(!E, nullptr, "Failed to retrieve non-existent singleton '" + String(p_name) + "'.");
|
2022-05-13 15:04:37 +02:00
|
|
|
return E->value;
|
2020-05-19 15:46:49 +02:00
|
|
|
}
|
2017-11-13 21:46:57 +01:00
|
|
|
|
2021-08-25 00:03:10 +02:00
|
|
|
bool Engine::is_singleton_user_created(const StringName &p_name) const {
|
|
|
|
ERR_FAIL_COND_V(!singleton_ptrs.has(p_name), false);
|
|
|
|
|
|
|
|
for (const Singleton &E : singletons) {
|
|
|
|
if (E.name == p_name && E.user_created) {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
void Engine::remove_singleton(const StringName &p_name) {
|
|
|
|
ERR_FAIL_COND(!singleton_ptrs.has(p_name));
|
|
|
|
|
|
|
|
for (List<Singleton>::Element *E = singletons.front(); E; E = E->next()) {
|
|
|
|
if (E->get().name == p_name) {
|
|
|
|
singletons.erase(E);
|
|
|
|
singleton_ptrs.erase(p_name);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
bool Engine::has_singleton(const StringName &p_name) const {
|
2017-11-14 14:52:24 +01:00
|
|
|
return singleton_ptrs.has(p_name);
|
2020-05-19 15:46:49 +02:00
|
|
|
}
|
2017-11-13 21:46:57 +01:00
|
|
|
|
|
|
|
void Engine::get_singletons(List<Singleton> *p_singletons) {
|
2021-07-24 15:46:25 +02:00
|
|
|
for (const Singleton &E : singletons) {
|
2021-07-16 05:45:57 +02:00
|
|
|
p_singletons->push_back(E);
|
2020-05-14 16:41:43 +02:00
|
|
|
}
|
2017-11-13 21:46:57 +01:00
|
|
|
}
|
|
|
|
|
2022-06-26 01:38:20 +02:00
|
|
|
String Engine::get_write_movie_path() const {
|
|
|
|
return write_movie_path;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Engine::set_write_movie_path(const String &p_path) {
|
|
|
|
write_movie_path = p_path;
|
|
|
|
}
|
|
|
|
|
2021-05-25 02:25:11 +02:00
|
|
|
void Engine::set_shader_cache_path(const String &p_path) {
|
|
|
|
shader_cache_path = p_path;
|
|
|
|
}
|
|
|
|
String Engine::get_shader_cache_path() const {
|
|
|
|
return shader_cache_path;
|
|
|
|
}
|
|
|
|
|
2020-04-02 01:20:12 +02:00
|
|
|
Engine *Engine::singleton = nullptr;
|
2017-01-13 16:51:14 +01:00
|
|
|
|
|
|
|
Engine *Engine::get_singleton() {
|
|
|
|
return singleton;
|
|
|
|
}
|
|
|
|
|
2020-05-12 17:01:17 +02:00
|
|
|
Engine::Engine() {
|
2017-03-05 16:44:50 +01:00
|
|
|
singleton = this;
|
2017-01-13 16:51:14 +01:00
|
|
|
}
|
2020-11-19 11:46:05 +01:00
|
|
|
|
2022-08-19 14:21:43 +02:00
|
|
|
void Engine::startup_begin() {
|
|
|
|
startup_benchmark_total_from = OS::get_singleton()->get_ticks_usec();
|
|
|
|
}
|
|
|
|
|
|
|
|
void Engine::startup_benchmark_begin_measure(const String &p_what) {
|
|
|
|
startup_benchmark_section = p_what;
|
|
|
|
startup_benchmark_from = OS::get_singleton()->get_ticks_usec();
|
|
|
|
}
|
|
|
|
void Engine::startup_benchmark_end_measure() {
|
|
|
|
uint64_t total = OS::get_singleton()->get_ticks_usec() - startup_benchmark_from;
|
|
|
|
double total_f = double(total) / double(1000000);
|
|
|
|
|
|
|
|
startup_benchmark_json[startup_benchmark_section] = total_f;
|
|
|
|
}
|
|
|
|
|
|
|
|
void Engine::startup_dump(const String &p_to_file) {
|
|
|
|
uint64_t total = OS::get_singleton()->get_ticks_usec() - startup_benchmark_total_from;
|
|
|
|
double total_f = double(total) / double(1000000);
|
|
|
|
startup_benchmark_json["total_time"] = total_f;
|
|
|
|
|
|
|
|
if (!p_to_file.is_empty()) {
|
|
|
|
Ref<FileAccess> f = FileAccess::open(p_to_file, FileAccess::WRITE);
|
|
|
|
if (f.is_valid()) {
|
|
|
|
Ref<JSON> json;
|
|
|
|
json.instantiate();
|
|
|
|
f->store_string(json->stringify(startup_benchmark_json, "\t", false, true));
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
List<Variant> keys;
|
|
|
|
startup_benchmark_json.get_key_list(&keys);
|
|
|
|
print_line("STARTUP BENCHMARK:");
|
|
|
|
for (const Variant &K : keys) {
|
|
|
|
print_line("\t-", K, ": ", startup_benchmark_json[K], +" sec.");
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-06-19 17:58:49 +02:00
|
|
|
Engine::Singleton::Singleton(const StringName &p_name, Object *p_ptr, const StringName &p_class_name) :
|
2020-11-19 11:46:05 +01:00
|
|
|
name(p_name),
|
2021-06-19 17:58:49 +02:00
|
|
|
ptr(p_ptr),
|
|
|
|
class_name(p_class_name) {
|
2020-11-19 11:46:05 +01:00
|
|
|
#ifdef DEBUG_ENABLED
|
2021-06-04 18:03:15 +02:00
|
|
|
RefCounted *rc = Object::cast_to<RefCounted>(p_ptr);
|
|
|
|
if (rc && !rc->is_referenced()) {
|
|
|
|
WARN_PRINT("You must use Ref<> to ensure the lifetime of a RefCounted object intended to be used as a singleton.");
|
2020-11-19 11:46:05 +01:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
}
|