d973355b3a
Using ClangBuildAnalyzer on the whole Blender build, it was pointing out that BLI_math.h is the heaviest "header hub" (i.e. non tiny file that is included a lot). However, there's very little (actually zero) source files in Blender that need "all the math" (base, colors, vectors, matrices, quaternions, intersection, interpolation, statistics, solvers and time). A common use case is source files needing just vectors, or just vectors & matrices, or just colors etc. Actually, 181 files were including the whole math thing without needing it at all. This change removes BLI_math.h completely, and instead in all the places that need it, includes BLI_math_vector.h or BLI_math_color.h and so on. Change from that: - BLI_math_color.h was included 1399 times -> now 408 (took 114.0sec to parse -> now 36.3sec) - BLI_simd.h 1403 -> 418 (109.7sec -> 34.9sec). Full rebuild of Blender (Apple M1, Xcode, RelWithDebInfo) is not affected much (342sec -> 334sec). Most of benefit would be when someone's changing BLI_simd.h or BLI_math_color.h or similar files, that now there's 3x fewer files result in a recompile. Pull Request #110944
90 lines
2.3 KiB
C
90 lines
2.3 KiB
C
/* SPDX-FileCopyrightText: 2001-2002 NaN Holding BV. All rights reserved.
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*/
|
|
|
|
#include "DNA_vec_types.h"
|
|
|
|
#include "BLI_math_base.h"
|
|
#include "BLI_math_geom.h"
|
|
#include "BLI_strict_flags.h"
|
|
|
|
#include "BLI_lasso_2d.h" /* own include */
|
|
|
|
void BLI_lasso_boundbox(rcti *rect, const int mcoords[][2], const uint mcoords_len)
|
|
{
|
|
uint a;
|
|
|
|
rect->xmin = rect->xmax = mcoords[0][0];
|
|
rect->ymin = rect->ymax = mcoords[0][1];
|
|
|
|
for (a = 1; a < mcoords_len; a++) {
|
|
if (mcoords[a][0] < rect->xmin) {
|
|
rect->xmin = mcoords[a][0];
|
|
}
|
|
else if (mcoords[a][0] > rect->xmax) {
|
|
rect->xmax = mcoords[a][0];
|
|
}
|
|
if (mcoords[a][1] < rect->ymin) {
|
|
rect->ymin = mcoords[a][1];
|
|
}
|
|
else if (mcoords[a][1] > rect->ymax) {
|
|
rect->ymax = mcoords[a][1];
|
|
}
|
|
}
|
|
}
|
|
|
|
bool BLI_lasso_is_point_inside(const int mcoords[][2],
|
|
const uint mcoords_len,
|
|
const int sx,
|
|
const int sy,
|
|
const int error_value)
|
|
{
|
|
if (sx == error_value || mcoords_len == 0) {
|
|
return false;
|
|
}
|
|
|
|
const int pt[2] = {sx, sy};
|
|
return isect_point_poly_v2_int(pt, mcoords, mcoords_len, true);
|
|
}
|
|
|
|
bool BLI_lasso_is_edge_inside(const int mcoords[][2],
|
|
const uint mcoords_len,
|
|
int x0,
|
|
int y0,
|
|
int x1,
|
|
int y1,
|
|
const int error_value)
|
|
{
|
|
|
|
if (x0 == error_value || x1 == error_value || mcoords_len == 0) {
|
|
return false;
|
|
}
|
|
|
|
const int v1[2] = {x0, y0}, v2[2] = {x1, y1};
|
|
|
|
/* check points in lasso */
|
|
if (BLI_lasso_is_point_inside(mcoords, mcoords_len, v1[0], v1[1], error_value)) {
|
|
return true;
|
|
}
|
|
if (BLI_lasso_is_point_inside(mcoords, mcoords_len, v2[0], v2[1], error_value)) {
|
|
return true;
|
|
}
|
|
|
|
/* no points in lasso, so we have to intersect with lasso edge */
|
|
|
|
if (isect_seg_seg_v2_int(mcoords[0], mcoords[mcoords_len - 1], v1, v2) > 0) {
|
|
return true;
|
|
}
|
|
for (uint a = 0; a < mcoords_len - 1; a++) {
|
|
if (isect_seg_seg_v2_int(mcoords[a], mcoords[a + 1], v1, v2) > 0) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|