Отказ от restrict функций для упрощения библиотеки. Компиляторы достаточно хорошо оптимизируют не-restrict inline-функции

This commit is contained in:
Andrey Pokidov 2026-03-30 12:05:25 +07:00
parent f402f68516
commit ed404690ed
17 changed files with 48 additions and 257 deletions

View file

@ -267,30 +267,6 @@ inline void bgc_fp64_vector3_multiply_by_dual_number(BGC_FP64_DualVector3* const
product->dual_part.z = dual_z;
}
// ====== Restrict Multiply by Dual Number ====== //
inline void _bgc_fp32_restrict_vector3_multiply_by_dual_number(BGC_FP32_DualVector3* restrict const product, const BGC_FP32_Vector3* const multiplicand, const BGC_FP32_DualNumber* const multiplier)
{
product->real_part.x = multiplicand->x * multiplier->real_part;
product->real_part.y = multiplicand->y * multiplier->real_part;
product->real_part.z = multiplicand->z * multiplier->real_part;
product->dual_part.x = multiplicand->x * multiplier->dual_part;
product->dual_part.y = multiplicand->y * multiplier->dual_part;
product->dual_part.z = multiplicand->z * multiplier->dual_part;
}
inline void _bgc_fp64_restrict_vector3_multiply_by_dual_number(BGC_FP64_DualVector3* restrict const product, const BGC_FP64_Vector3* const multiplicand, const BGC_FP64_DualNumber* const multiplier)
{
product->real_part.x = multiplicand->x * multiplier->real_part;
product->real_part.y = multiplicand->y * multiplier->real_part;
product->real_part.z = multiplicand->z * multiplier->real_part;
product->dual_part.x = multiplicand->x * multiplier->dual_part;
product->dual_part.y = multiplicand->y * multiplier->dual_part;
product->dual_part.z = multiplicand->z * multiplier->dual_part;
}
// ============ Left Vector Product ============= //
inline void bgc_fp32_vector3_multiply_by_matrix2x3(BGC_FP32_Vector2* const product, const BGC_FP32_Vector3* const vector, const BGC_FP32_Matrix2x3* const matrix)
@ -543,22 +519,6 @@ inline double bgc_fp64_vector3_get_triple_product(const BGC_FP64_Vector3* const
+ vector1->z * (vector2->x * vector3->y - vector2->y * vector3->x);
}
// =========== Restrict Cross Product =========== //
inline void _bgc_fp32_restrict_vector3_get_cross_product(BGC_FP32_Vector3* restrict const product, const BGC_FP32_Vector3* const vector1, const BGC_FP32_Vector3* const vector2)
{
product->x = vector1->y * vector2->z - vector1->z * vector2->y;
product->y = vector1->z * vector2->x - vector1->x * vector2->z;
product->z = vector1->x * vector2->y - vector1->y * vector2->x;
}
inline void _bgc_fp64_restrict_vector3_get_cross_product(BGC_FP64_Vector3* restrict const product, const BGC_FP64_Vector3* const vector1, const BGC_FP64_Vector3* const vector2)
{
product->x = vector1->y * vector2->z - vector1->z * vector2->y;
product->y = vector1->z * vector2->x - vector1->x * vector2->z;
product->z = vector1->x * vector2->y - vector1->y * vector2->x;
}
// =============== Cross Product ================ //
inline void bgc_fp32_vector3_get_cross_product(BGC_FP32_Vector3* const product, const BGC_FP32_Vector3* const vector1, const BGC_FP32_Vector3* const vector2)
@ -722,7 +682,7 @@ inline int bgc_fp32_vector3_are_parallel(const BGC_FP32_Vector3* const vector1,
BGC_FP32_Vector3 product;
_bgc_fp32_restrict_vector3_get_cross_product(&product, vector1, vector2);
bgc_fp32_vector3_get_cross_product(&product, vector1, vector2);
return bgc_fp32_vector3_get_squared_length(&product) <= BGC_FP32_SQUARE_EPSILON * square_modulus1 * square_modulus2;
}
@ -738,7 +698,7 @@ inline int bgc_fp64_vector3_are_parallel(const BGC_FP64_Vector3* const vector1,
BGC_FP64_Vector3 product;
_bgc_fp64_restrict_vector3_get_cross_product(&product, vector1, vector2);
bgc_fp64_vector3_get_cross_product(&product, vector1, vector2);
return bgc_fp64_vector3_get_squared_length(&product) <= BGC_FP64_SQUARE_EPSILON * square_modulus1 * square_modulus2;
}