Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

[d2vins_node-1] Segmentation fault (Address not mapped to object [0x7ffe67c8aff8]) #30

Open
DavidNY123 opened this issue Jan 13, 2024 · 1 comment
Open

[d2vins_node-1] Segmentation fault (Address not mapped to object [0x7ffe67c8aff8]) #30

DavidNY123 opened this issue Jan 13, 2024 · 1 comment

Comments

@DavidNY123
Copy link

DavidNY123 commented Jan 13, 2024 •
edited
Loading

Hey, I meet an error:

[d2vins_node-1] Stack trace (most recent call last):
[d2vins_node-1] 31 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 30 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 29 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 28 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 27 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 26 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 25 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 24 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 23 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 22 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 21 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 20 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 19 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 18 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 17 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 16 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 15 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 14 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 13 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 12 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 11 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 10 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 9 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 8 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 7 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 6 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 5 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 4 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 3 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 2 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 1 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 32, in searchClosest [0x7f89ab2fe6fb]
[d2vins_node-1] 29: return i0;
[d2vins_node-1] 30: }
[d2vins_node-1] 31: if (buf[i].t > t - eps) {
[d2vins_node-1] > 32: return searchClosest(t, i0, i);
[d2vins_node-1] 33: } else {
[d2vins_node-1] 34: return searchClosest(t, i, i1);
[d2vins_node-1] 35: }
[d2vins_node-1] 0 Source "/root/D2SLAM/src/D2SLAM/d2common/src/d2imu.cpp", line 20, in searchClosest [0x7f89ab2fe651]
[d2vins_node-1] 17: return searchClosest(t, 0, buf.size());
[d2vins_node-1] 18: }
[d2vins_node-1] 19:
[d2vins_node-1] > 20: size_t IMUBuffer::searchClosest(double t, int i0, int i1) const {
[d2vins_node-1] 21: const double eps = 5e-4;
[d2vins_node-1] 22: const Guard lock(buf_lock);
[d2vins_node-1] 23: // printf("IMUBuffer::searchClosest: t=%f, i0=%d, i1=%d\n", t, i0, i1);
[d2vins_node-1] Segmentation fault (Address not mapped to object [0x7ffe67c8aff8])

** it seems to occur randomly on the TUM dataset.**
@DavidNY123 DavidNY123 mentioned this issue Jan 16, 2024
Open
@xuhao1
Copy link
Collaborator

xuhao1 commented Jan 16, 2024

Please take a trial on the develop branch

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
2 participants
@xuhao1 @DavidNY123