Blender V5.3
integer_math.h
Go to the documentation of this file.
1/* SPDX-FileCopyrightText: 2026 Blender Authors
2 *
3 * SPDX-License-Identifier: Apache-2.0 */
4
5#pragma once
6
8#include "kernel/svm/util.h"
9
11
12ccl_device int svm_integer_math_divide_floor(const int a, const int b)
13{
14 const int d = a / b;
15 const int r = a % b;
16 return (r != 0) ? (d - int((a < 0) != (b < 0))) : d;
17}
18
20{
21 a = abs(a);
22 b = abs(b);
23 while (b != 0) {
24 const int t = b;
25 b = a % b;
26 a = t;
27 }
28 return a;
29}
30
31ccl_device int svm_integer_math_power(int base, int exponent)
32{
33 if (exponent < 0) {
34 if (base == 1 || base == -1) {
35 return (base < 0 && (exponent & 1) != 0) ? -1 : 1;
36 }
37 return 0;
38 }
39 int result = 1;
40 while (exponent != 0) {
41 if ((exponent & 1) != 0) {
42 result *= base;
43 }
44 exponent >>= 1;
45 base *= base;
46 }
47 return result;
48}
49
51 const int a,
52 const int b,
53 const int c)
54{
55 switch (type) {
57 return a + b;
59 return a - b;
61 return a * b;
63 return (b != 0) ? (a / b) : 0;
65 return a * b + c;
67 return svm_integer_math_power(a, b);
69 return (b != 0) ? (((a % b) + b) % b) : 0;
71 return abs(a);
73 return min(a, b);
75 return max(a, b);
77 return svm_integer_math_gcd(a, b);
79 const int gcd = svm_integer_math_gcd(a, b);
80 return (gcd != 0) ? abs(a / gcd * b) : 0;
81 }
83 return -a;
85 return int(0 < a) - int(a < 0);
87 return (b != 0) ? svm_integer_math_divide_floor(a, b) : 0;
89 return (b != 0) ? -svm_integer_math_divide_floor(a, -b) : 0;
91 const int abs_b = abs(b);
92 const int sign_b = int(0 < b) - int(b < 0);
93 if (a >= 0) {
94 return ((abs_b != 0) ? ((2 * a + abs_b) / (2 * abs_b)) : 0) * sign_b;
95 }
96 return -((abs_b != 0) ? ((2 * -a + abs_b) / (2 * abs_b)) : 0) * sign_b;
97 }
99 return (b != 0) ? (a % b) : 0;
100 }
101
102 return 0;
103}
104
107{
108 const int a = stack_load(stack, node.value1);
109 const int b = stack_load(stack, node.value2);
110 const int c = stack_load(stack, node.value3);
111 const int result = svm_integer_math(node.math_type, a, b, c);
112
113 if (stack_valid(node.result_offset)) {
114 stack_store_int(stack, node.result_offset, result);
115 }
116}
117
btScalar max
ccl_device_inline void stack_store_int(ccl_private float *stack, const uint a, const int i)
ccl_device_inline bool stack_valid(const uint a)
ccl_device_inline T stack_load(const ccl_private float *stack, const uint a)
#define ccl_restrict
#define ccl_private
#define ccl_global
#define ccl_device_noinline
#define CCL_NAMESPACE_END
#define abs
ccl_device_noinline void svm_node_integer_math(ccl_private float *ccl_restrict stack, const ccl_global SVMNodeIntegerMath &ccl_restrict node)
ccl_device int svm_integer_math_gcd(int a, int b)
ccl_device int svm_integer_math(const NodeIntegerMathType type, const int a, const int b, const int c)
ccl_device int svm_integer_math_power(int base, int exponent)
CCL_NAMESPACE_BEGIN ccl_device int svm_integer_math_divide_floor(const int a, const int b)
NodeIntegerMathType
@ NODE_INTEGER_MATH_SIGN
@ NODE_INTEGER_MATH_ABSOLUTE
@ NODE_INTEGER_MATH_MODULO
@ NODE_INTEGER_MATH_POWER
@ NODE_INTEGER_MATH_MINIMUM
@ NODE_INTEGER_MATH_ADD
@ NODE_INTEGER_MATH_MULTIPLY_ADD
@ NODE_INTEGER_MATH_SUBTRACT
@ NODE_INTEGER_MATH_MULTIPLY
@ NODE_INTEGER_MATH_DIVIDE_FLOOR
@ NODE_INTEGER_MATH_DIVIDE_CEIL
@ NODE_INTEGER_MATH_NEGATE
@ NODE_INTEGER_MATH_MAXIMUM
@ NODE_INTEGER_MATH_GCD
@ NODE_INTEGER_MATH_LCM
@ NODE_INTEGER_MATH_FLOORED_MODULO
@ NODE_INTEGER_MATH_DIVIDE_ROUND
@ NODE_INTEGER_MATH_DIVIDE
#define ccl_device
#define min(a, b)
Definition sort.cc:38