Skip to content

GitLab

Commit 54f0bf4c authored by limm's avatar limm
Browse files

fix compilation optimization bugs

parent 321b42b8
Hide whitespace changes
Inline Side-by-side
Showing with 2 additions and 2 deletions
mmcv/ops/csrc/common/cuda/convex_iou_cuda_kernel.cuh
View file @ 54f0bf4c
...@@ -395,7 +395,7 @@ __device__ inline double intersectAreaO(Point* ps1, int n1, Point* ps2, int n2, ...@@ -395,7 +395,7 @@ __device__ inline double intersectAreaO(Point* ps1, int n1, Point* ps2, int n2,
return res; return res;
} }
__device__ inline void Jarvis(Point* in_poly, int& n_poly) { __attribute__((optnone)) __device__ inline void Jarvis(Point* in_poly, int& n_poly) {
Point p_max, p_k; Point p_max, p_k;
int max_index, k_index; int max_index, k_index;
int Stack[NMAX] = {}, top1, top2; int Stack[NMAX] = {}, top1, top2;
......
mmcv/ops/csrc/common/cuda/min_area_polygons_cuda.cuh
View file @ 54f0bf4c
...@@ -158,7 +158,7 @@ __device__ inline void minBoundingRect(Point *ps, int n_points, float *minbox) { ...@@ -158,7 +158,7 @@ __device__ inline void minBoundingRect(Point *ps, int n_points, float *minbox) {
} }
// convex_find // convex_find
__device__ inline void Jarvis(Point *in_poly, int &n_poly) { __attribute__((optnone)) __device__ inline void Jarvis(Point *in_poly, int &n_poly) {
int n_input = n_poly; int n_input = n_poly;
Point input_poly[20]; Point input_poly[20];
for (int i = 0; i < n_input; i++) { for (int i = 0; i < n_input; i++) {
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment