1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944
|
/*
* Copyright © 2016 Collabora, Ltd.
*
* Permission is hereby granted, free of charge, to any person obtaining a
* copy of this software and associated documentation files (the "Software"),
* to deal in the Software without restriction, including without limitation
* the rights to use, copy, modify, merge, publish, distribute, sublicense,
* and/or sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice (including the next
* paragraph) shall be included in all copies or substantial portions of the
* Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
* THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
* FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
* IN THE SOFTWARE.
*
* Authors:
* Robert Foss <robert.foss@collabora.com>
*/
#include <pthread.h>
#include <semaphore.h>
#include <stdatomic.h>
#include <stdint.h>
#include <sys/socket.h>
#include <sys/types.h>
#include <unistd.h>
#include "igt.h"
#include "igt_aux.h"
#include "igt_primes.h"
#include "sw_sync.h"
/**
* TEST: sw sync
* Description: Test SW Sync Framework
* Category: Core
* Mega feature: General Core features
* Sub-category: Synchronization
* Functionality: semaphore
* Feature: synchronization
* Test category: GEM_Legacy
*
* SUBTEST: alloc_fence
*
* SUBTEST: alloc_fence_invalid_timeline
*
* SUBTEST: alloc_merge_fence
*
* SUBTEST: alloc_timeline
*
* SUBTEST: sync_busy
*
* SUBTEST: sync_busy_fork
*
* SUBTEST: sync_busy_fork_unixsocket
*
* SUBTEST: sync_expired_merge
*
* SUBTEST: sync_merge
*
* SUBTEST: sync_merge_invalid
*
* SUBTEST: sync_merge_same
*
* SUBTEST: sync_multi_consumer
*
* SUBTEST: sync_multi_consumer_producer
*
* SUBTEST: sync_multi_producer_single_consumer
*
* SUBTEST: sync_multi_timeline_wait
*
* SUBTEST: sync_random_merge
*
* SUBTEST: timeline_closed
*
* SUBTEST: timeline_closed_signaled
*/
IGT_TEST_DESCRIPTION("Test SW Sync Framework");
typedef struct {
int timeline;
uint32_t thread_id;
_Atomic(uint32_t) *counter;
sem_t *sem;
} data_t;
static void test_alloc_timeline(void)
{
int timeline;
timeline = sw_sync_timeline_create();
close(timeline);
}
static void test_alloc_fence(void)
{
int in_fence;
int timeline;
timeline = sw_sync_timeline_create();
in_fence = sw_sync_timeline_create_fence(timeline, 0);
close(in_fence);
close(timeline);
}
static void test_alloc_fence_invalid_timeline(void)
{
igt_assert_f(__sw_sync_timeline_create_fence(-1, 0) < 0,
"Did not fail to create fence on invalid timeline\n");
}
static void test_timeline_closed(void)
{
int fence;
int timeline;
timeline = sw_sync_timeline_create();
fence = sw_sync_timeline_create_fence(timeline, 1);
close(timeline);
igt_assert_f(sync_fence_wait(fence, 0) == 0,
"Failure waiting on unsignaled fence on closed timeline\n");
igt_assert_f(sync_fence_status(fence) == -ENOENT,
"Failure in marking up an unsignaled fence on closed timeline\n");
}
static void test_timeline_closed_signaled(void)
{
int fence;
int timeline;
timeline = sw_sync_timeline_create();
fence = sw_sync_timeline_create_fence(timeline, 1);
sw_sync_timeline_inc(timeline, 1);
close(timeline);
igt_assert_f(sync_fence_wait(fence, 0) == 0,
"Failure waiting on signaled fence for closed timeline\n");
}
static void test_alloc_merge_fence(void)
{
int in_fence[2];
int fence_merge;
int timeline[2];
timeline[0] = sw_sync_timeline_create();
timeline[1] = sw_sync_timeline_create();
in_fence[0] = sw_sync_timeline_create_fence(timeline[0], 1);
in_fence[1] = sw_sync_timeline_create_fence(timeline[1], 1);
fence_merge = sync_fence_merge(in_fence[1], in_fence[0]);
close(in_fence[0]);
close(in_fence[1]);
close(fence_merge);
close(timeline[0]);
close(timeline[1]);
}
static void test_sync_busy(void)
{
int fence;
int timeline;
int seqno;
timeline = sw_sync_timeline_create();
fence = sw_sync_timeline_create_fence(timeline, 5);
/* Make sure that fence has not been signaled yet */
igt_assert_f(sync_fence_wait(fence, 0) == -ETIME,
"Fence signaled early (timeline value 0, fence seqno 5)\n");
/* Advance timeline from 0 -> 1 */
sw_sync_timeline_inc(timeline, 1);
/* Make sure that fence has not been signaled yet */
igt_assert_f(sync_fence_wait(fence, 0) == -ETIME,
"Fence signaled early (timeline value 1, fence seqno 5)\n");
/* Advance timeline from 1 -> 5: signaling the fence (seqno 5)*/
sw_sync_timeline_inc(timeline, 4);
igt_assert_f(sync_fence_wait(fence, 0) == 0,
"Fence not signaled (timeline value 5, fence seqno 5)\n");
/* Go even further, and confirm wait still succeeds */
sw_sync_timeline_inc(timeline, 5);
igt_assert_f(sync_fence_wait(fence, 0) == 0,
"Fence not signaled (timeline value 10, fence seqno 5)\n");
seqno = 10;
for_each_prime_number(prime, 100) {
int fence_prime;
seqno += prime;
fence_prime = sw_sync_timeline_create_fence(timeline, seqno);
sw_sync_timeline_inc(timeline, prime);
igt_assert_f(sync_fence_wait(fence_prime, 0) == 0,
"Fence not signaled during test of prime timeline increments\n");
close(fence_prime);
}
close(fence);
close(timeline);
}
static void test_sync_busy_fork_unixsocket(void)
{
int fence;
int timeline;
int sv[2];
igt_require(socketpair(AF_UNIX, SOCK_DGRAM, 0, sv) == 0);
timeline = sw_sync_timeline_create();
fence = sw_sync_timeline_create_fence(timeline, 1);
igt_fork(child, 1) {
/* Child process */
int socket = sv[1];
int socket_timeline;
struct msghdr msg = {0};
struct cmsghdr *cmsg;
unsigned char *data;
char m_buffer[256];
char c_buffer[256];
struct iovec io = { .iov_base = m_buffer, .iov_len = sizeof(m_buffer) };
close(sv[0]);
msg.msg_iov = &io;
msg.msg_iovlen = 1;
msg.msg_control = c_buffer;
msg.msg_controllen = sizeof(c_buffer);
igt_assert(recvmsg(socket, &msg, 0) > 0);
cmsg = CMSG_FIRSTHDR(&msg);
data = CMSG_DATA(cmsg);
socket_timeline = *((int *) data);
/* Advance timeline from 0 -> 1 */
sw_sync_timeline_inc(socket_timeline, 1);
}
{
/* Parent process */
int socket = sv[0];
struct cmsghdr *cmsg;
struct iovec io = { .iov_base = (char *)"ABC", .iov_len = 3 };
struct msghdr msg = { 0 };
char buf[CMSG_SPACE(sizeof(timeline))];
memset(buf, '\0', sizeof(buf));
close(sv[1]);
msg.msg_iov = &io;
msg.msg_iovlen = 1;
msg.msg_control = buf;
msg.msg_controllen = sizeof(buf);
cmsg = CMSG_FIRSTHDR(&msg);
cmsg->cmsg_level = SOL_SOCKET;
cmsg->cmsg_type = SCM_RIGHTS;
cmsg->cmsg_len = CMSG_LEN(sizeof(timeline));
memcpy(CMSG_DATA(cmsg), &timeline, sizeof(timeline));
msg.msg_controllen = cmsg->cmsg_len;
igt_assert_f(sync_fence_wait(fence, 0) == -ETIME,
"Fence signaled (it should not have been signalled yet)\n");
igt_assert(sendmsg(socket, &msg, 0) > 0);
igt_assert_f(sync_fence_wait(fence, 2*1000) == 0,
"Fence not signaled (timeline value 1 fence seqno 1)\n");
}
igt_waitchildren();
close(fence);
close(timeline);
}
static void test_sync_busy_fork(void)
{
int timeline = sw_sync_timeline_create();
int fence = sw_sync_timeline_create_fence(timeline, 1);
igt_assert_f(sync_fence_wait(fence, 0) == -ETIME,
"Fence signaled (it should not have been signalled yet)\n");
igt_fork(child, 1) {
usleep(1*1000*1000);
/* Advance timeline from 0 -> 1 */
sw_sync_timeline_inc(timeline, 1);
}
igt_assert_f(sync_fence_wait(fence, 2*1000) == 0,
"Fence not signaled (timeline value 1 fence seqno 1)\n");
igt_waitchildren();
close(fence);
close(timeline);
}
static void test_sync_merge_invalid(void)
{
int in_fence;
int fence_invalid;
int fence_merge;
int timeline;
char tmppath[] = "/tmp/igt-XXXXXX";
int skip = 0;
timeline = sw_sync_timeline_create();
in_fence = sw_sync_timeline_create_fence(timeline, 1);
fence_invalid = -1;
fence_merge = sync_fence_merge(in_fence, fence_invalid);
igt_assert_f(fence_merge < 0, "Verify invalid fd (-1) handling");
fence_invalid = drm_open_driver(DRIVER_ANY);
fence_merge = sync_fence_merge(in_fence, fence_invalid);
igt_assert_f(fence_merge < 0, "Verify invalid fd (device fd) handling");
fence_invalid = mkstemp(tmppath);
if (fence_invalid == -1) {
skip = 1;
goto out;
}
unlink(tmppath);
fence_invalid = drm_open_driver(DRIVER_ANY);
fence_merge = sync_fence_merge(in_fence, fence_invalid);
close(fence_invalid);
igt_assert_f(fence_merge < 0, "Verify invalid fd (file fd) handling");
out:
close(in_fence);
close(fence_merge);
close(timeline);
igt_require(skip == 0);
}
static void test_sync_merge(void)
{
int in_fence[3];
int fence_merge;
int timeline;
int active, signaled;
timeline = sw_sync_timeline_create();
in_fence[0] = sw_sync_timeline_create_fence(timeline, 1);
in_fence[1] = sw_sync_timeline_create_fence(timeline, 2);
in_fence[2] = sw_sync_timeline_create_fence(timeline, 3);
fence_merge = sync_fence_merge(in_fence[0], in_fence[1]);
fence_merge = sync_fence_merge(in_fence[2], fence_merge);
/* confirm all fences have one active point (even d) */
active = sync_fence_count_status(in_fence[0],
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(active == 1, "in_fence[0] has too many active fences\n");
active = sync_fence_count_status(in_fence[1],
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(active == 1, "in_fence[1] has too many active fences\n");
active = sync_fence_count_status(in_fence[2],
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(active == 1, "in_fence[2] has too many active fences\n");
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(active == 1, "fence_merge has too many active fences\n");
/* confirm that fence_merge is not signaled until the max of fence 0,1,2 */
sw_sync_timeline_inc(timeline, 1);
signaled = sync_fence_count_status(in_fence[0],
SW_SYNC_FENCE_STATUS_SIGNALED);
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(signaled == 1, "in_fence[0] did not signal\n");
igt_assert_f(active == 1, "fence_merge signaled too early\n");
sw_sync_timeline_inc(timeline, 1);
signaled = sync_fence_count_status(in_fence[1],
SW_SYNC_FENCE_STATUS_SIGNALED);
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(signaled == 1, "in_fence[1] did not signal\n");
igt_assert_f(active == 1, "fence_merge signaled too early\n");
sw_sync_timeline_inc(timeline, 1);
signaled = sync_fence_count_status(in_fence[2],
SW_SYNC_FENCE_STATUS_SIGNALED);
igt_assert_f(signaled == 1, "in_fence[2] did not signal\n");
signaled = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_SIGNALED);
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(active == 0 && signaled == 1,
"fence_merge did not signal\n");
close(in_fence[0]);
close(in_fence[1]);
close(in_fence[2]);
close(fence_merge);
close(timeline);
}
static void test_sync_merge_same(void)
{
int in_fence[2];
int timeline;
int signaled;
timeline = sw_sync_timeline_create();
in_fence[0] = sw_sync_timeline_create_fence(timeline, 1);
in_fence[1] = sync_fence_merge(in_fence[0], in_fence[0]);
signaled = sync_fence_count_status(in_fence[0],
SW_SYNC_FENCE_STATUS_SIGNALED);
igt_assert_f(signaled == 0, "Fence signaled too early\n");
sw_sync_timeline_inc(timeline, 1);
signaled = sync_fence_count_status(in_fence[0],
SW_SYNC_FENCE_STATUS_SIGNALED);
igt_assert_f(signaled == 1, "Fence did not signal\n");
close(in_fence[0]);
close(in_fence[1]);
close(timeline);
}
static void test_sync_multi_timeline_wait(void)
{
int timeline[3];
int in_fence[3];
int fence_merge;
int active, signaled;
timeline[0] = sw_sync_timeline_create();
timeline[1] = sw_sync_timeline_create();
timeline[2] = sw_sync_timeline_create();
in_fence[0] = sw_sync_timeline_create_fence(timeline[0], 5);
in_fence[1] = sw_sync_timeline_create_fence(timeline[1], 5);
in_fence[2] = sw_sync_timeline_create_fence(timeline[2], 5);
fence_merge = sync_fence_merge(in_fence[0], in_fence[1]);
fence_merge = sync_fence_merge(in_fence[2], fence_merge);
/* Confirm fence isn't signaled */
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
igt_assert_f(active == 3, "Fence signaled too early\n");
igt_assert_f(sync_fence_wait(fence_merge, 0) == -ETIME,
"Failure waiting on fence until timeout\n");
sw_sync_timeline_inc(timeline[0], 5);
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
signaled = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_SIGNALED);
igt_assert_f(active == 2 && signaled == 1,
"Fence did not signal properly\n");
sw_sync_timeline_inc(timeline[1], 5);
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
signaled = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_SIGNALED);
igt_assert_f(active == 1 && signaled == 2,
"Fence did not signal properly\n");
sw_sync_timeline_inc(timeline[2], 5);
active = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_ACTIVE);
signaled = sync_fence_count_status(fence_merge,
SW_SYNC_FENCE_STATUS_SIGNALED);
igt_assert_f(active == 0 && signaled == 3,
"Fence did not signal properly\n");
/* confirm you can successfully wait */
igt_assert_f(sync_fence_wait(fence_merge, 100) == 0,
"Failure waiting on signaled fence\n");
close(in_fence[0]);
close(in_fence[1]);
close(in_fence[2]);
close(fence_merge);
close(timeline[0]);
close(timeline[1]);
close(timeline[2]);
}
#define MULTI_CONSUMER_THREADS 8
#define MULTI_CONSUMER_ITERATIONS (1 << 12)
static int multi_consumer_threads = MULTI_CONSUMER_THREADS;
static void * test_sync_multi_consumer_thread(void *arg)
{
data_t *data = arg;
int thread_id = data->thread_id;
int timeline = data->timeline;
int i;
for (i = 0; i < MULTI_CONSUMER_ITERATIONS; i++) {
int next_point = i * multi_consumer_threads + thread_id;
int fence = sw_sync_timeline_create_fence(timeline, next_point);
if (sync_fence_wait(fence, 1000) < 0)
return (void *) 1;
if (READ_ONCE(*data->counter) != next_point)
return (void *) 1;
sem_post(data->sem);
close(fence);
}
return NULL;
}
static void test_sync_multi_consumer(void)
{
data_t data_arr[MULTI_CONSUMER_THREADS];
pthread_t thread_arr[MULTI_CONSUMER_THREADS];
sem_t sem;
int timeline;
_Atomic(uint32_t) counter = 0;
uintptr_t thread_ret = 0;
data_t data;
int i, ret;
sem_init(&sem, 0, 0);
timeline = sw_sync_timeline_create();
data.counter = &counter;
data.timeline = timeline;
data.sem = &sem;
/* Start sync threads. */
for (i = 0; i < multi_consumer_threads; i++) {
data_arr[i] = data;
data_arr[i].thread_id = i;
ret = pthread_create(&thread_arr[i], NULL,
test_sync_multi_consumer_thread,
(void *) &(data_arr[i]));
igt_assert_eq(ret, 0);
}
/* Produce 'content'. */
for (i = 0; i < multi_consumer_threads * MULTI_CONSUMER_ITERATIONS; i++) {
sem_wait(&sem);
atomic_fetch_add(&counter, 1);
sw_sync_timeline_inc(timeline, 1);
}
/* Wait for threads to complete. */
for (i = 0; i < multi_consumer_threads; i++) {
uintptr_t local_thread_ret;
pthread_join(thread_arr[i], (void **)&local_thread_ret);
thread_ret |= local_thread_ret;
}
close(timeline);
sem_destroy(&sem);
igt_assert_eq(counter,
multi_consumer_threads * MULTI_CONSUMER_ITERATIONS);
igt_assert_f(thread_ret == 0, "A sync thread reported failure.\n");
}
static void * test_sync_multi_consumer_producer_thread(void *arg)
{
data_t *data = arg;
int thread_id = data->thread_id;
int timeline = data->timeline;
int i;
for (i = 0; i < MULTI_CONSUMER_ITERATIONS; i++) {
int next_point = i * multi_consumer_threads + thread_id;
int fence = sw_sync_timeline_create_fence(timeline, next_point);
if (sync_fence_wait(fence, 1000) < 0)
return (void *) 1;
if (atomic_fetch_add(data->counter, 1) != next_point)
return (void *) 1;
/* Kick off the next thread. */
sw_sync_timeline_inc(timeline, 1);
close(fence);
}
return NULL;
}
static void test_sync_multi_consumer_producer(void)
{
data_t data_arr[MULTI_CONSUMER_THREADS];
pthread_t thread_arr[MULTI_CONSUMER_THREADS];
int timeline;
_Atomic(uint32_t) counter = 0;
uintptr_t thread_ret = 0;
data_t data;
int i, ret;
timeline = sw_sync_timeline_create();
data.counter = &counter;
data.timeline = timeline;
/* Start consumer threads. */
for (i = 0; i < multi_consumer_threads; i++) {
data_arr[i] = data;
data_arr[i].thread_id = i;
ret = pthread_create(&thread_arr[i], NULL,
test_sync_multi_consumer_producer_thread,
(void *) &(data_arr[i]));
igt_assert_eq(ret, 0);
}
/* Wait for threads to complete. */
for (i = 0; i < multi_consumer_threads; i++) {
uintptr_t local_thread_ret;
pthread_join(thread_arr[i], (void **)&local_thread_ret);
thread_ret |= local_thread_ret;
}
close(timeline);
igt_assert_eq(counter,
multi_consumer_threads * MULTI_CONSUMER_ITERATIONS);
igt_assert_f(thread_ret == 0, "A sync thread reported failure.\n");
}
static int test_mspc_wait_on_fence(int fence)
{
int error, active;
do {
error = sync_fence_count_status(fence,
SW_SYNC_FENCE_STATUS_ERROR);
igt_assert_f(error == 0, "Error occurred on fence\n");
active = sync_fence_count_status(fence,
SW_SYNC_FENCE_STATUS_ACTIVE);
} while (active);
return 0;
}
static struct {
int threads;
_Atomic(uint32_t) counter;
int cons_timeline;
int *prod_timeline;
} test_mpsc_data;
static void *mpsc_producer_thread(void *d)
{
int id = (long)d;
int *prod_timeline = test_mpsc_data.prod_timeline;
int cons_timeline = test_mpsc_data.cons_timeline;
int seqno = 0;
while (1) {
int fence;
fence = __sw_sync_timeline_create_fence(cons_timeline,
seqno++);
if (fence < 0)
break;
/* Wait for the consumer to finish. Use alternate
* means of waiting on the fence
*/
if (id % 8 != 0) {
igt_assert_f(sync_fence_wait(fence, -1) == 0,
"Failure waiting on fence\n");
} else {
igt_assert_f(test_mspc_wait_on_fence(fence) == 0,
"Failure waiting on fence\n");
}
atomic_fetch_add(&test_mpsc_data.counter, 1);
sw_sync_timeline_inc(prod_timeline[id], 1);
close(fence);
}
return NULL;
}
static int mpsc_consumer_thread(void)
{
int *prod_timeline = test_mpsc_data.prod_timeline;
int cons_timeline = test_mpsc_data.cons_timeline;
int n = test_mpsc_data.threads;
int seqno = 0;
igt_until_timeout(1) {
int fence;
fence = sw_sync_timeline_create_fence(prod_timeline[0],
++seqno);
if (fence < 0)
break;
for (int i = 1; i < n; i++) {
int tmp, merged;
tmp = sw_sync_timeline_create_fence(prod_timeline[i],
seqno);
merged = sync_fence_merge(tmp, fence);
close(tmp);
close(fence);
fence = merged;
}
/* Make sure we see an increment from every producer thread.
* Vary the means by which we wait.
*/
igt_assert_f(sync_fence_wait(fence, -1) == 0,
"Producers did not increment as expected\n");
igt_assert_f(test_mpsc_data.counter == n * seqno,
"Counter value mismatch\n");
/* Release the producer threads */
sw_sync_timeline_inc(cons_timeline, 1);
close(fence);
}
return 0;
}
/* IMPORTANT NOTE: if you see this test failing on your system, it may be
* due to a shortage of file descriptors. Please ensure your system has
* a sensible limit for this test to finish correctly.
*/
static void test_sync_multi_producer_single_consumer(void)
{
int n = 5;
int prod_timeline[n];
int cons_timeline;
pthread_t threads[n];
long i;
cons_timeline = sw_sync_timeline_create();
for (i = 0; i < n; i++)
prod_timeline[i] = sw_sync_timeline_create();
test_mpsc_data.prod_timeline = prod_timeline;
test_mpsc_data.cons_timeline = cons_timeline;
test_mpsc_data.threads = n;
test_mpsc_data.counter = 0;
for (i = 0; i < n; i++) {
pthread_create(&threads[i], NULL, (void * (*)(void *))
mpsc_producer_thread,
(void *)i);
}
mpsc_consumer_thread();
close(cons_timeline);
for (i = 0; i < n; i++) {
pthread_join(threads[i], NULL);
close(prod_timeline[i]);
}
}
static void test_sync_expired_merge(void)
{
int timeline;
int expired;
timeline = sw_sync_timeline_create();
sw_sync_timeline_inc(timeline, 100);
expired = sw_sync_timeline_create_fence(timeline, 1);
igt_assert_f(sync_fence_wait(expired, 0) == 0,
"Failure waiting for expired fence\n");
close(sync_fence_merge(expired, expired));
igt_until_timeout(1) {
int fence = sync_fence_merge(expired, expired);
igt_assert_f(sync_fence_wait(fence, -1) == 0,
"Failure waiting on fence\n");
close(fence);
}
close(expired);
}
static void test_sync_random_merge(void)
{
int i, size;
const int nbr_timeline = 32;
const int nbr_merge = 1024;
int fence_map[nbr_timeline];
int timeline_arr[nbr_timeline];
int fence, tmpfence, merged;
int timeline, timeline_offset, sync_pt;
srand(time(NULL));
for (i = 0; i < nbr_timeline; i++) {
timeline_arr[i] = sw_sync_timeline_create();
fence_map[i] = -1;
}
sync_pt = rand();
fence = sw_sync_timeline_create_fence(timeline_arr[0], sync_pt);
fence_map[0] = sync_pt;
/* Randomly create syncpoints out of a fixed set of timelines,
* and merge them together.
*/
for (i = 0; i < nbr_merge; i++) {
/* Generate syncpoint. */
timeline_offset = rand() % nbr_timeline;
timeline = timeline_arr[timeline_offset];
sync_pt = rand();
/* Keep track of the latest sync_pt in each timeline. */
if (fence_map[timeline_offset] == -1)
fence_map[timeline_offset] = sync_pt;
else if (fence_map[timeline_offset] < sync_pt)
fence_map[timeline_offset] = sync_pt;
/* Merge. */
tmpfence = sw_sync_timeline_create_fence(timeline, sync_pt);
merged = sync_fence_merge(tmpfence, fence);
close(tmpfence);
close(fence);
fence = merged;
}
size = 0;
for (i = 0; i < nbr_timeline; i++)
if (fence_map[i] != -1)
size++;
/* Trigger the merged fence. */
for (i = 0; i < nbr_timeline; i++) {
if (fence_map[i] != -1) {
igt_assert_f(sync_fence_wait(fence, 0) == -ETIME,
"Failure waiting on fence until timeout\n");
/* Increment the timeline to the last sync_pt */
sw_sync_timeline_inc(timeline_arr[i], fence_map[i]);
}
}
/* Check that the fence is triggered. */
igt_assert_f(sync_fence_wait(fence, 1) == 0,
"Failure triggering fence\n");
close(fence);
for (i = 0; i < nbr_timeline; i++)
close(timeline_arr[i]);
}
igt_main
{
igt_fixture {
igt_require_sw_sync();
multi_consumer_threads =
min_t(multi_consumer_threads,
multi_consumer_threads,
sysconf(_SC_NPROCESSORS_ONLN));
}
igt_subtest("alloc_timeline")
test_alloc_timeline();
igt_subtest("alloc_fence")
test_alloc_fence();
igt_subtest("alloc_fence_invalid_timeline")
test_alloc_fence_invalid_timeline();
igt_subtest("timeline_closed")
test_timeline_closed();
igt_subtest("timeline_closed_signaled")
test_timeline_closed_signaled();
igt_subtest("alloc_merge_fence")
test_alloc_merge_fence();
igt_subtest("sync_busy")
test_sync_busy();
igt_subtest("sync_busy_fork")
test_sync_busy_fork();
igt_subtest("sync_busy_fork_unixsocket")
test_sync_busy_fork_unixsocket();
igt_subtest("sync_merge_invalid")
test_sync_merge_invalid();
igt_subtest("sync_merge")
test_sync_merge();
igt_subtest("sync_merge_same")
test_sync_merge_same();
igt_subtest("sync_multi_timeline_wait")
test_sync_multi_timeline_wait();
igt_subtest("sync_multi_consumer")
test_sync_multi_consumer();
igt_subtest("sync_multi_consumer_producer")
test_sync_multi_consumer_producer();
igt_subtest("sync_multi_producer_single_consumer")
test_sync_multi_producer_single_consumer();
igt_subtest("sync_expired_merge")
test_sync_expired_merge();
igt_subtest("sync_random_merge")
test_sync_random_merge();
}
|