Go to:
Gentoo Home
Documentation
Forums
Lists
Bugs
Planet
Store
Wiki
Get Gentoo!
Gentoo's Bugzilla – Attachment 690240 Details for
Bug 775056
dev-util/mdds-1.7.0 fails test "rtree_test" when compiled with clang
Home
|
New
–
[Ex]
|
Browse
|
Search
|
Privacy Policy
|
[?]
|
Reports
|
Requests
|
Help
|
New Account
|
Log In
[x]
|
Forgot Password
Login:
[x]
test-suite.log
test-suite.log (text/x-log), 10.57 KB, created by
Paolo Pedroni
on 2021-03-09 15:08:59 UTC
(
hide
)
Description:
test-suite.log
Filename:
MIME Type:
Creator:
Paolo Pedroni
Created:
2021-03-09 15:08:59 UTC
Size:
10.57 KB
patch
obsolete
>================================== > mdds 1.7.0: ./test-suite.log >================================== > ># TOTAL: 15 ># PASS: 14 ># SKIP: 0 ># XFAIL: 0 ># FAIL: 1 ># XPASS: 0 ># ERROR: 0 > >.. contents:: :depth: 2 > >FAIL: rtree_test >================ > >::rtree_test_intersection: --begin >::rtree_test_intersection: --end (duration: 9.53674e-07 sec) >::rtree_test_square_distance: --begin >p1: (3); p2: (5) >p1: (9); p2: (2) >p1: (0); p2: (0) >p1: (0, 0); p2: (0, 0) >p1: (0, 0); p2: (1, 1) >p1: (0, 0); p2: (2, 2) >p1: (3, 0); p2: (0, 4) >::rtree_test_square_distance: --end (duration: 1.5974e-05 sec) >::rtree_test_center_point: --begin >extent: (0, 0) - (2, 2) >extent: (-2, -4) - (2, 4) >extent: (3, 5) - (8, 10) >::rtree_test_center_point: --end (duration: 6.91414e-06 sec) >::rtree_test_area_enlargement: --begin >::rtree_test_area_enlargement: --end (duration: 0 sec) >::rtree_test_basic_search: --begin >bounding box: (0, 0) - (2, 2); value: test; depth: 1 >bounding box: (-2, 1) - (3, 6); value: more test; depth: 1 >::rtree_test_basic_search: --end (duration: 1.88351e-05 sec) >::rtree_test_basic_erase: --begin >::rtree_test_basic_erase: --end (duration: 4.05312e-06 sec) >::rtree_test_node_split: --begin >node: (0, 0); parent: (*, *); type: directory-nonleaf; extent: (0, 0) - (6, 6) > node: (1, 0); parent: (0, 0); type: directory-leaf; extent: (0, 0) - (2, 2) > node: (2, 0); parent: (1, 0); type: value; extent: (0, 0) - (1, 1) > node: (2, 1); parent: (1, 0); type: value; extent: (1, 1) - (2, 2) > node: (1, 1); parent: (0, 0); type: directory-leaf; extent: (2, 2) - (6, 6) > node: (2, 0); parent: (1, 1); type: value; extent: (2, 2) - (3, 3) > node: (2, 1); parent: (1, 1); type: value; extent: (3, 3) - (4, 4) > node: (2, 2); parent: (1, 1); type: value; extent: (4, 4) - (5, 5) > node: (2, 3); parent: (1, 1); type: value; extent: (5, 5) - (6, 6) > >::rtree_test_node_split: --end (duration: 5.50747e-05 sec) >::rtree_test_directory_node_split: --begin >Inserting value '(x=0,y=0)' to {(0, 0) - (1, 1)} ... >Inserting value '(x=0,y=1)' to {(0, 1) - (1, 2)} ... >Inserting value '(x=0,y=2)' to {(0, 2) - (1, 3)} ... >Inserting value '(x=0,y=3)' to {(0, 3) - (1, 4)} ... >Inserting value '(x=0,y=4)' to {(0, 4) - (1, 5)} ... >Inserting value '(x=0,y=5)' to {(0, 5) - (1, 6)} ... >Inserting value '(x=0,y=6)' to {(0, 6) - (1, 7)} ... >Inserting value '(x=0,y=7)' to {(0, 7) - (1, 8)} ... >Inserting value '(x=0,y=8)' to {(0, 8) - (1, 9)} ... >Inserting value '(x=0,y=9)' to {(0, 9) - (1, 10)} ... >Inserting value '(x=1,y=0)' to {(1, 0) - (2, 1)} ... >Inserting value '(x=1,y=1)' to {(1, 1) - (2, 2)} ... >Inserting value '(x=1,y=2)' to {(1, 2) - (2, 3)} ... >Inserting value '(x=1,y=3)' to {(1, 3) - (2, 4)} ... >Inserting value '(x=1,y=4)' to {(1, 4) - (2, 5)} ... >Inserting value '(x=1,y=5)' to {(1, 5) - (2, 6)} ... >Inserting value '(x=1,y=6)' to {(1, 6) - (2, 7)} ... >Inserting value '(x=1,y=7)' to {(1, 7) - (2, 8)} ... >Inserting value '(x=1,y=8)' to {(1, 8) - (2, 9)} ... >Inserting value '(x=1,y=9)' to {(1, 9) - (2, 10)} ... >Inserting value '(x=2,y=0)' to {(2, 0) - (3, 1)} ... >Inserting value '(x=2,y=1)' to {(2, 1) - (3, 2)} ... >Inserting value '(x=2,y=2)' to {(2, 2) - (3, 3)} ... >Inserting value '(x=2,y=3)' to {(2, 3) - (3, 4)} ... >Inserting value '(x=2,y=4)' to {(2, 4) - (3, 5)} ... >Inserting value '(x=2,y=5)' to {(2, 5) - (3, 6)} ... >Inserting value '(x=2,y=6)' to {(2, 6) - (3, 7)} ... >Inserting value '(x=2,y=7)' to {(2, 7) - (3, 8)} ... >Inserting value '(x=2,y=8)' to {(2, 8) - (3, 9)} ... >Inserting value '(x=2,y=9)' to {(2, 9) - (3, 10)} ... >Inserting value '(x=3,y=0)' to {(3, 0) - (4, 1)} ... >Inserting value '(x=3,y=1)' to {(3, 1) - (4, 2)} ... >Inserting value '(x=3,y=2)' to {(3, 2) - (4, 3)} ... >Inserting value '(x=3,y=3)' to {(3, 3) - (4, 4)} ... >Inserting value '(x=3,y=4)' to {(3, 4) - (4, 5)} ... >Inserting value '(x=3,y=5)' to {(3, 5) - (4, 6)} ... >Inserting value '(x=3,y=6)' to {(3, 6) - (4, 7)} ... >Inserting value '(x=3,y=7)' to {(3, 7) - (4, 8)} ... >Inserting value '(x=3,y=8)' to {(3, 8) - (4, 9)} ... >Inserting value '(x=3,y=9)' to {(3, 9) - (4, 10)} ... >Inserting value '(x=4,y=0)' to {(4, 0) - (5, 1)} ... >Inserting value '(x=4,y=1)' to {(4, 1) - (5, 2)} ... >Inserting value '(x=4,y=2)' to {(4, 2) - (5, 3)} ... >Inserting value '(x=4,y=3)' to {(4, 3) - (5, 4)} ... >Inserting value '(x=4,y=4)' to {(4, 4) - (5, 5)} ... >Inserting value '(x=4,y=5)' to {(4, 5) - (5, 6)} ... >Inserting value '(x=4,y=6)' to {(4, 6) - (5, 7)} ... >Inserting value '(x=4,y=7)' to {(4, 7) - (5, 8)} ... >Inserting value '(x=4,y=8)' to {(4, 8) - (5, 9)} ... >Inserting value '(x=4,y=9)' to {(4, 9) - (5, 10)} ... >Inserting value '(x=5,y=0)' to {(5, 0) - (6, 1)} ... >Inserting value '(x=5,y=1)' to {(5, 1) - (6, 2)} ... >Inserting value '(x=5,y=2)' to {(5, 2) - (6, 3)} ... >Inserting value '(x=5,y=3)' to {(5, 3) - (6, 4)} ... >Inserting value '(x=5,y=4)' to {(5, 4) - (6, 5)} ... >Inserting value '(x=5,y=5)' to {(5, 5) - (6, 6)} ... >Inserting value '(x=5,y=6)' to {(5, 6) - (6, 7)} ... >Inserting value '(x=5,y=7)' to {(5, 7) - (6, 8)} ... >Inserting value '(x=5,y=8)' to {(5, 8) - (6, 9)} ... >Inserting value '(x=5,y=9)' to {(5, 9) - (6, 10)} ... >Inserting value '(x=6,y=0)' to {(6, 0) - (7, 1)} ... >Inserting value '(x=6,y=1)' to {(6, 1) - (7, 2)} ... >Inserting value '(x=6,y=2)' to {(6, 2) - (7, 3)} ... >Inserting value '(x=6,y=3)' to {(6, 3) - (7, 4)} ... >Inserting value '(x=6,y=4)' to {(6, 4) - (7, 5)} ... >Inserting value '(x=6,y=5)' to {(6, 5) - (7, 6)} ... >Inserting value '(x=6,y=6)' to {(6, 6) - (7, 7)} ... >Inserting value '(x=6,y=7)' to {(6, 7) - (7, 8)} ... >Inserting value '(x=6,y=8)' to {(6, 8) - (7, 9)} ... >Inserting value '(x=6,y=9)' to {(6, 9) - (7, 10)} ... >Inserting value '(x=7,y=0)' to {(7, 0) - (8, 1)} ... >Inserting value '(x=7,y=1)' to {(7, 1) - (8, 2)} ... >Inserting value '(x=7,y=2)' to {(7, 2) - (8, 3)} ... >Inserting value '(x=7,y=3)' to {(7, 3) - (8, 4)} ... >Inserting value '(x=7,y=4)' to {(7, 4) - (8, 5)} ... >Inserting value '(x=7,y=5)' to {(7, 5) - (8, 6)} ... >Inserting value '(x=7,y=6)' to {(7, 6) - (8, 7)} ... >Inserting value '(x=7,y=7)' to {(7, 7) - (8, 8)} ... >Inserting value '(x=7,y=8)' to {(7, 8) - (8, 9)} ... >Inserting value '(x=7,y=9)' to {(7, 9) - (8, 10)} ... >Inserting value '(x=8,y=0)' to {(8, 0) - (9, 1)} ... >Inserting value '(x=8,y=1)' to {(8, 1) - (9, 2)} ... >Inserting value '(x=8,y=2)' to {(8, 2) - (9, 3)} ... >Inserting value '(x=8,y=3)' to {(8, 3) - (9, 4)} ... >Inserting value '(x=8,y=4)' to {(8, 4) - (9, 5)} ... >Inserting value '(x=8,y=5)' to {(8, 5) - (9, 6)} ... >Inserting value '(x=8,y=6)' to {(8, 6) - (9, 7)} ... >Inserting value '(x=8,y=7)' to {(8, 7) - (9, 8)} ... >Inserting value '(x=8,y=8)' to {(8, 8) - (9, 9)} ... >Inserting value '(x=8,y=9)' to {(8, 9) - (9, 10)} ... >Inserting value '(x=9,y=0)' to {(9, 0) - (10, 1)} ... >Inserting value '(x=9,y=1)' to {(9, 1) - (10, 2)} ... >Inserting value '(x=9,y=2)' to {(9, 2) - (10, 3)} ... >Inserting value '(x=9,y=3)' to {(9, 3) - (10, 4)} ... >Inserting value '(x=9,y=4)' to {(9, 4) - (10, 5)} ... >Inserting value '(x=9,y=5)' to {(9, 5) - (10, 6)} ... >Inserting value '(x=9,y=6)' to {(9, 6) - (10, 7)} ... >Inserting value '(x=9,y=7)' to {(9, 7) - (10, 8)} ... >Inserting value '(x=9,y=8)' to {(9, 8) - (10, 9)} ... >Inserting value '(x=9,y=9)' to {(9, 9) - (10, 10)} ... >::rtree_test_directory_node_split: --end (duration: 0.00390506 sec) >::rtree_test_erase_directories: --begin >node: (0, 0); parent: (*, *); type: directory-nonleaf; extent: (0, 0) - (10, 10) > node: (1, 0); parent: (0, 0); type: directory-nonleaf; extent: (0, 0) - (8, 6) > node: (2, 0); parent: (1, 0); type: directory-leaf; extent: (0, 0) - (4, 6) > node: (3, 0); parent: (2, 0); type: value; extent: (0, 0) - (2, 2) > node: (3, 1); parent: (2, 0); type: value; extent: (2, 0) - (4, 2) > node: (3, 2); parent: (2, 0); type: value; extent: (2, 2) - (4, 4) > node: (3, 3); parent: (2, 0); type: value; extent: (2, 4) - (4, 6) > node: (2, 1); parent: (1, 0); type: directory-leaf; extent: (0, 0) - (6, 6) > node: (3, 0); parent: (2, 1); type: value; extent: (0, 2) - (2, 4) > node: (3, 1); parent: (2, 1); type: value; extent: (0, 4) - (2, 6) > node: (3, 2); parent: (2, 1); type: value; extent: (4, 0) - (6, 2) > node: (3, 3); parent: (2, 1); type: value; extent: (4, 4) - (6, 6) > node: (2, 2); parent: (1, 0); type: directory-leaf; extent: (4, 0) - (8, 6) > node: (3, 0); parent: (2, 2); type: value; extent: (6, 0) - (8, 2) > node: (3, 1); parent: (2, 2); type: value; extent: (4, 2) - (6, 4) > node: (3, 2); parent: (2, 2); type: value; extent: (6, 2) - (8, 4) > node: (3, 3); parent: (2, 2); type: value; extent: (6, 4) - (8, 6) > node: (1, 1); parent: (0, 0); type: directory-nonleaf; extent: (0, 0) - (10, 10) > node: (2, 0); parent: (1, 1); type: directory-leaf; extent: (0, 6) - (2, 10) > node: (3, 0); parent: (2, 0); type: value; extent: (0, 6) - (2, 8) > node: (3, 1); parent: (2, 0); type: value; extent: (0, 8) - (2, 10) > node: (2, 1); parent: (1, 1); type: directory-leaf; extent: (2, 6) - (4, 10) > node: (3, 0); parent: (2, 1); type: value; extent: (2, 6) - (4, 8) > node: (3, 1); parent: (2, 1); type: value; extent: (2, 8) - (4, 10) > node: (2, 2); parent: (1, 1); type: directory-leaf; extent: (4, 6) - (6, 10) > node: (3, 0); parent: (2, 2); type: value; extent: (4, 6) - (6, 8) > node: (3, 1); parent: (2, 2); type: value; extent: (4, 8) - (6, 10) > node: (2, 3); parent: (1, 1); type: directory-leaf; extent: (8, 0) - (10, 4) > node: (3, 0); parent: (2, 3); type: value; extent: (8, 0) - (10, 2) > node: (3, 1); parent: (2, 3); type: value; extent: (8, 2) - (10, 4) > node: (2, 4); parent: (1, 1); type: directory-leaf; extent: (6, 4) - (10, 10) > node: (3, 0); parent: (2, 4); type: value; extent: (8, 4) - (10, 6) > node: (3, 1); parent: (2, 4); type: value; extent: (6, 6) - (8, 8) > node: (3, 2); parent: (2, 4); type: value; extent: (8, 6) - (10, 8) > node: (3, 3); parent: (2, 4); type: value; extent: (6, 8) - (8, 10) > node: (3, 4); parent: (2, 4); type: value; extent: (8, 8) - (10, 10) > >erase at (1, 1) >erase at (1, 3) >erase at (1, 5) >erase at (1, 7) >erase at (1, 9) >erase at (3, 1) >erase at (3, 3) >erase at (3, 5) >erase at (3, 7) >erase at (3, 9) >erase at (5, 1) >erase at (5, 3) >erase at (5, 5) >erase at (5, 7) >erase at (5, 9) >erase at (7, 1) >erase at (7, 3) >erase at (7, 5) >::rtree_test_erase_directories: --end (duration: 0.000390768 sec) >Test failed: The parent node pointer does not point to the real parent. (expected: 0x327460; stored in node: 0x327430) >FAIL rtree_test (exit status: 1) >
You cannot view the attachment while viewing its details because your browser does not support IFRAMEs.
View the attachment on a separate page
.
View Attachment As Raw
Actions:
View
Attachments on
bug 775056
:
690237
| 690240