| 1 | /**************************************************************************/ |
| 2 | /* callable_method_pointer.cpp */ |
| 3 | /**************************************************************************/ |
| 4 | /* This file is part of: */ |
| 5 | /* GODOT ENGINE */ |
| 6 | /* https://godotengine.org */ |
| 7 | /**************************************************************************/ |
| 8 | /* Copyright (c) 2014-present Godot Engine contributors (see AUTHORS.md). */ |
| 9 | /* Copyright (c) 2007-2014 Juan Linietsky, Ariel Manzur. */ |
| 10 | /* */ |
| 11 | /* Permission is hereby granted, free of charge, to any person obtaining */ |
| 12 | /* a copy of this software and associated documentation files (the */ |
| 13 | /* "Software"), to deal in the Software without restriction, including */ |
| 14 | /* without limitation the rights to use, copy, modify, merge, publish, */ |
| 15 | /* distribute, sublicense, and/or sell copies of the Software, and to */ |
| 16 | /* permit persons to whom the Software is furnished to do so, subject to */ |
| 17 | /* the following conditions: */ |
| 18 | /* */ |
| 19 | /* The above copyright notice and this permission notice shall be */ |
| 20 | /* included in all copies or substantial portions of the Software. */ |
| 21 | /* */ |
| 22 | /* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */ |
| 23 | /* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */ |
| 24 | /* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. */ |
| 25 | /* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */ |
| 26 | /* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */ |
| 27 | /* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */ |
| 28 | /* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ |
| 29 | /**************************************************************************/ |
| 30 | |
| 31 | #include "callable_method_pointer.h" |
| 32 | |
| 33 | bool CallableCustomMethodPointerBase::compare_equal(const CallableCustom *p_a, const CallableCustom *p_b) { |
| 34 | const CallableCustomMethodPointerBase *a = static_cast<const CallableCustomMethodPointerBase *>(p_a); |
| 35 | const CallableCustomMethodPointerBase *b = static_cast<const CallableCustomMethodPointerBase *>(p_b); |
| 36 | |
| 37 | if (a->comp_size != b->comp_size) { |
| 38 | return false; |
| 39 | } |
| 40 | |
| 41 | // Avoid sorting by memory address proximity, which leads to unpredictable performance over time |
| 42 | // due to the reuse of old addresses for newer objects. Use byte-wise comparison to leverage the |
| 43 | // backwards encoding of little-endian systems as a way to decouple spatiality and time. |
| 44 | return memcmp(a->comp_ptr, b->comp_ptr, a->comp_size * 4) == 0; |
| 45 | } |
| 46 | |
| 47 | bool CallableCustomMethodPointerBase::compare_less(const CallableCustom *p_a, const CallableCustom *p_b) { |
| 48 | const CallableCustomMethodPointerBase *a = static_cast<const CallableCustomMethodPointerBase *>(p_a); |
| 49 | const CallableCustomMethodPointerBase *b = static_cast<const CallableCustomMethodPointerBase *>(p_b); |
| 50 | |
| 51 | if (a->comp_size != b->comp_size) { |
| 52 | return a->comp_size < b->comp_size; |
| 53 | } |
| 54 | |
| 55 | // See note in compare_equal(). |
| 56 | return memcmp(a->comp_ptr, b->comp_ptr, a->comp_size * 4) < 0; |
| 57 | } |
| 58 | |
| 59 | CallableCustom::CompareEqualFunc CallableCustomMethodPointerBase::get_compare_equal_func() const { |
| 60 | return compare_equal; |
| 61 | } |
| 62 | |
| 63 | CallableCustom::CompareLessFunc CallableCustomMethodPointerBase::get_compare_less_func() const { |
| 64 | return compare_less; |
| 65 | } |
| 66 | |
| 67 | uint32_t CallableCustomMethodPointerBase::hash() const { |
| 68 | return h; |
| 69 | } |
| 70 | |
| 71 | void CallableCustomMethodPointerBase::_setup(uint32_t *p_base_ptr, uint32_t p_ptr_size) { |
| 72 | comp_ptr = p_base_ptr; |
| 73 | comp_size = p_ptr_size / 4; |
| 74 | |
| 75 | // Precompute hash. |
| 76 | for (uint32_t i = 0; i < comp_size; i++) { |
| 77 | if (i == 0) { |
| 78 | h = hash_murmur3_one_32(comp_ptr[i]); |
| 79 | } else { |
| 80 | h = hash_murmur3_one_32(comp_ptr[i], h); |
| 81 | } |
| 82 | } |
| 83 | } |
| 84 | |