32 const uint arr_stride_uint =
uint(arr_stride);
33 const uint arr_half_stride = (arr_len / 2) * arr_stride_uint;
35 char *arr =
static_cast<char *
>(arr_v);
38 for (i = 0, i_end = (arr_len - 1) * arr_stride_uint; i < arr_half_stride;
39 i += arr_stride_uint, i_end -= arr_stride_uint)
41 memcpy(buf, &arr[i], arr_stride);
42 memcpy(&arr[i], &arr[i_end], arr_stride);
43 memcpy(&arr[i_end], buf, arr_stride);
49 char *arr =
static_cast<char *
>(arr_v);
53 memcpy(buf, arr, arr_stride);
54 memmove(arr, arr + arr_stride, arr_stride * (arr_len - 1));
55 memcpy(arr + (arr_stride * (arr_len - 1)), buf, arr_stride);
58 memcpy(buf, arr + (arr_stride * (arr_len - 1)), arr_stride);
59 memmove(arr + arr_stride, arr, arr_stride * (arr_len - 1));
60 memcpy(arr, buf, arr_stride);
68 void *arr,
const uint arr_len,
const size_t arr_stride,
const uint *order,
void *arr_temp)
70 const size_t len = arr_len * arr_stride;
71 const uint arr_stride_uint =
uint(arr_stride);
75 if (arr_temp ==
nullptr) {
82 memcpy(arr_orig, arr,
len);
84 for (i = 0; i < arr_len; i++) {
91 if (arr_temp ==
nullptr) {
98 if (arr_len <= 1) [[unlikely]] {
102 const uint arr_stride_uint =
uint(arr_stride);
104 for (
uint i = 0; i < arr_len; i++) {
121 const char *arr_step =
static_cast<const char *
>(arr);
122 for (
uint i = 0; i < arr_len; i++, arr_step += arr_stride) {
123 if (memcmp(arr_step, p, arr_stride) == 0) {
132 const char *arr_step =
static_cast<const char *
>(arr) + (arr_stride * arr_len);
133 for (
uint i = arr_len; i-- != 0;) {
134 arr_step -= arr_stride;
135 if (memcmp(arr_step, p, arr_stride) == 0) {
143 void *arr,
const void *arr_a,
const void *arr_b,
uint arr_len,
size_t arr_stride)
145 char *dst =
static_cast<char *
>(arr);
146 const char *src_a =
static_cast<const char *
>(arr_a);
147 const char *src_b =
static_cast<const char *
>(arr_b);
149 size_t i = arr_stride * arr_len;
151 *(dst++) = *(src_a++) & *(src_b++);
156 void *arr,
const void *arr_a,
const void *arr_b,
uint arr_len,
size_t arr_stride)
158 char *dst =
static_cast<char *
>(arr);
159 const char *src_a =
static_cast<const char *
>(arr_a);
160 const char *src_b =
static_cast<const char *
>(arr_b);
162 size_t i = arr_stride * arr_len;
164 *(dst++) = *(src_a++) | *(src_b++);
172 bool use_delimit_bounds,
173 bool (*test_fn)(
const void *arr_item,
void *user_data),
181 if (use_wrap && (span_step[0] != arr_len) && (span_step[0] > span_step[1])) {
185 const uint arr_stride_uint =
uint(arr_stride);
186 const void *item_prev;
191 if ((span_step[0] == arr_len) && (span_step[1] == arr_len)) {
195 test_prev = test_fn(item_prev, user_data);
197 else if (use_delimit_bounds ==
false) {
200 test_prev = test_fn(item_prev, user_data);
208 else if ((i_curr = span_step[1] + 2) < arr_len) {
209 item_prev =
POINTER_OFFSET(arr, (span_step[1] + 1) * arr_stride_uint);
210 test_prev = test_fn(item_prev, user_data);
217 const void *item_curr =
POINTER_OFFSET(arr, i_curr * arr_stride_uint);
219 while (i_curr < arr_len) {
220 bool test_curr = test_fn(item_curr, user_data);
221 if ((test_prev ==
false) && (test_curr ==
true)) {
223 uint i_step_prev = i_curr;
226 uint i_step = i_curr + 1;
227 if (i_step == arr_len) [[unlikely]] {
230 while (test_fn(
POINTER_OFFSET(arr, i_step * arr_stride_uint), user_data)) {
231 i_step_prev = i_step;
233 if (i_step == arr_len) [[unlikely]] {
238 if (i_step_prev < i_curr) {
239 span_len = (i_step_prev + (arr_len - i_curr)) + 1;
242 span_len = (i_step_prev - i_curr) + 1;
246 uint i_step = i_curr + 1;
247 while ((i_step != arr_len) &&
248 test_fn(
POINTER_OFFSET(arr, i_step * arr_stride_uint), user_data))
250 i_step_prev = i_step;
254 span_len = (i_step_prev - i_curr) + 1;
256 if ((use_delimit_bounds ==
false) && (i_step_prev == arr_len - 1)) {
261 span_step[0] = i_curr;
262 span_step[1] = i_step_prev;
263 *r_span_len = span_len;
268 test_prev = test_curr;
270 item_prev = item_curr;
280 const char *arr_step =
static_cast<const char *
>(arr_v);
281 size_t i = arr_stride * arr_len;
291 const int arr_shape[2],
294 bool (*test_fn)(
const void *arr_item,
void *user_data),
297 BLI_assert(center[0] >= 0 && center[1] >= 0 && center[0] < arr_shape[0] &&
298 center[1] < arr_shape[1]);
300 const char *arr =
static_cast<const char *
>(arr_v);
301 const int stride[2] = {arr_shape[0] * int(elem_size), int(elem_size)};
304 int ofs[2] = {center[0] * stride[1], center[1] * stride[0]};
305 if (test_fn(arr + ofs[0] + ofs[1], user_data)) {
311 int steps_in, steps_out;
313 int x_minus = center[0];
314 int x_plus = arr_shape[0] - center[0] - 1;
315 int y_minus = center[1];
316 int y_plus = arr_shape[1] - center[1] - 1;
318 steps_in = 2 * std::min({x_minus, x_plus, y_minus, y_plus});
319 steps_out = 2 * std::max({x_minus, x_plus, y_minus, y_plus});
323 const int limits[2] = {(arr_shape[0] - 1) * stride[0], stride[0] - stride[1]};
326 while (steps < steps_out) {
333 bool check_bounds = steps > steps_in;
338 for (
int axis = 2; axis--;) {
339 int ofs_step = stride[axis];
344 int ofs_iter = ofs[axis] + ofs_step;
345 int ofs_dest = ofs[axis] + steps * ofs_step;
346 int ofs_other = ofs[!axis];
348 ofs[axis] = ofs_dest;
350 if (ofs_other < 0 || ofs_other > limits[!axis]) {
355 CLAMP(ofs_iter, 0, limits[axis]);
356 CLAMP(ofs_dest, 0, limits[axis]);
360 if (test_fn(arr + ofs_other + ofs_iter, user_data)) {
363 if (ofs_iter == ofs_dest) {
366 ofs_iter += ofs_step;
#define BLI_array_alloca(arr, realsize)
Generic array manipulation API.
Read Blender memory allocation and freeing.
#define BLI_assert_unreachable()
#define POINTER_OFFSET(v, ofs)
ccl_device_inline dual1 len(const ccl_private dual< T > &a)
void * MEM_new_uninitialized(size_t len, const char *str) ATTR_WARN_UNUSED_RESULT ATTR_ALLOC_SIZE(1) ATTR_NONNULL(2)
BLI_assert(slot->slot_subtype.map==BMO_OP_SLOT_SUBTYPE_MAP_FLT)
uint _bli_array_deduplicate_ordered(void *arr, uint arr_len, size_t arr_stride)
bool _bli_array_is_zeroed(const void *arr_v, uint arr_len, size_t arr_stride)
void _bli_array_wrap(void *arr_v, uint arr_len, size_t arr_stride, int dir)
void MEM_delete_void(void *vmemh)
void _bli_array_binary_and(void *arr, const void *arr_a, const void *arr_b, uint arr_len, size_t arr_stride)
void _bli_array_permute(void *arr, uint arr_len, size_t arr_stride, const uint *order, void *arr_temp)
bool _bli_array_iter_spiral_square(const void *arr_v, const int arr_shape[2], size_t elem_size, const int center[2], bool(*test_fn)(const void *arr_item, void *user_data), void *user_data)
void _bli_array_reverse(void *arr_v, uint arr_len, size_t arr_stride)
void _bli_array_binary_or(void *arr, const void *arr_a, const void *arr_b, uint arr_len, size_t arr_stride)
int _bli_array_findindex(const void *arr, uint arr_len, size_t arr_stride, const void *p)
int _bli_array_rfindindex(const void *arr, uint arr_len, size_t arr_stride, const void *p)
bool _bli_array_iter_span(const void *arr, uint arr_len, size_t arr_stride, bool use_wrap, bool use_delimit_bounds, bool(*test_fn)(const void *arr_item, void *user_data), void *user_data, uint span_step[2], uint *r_span_len)