mirror of
https://github.com/godotengine/godot.git
synced 2025-10-31 21:51:22 +00:00
0e29f7974b
This commit makes operator[] on Vector const and adds a write proxy to it. From now on writes to Vectors need to happen through the .write proxy. So for instance: Vector<int> vec; vec.push_back(10); std::cout << vec[0] << std::endl; vec.write[0] = 20; Failing to use the .write proxy will cause a compilation error. In addition COWable datatypes can now embed a CowData pointer to their data. This means that String, CharString, and VMap no longer use or derive from Vector. _ALWAYS_INLINE_ and _FORCE_INLINE_ are now equivalent for debug and non-debug builds. This is a lot faster for Vector in the editor and while running tests. The reason why this difference used to exist is because force-inlined methods used to give a bad debugging experience. After extensive testing with modern compilers this is no longer the case.
110 lines
3.9 KiB
C++
110 lines
3.9 KiB
C++
/*************************************************************************/
|
|
/* threaded_array_processor.h */
|
|
/*************************************************************************/
|
|
/* This file is part of: */
|
|
/* GODOT ENGINE */
|
|
/* https://godotengine.org */
|
|
/*************************************************************************/
|
|
/* Copyright (c) 2007-2018 Juan Linietsky, Ariel Manzur. */
|
|
/* Copyright (c) 2014-2018 Godot Engine contributors (cf. AUTHORS.md) */
|
|
/* */
|
|
/* 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 THREADED_ARRAY_PROCESSOR_H
|
|
#define THREADED_ARRAY_PROCESSOR_H
|
|
|
|
#include "os/mutex.h"
|
|
#include "os/os.h"
|
|
#include "os/thread.h"
|
|
#include "safe_refcount.h"
|
|
#include "thread_safe.h"
|
|
|
|
template <class C, class U>
|
|
struct ThreadArrayProcessData {
|
|
uint32_t elements;
|
|
uint32_t index;
|
|
C *instance;
|
|
U userdata;
|
|
void (C::*method)(uint32_t, U);
|
|
|
|
void process(uint32_t p_index) {
|
|
(instance->*method)(p_index, userdata);
|
|
}
|
|
};
|
|
|
|
#ifndef NO_THREADS
|
|
|
|
template <class T>
|
|
void process_array_thread(void *ud) {
|
|
|
|
T &data = *(T *)ud;
|
|
while (true) {
|
|
uint32_t index = atomic_increment(&data.index);
|
|
if (index >= data.elements)
|
|
break;
|
|
data.process(index);
|
|
}
|
|
}
|
|
|
|
template <class C, class M, class U>
|
|
void thread_process_array(uint32_t p_elements, C *p_instance, M p_method, U p_userdata) {
|
|
|
|
ThreadArrayProcessData<C, U> data;
|
|
data.method = p_method;
|
|
data.instance = p_instance;
|
|
data.userdata = p_userdata;
|
|
data.index = 0;
|
|
data.elements = p_elements;
|
|
data.process(data.index); //process first, let threads increment for next
|
|
|
|
Vector<Thread *> threads;
|
|
|
|
threads.resize(OS::get_singleton()->get_processor_count());
|
|
|
|
for (int i = 0; i < threads.size(); i++) {
|
|
threads.write[i] = Thread::create(process_array_thread<ThreadArrayProcessData<C, U> >, &data);
|
|
}
|
|
|
|
for (int i = 0; i < threads.size(); i++) {
|
|
Thread::wait_to_finish(threads[i]);
|
|
memdelete(threads[i]);
|
|
}
|
|
}
|
|
|
|
#else
|
|
|
|
template <class C, class M, class U>
|
|
void thread_process_array(uint32_t p_elements, C *p_instance, M p_method, U p_userdata) {
|
|
|
|
ThreadArrayProcessData<C, U> data;
|
|
data.method = p_method;
|
|
data.instance = p_instance;
|
|
data.userdata = p_userdata;
|
|
data.index = 0;
|
|
data.elements = p_elements;
|
|
for (uint32_t i = 0; i < p_elements; i++) {
|
|
data.process(i);
|
|
}
|
|
}
|
|
|
|
#endif
|
|
|
|
#endif // THREADED_ARRAY_PROCESSOR_H
|