diff options
| author | Rémi Verschelde <rverschelde@gmail.com> | 2019-07-20 12:00:13 +0200 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2019-07-20 12:00:13 +0200 |
| commit | d15cf7b672ac9911b4e82fed52b4c5e8d4312b0d (patch) | |
| tree | 68ab08fafd7e14710ce245a47f3bb518ebf03307 /core/math/bsp_tree.cpp | |
| parent | 700938bff772924941c4e1ea61bbfd2abe34d8d2 (diff) | |
| parent | 6cbaf7662f5ee3ca1d02c0ebc85854fceee057af (diff) | |
| download | redot-engine-d15cf7b672ac9911b4e82fed52b4c5e8d4312b0d.tar.gz | |
Merge pull request #30576 from qarmin/lgtm_coverage
Changed some code reported by LGTM and Coverity
Diffstat (limited to 'core/math/bsp_tree.cpp')
| -rw-r--r-- | core/math/bsp_tree.cpp | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/core/math/bsp_tree.cpp b/core/math/bsp_tree.cpp index a12f9fee2e..cfa698282e 100644 --- a/core/math/bsp_tree.cpp +++ b/core/math/bsp_tree.cpp @@ -192,7 +192,7 @@ int BSP_Tree::get_points_inside(const Vector3 *p_points, int p_point_count) cons #ifdef DEBUG_ENABLED int plane_count = planes.size(); uint16_t plane = nodesptr[idx].plane; - ERR_FAIL_INDEX_V(plane, plane_count, false); + ERR_FAIL_UNSIGNED_INDEX_V(plane, plane_count, false); #endif idx = planesptr[nodesptr[idx].plane].is_point_over(point) ? nodes[idx].over : nodes[idx].under; @@ -258,7 +258,7 @@ bool BSP_Tree::point_is_inside(const Vector3 &p_point) const { #ifdef DEBUG_ENABLED int plane_count = planes.size(); uint16_t plane = nodesptr[idx].plane; - ERR_FAIL_INDEX_V(plane, plane_count, false); + ERR_FAIL_UNSIGNED_INDEX_V(plane, plane_count, false); #endif bool over = planesptr[nodesptr[idx].plane].is_point_over(p_point); |