summaryrefslogtreecommitdiff
path: root/tests/barrier5.c
blob: 06819065419cf36b3e8ddc90216ca91628d6e7c6 (plain)
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
/*
 * barrier5.c
 *
 *
 * Pthreads-win32 - POSIX Threads Library for Win32
 * Copyright (C) 1998 Ben Elliston and Ross Johnson
 * Copyright (C) 1999,2000,2001 Ross Johnson
 *
 * Contact Email: rpj@ise.canberra.edu.au
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * --------------------------------------------------------------------------
 *
 * Declare a single barrier object, set up a sequence of
 * barrier points to prove lockstepness, and then destroy it.
 *
 */

#include "test.h"

enum {
  NUMTHREADS = 16,
  BARRIERS = 10000
};
 
pthread_barrier_t barrier = NULL;
pthread_mutex_t mx = PTHREAD_MUTEX_INITIALIZER;

int barrierReleases[BARRIERS + 1];

void *
func(void * barrierHeight)
{
  int i;
  int result;
  int serialThreads = 0;

  for (i = 1; i < BARRIERS; i++)
    {
      result = pthread_barrier_wait(&barrier);

      assert(pthread_mutex_lock(&mx) == 0);
      barrierReleases[i]++;
      assert(pthread_mutex_unlock(&mx) == 0);
      /*
       * Confirm the correct number of releases from the previous
       * barrier. We can't do the current barrier yet because there may
       * still be threads waking up.
       */
      if (result == PTHREAD_BARRIER_SERIAL_THREAD)
        {
          serialThreads++;
          assert(barrierReleases[i - 1] == (int) barrierHeight);
          barrierReleases[i + 1] = 0;
        }
      else if (result != 0)
        {
          printf("Barrier failed: result = %s\n", error_string[result]);
          fflush(stdout);
          return NULL;
        }
    }

  return (void *) serialThreads;
}

int
main()
{
  int i, j;
  int result;
  int serialThreadsTotal;
  pthread_t t[NUMTHREADS + 1];

  for (j = 1; j <= NUMTHREADS; j++)
    {
      printf("Barrier height = %d\n", j);

      barrierReleases[0] = j;
      barrierReleases[1] = 0;

      assert(pthread_barrier_init(&barrier, NULL, j) == 0);

      for (i = 1; i <= j; i++)
        {
          assert(pthread_create(&t[i], NULL, func, (void *) j) == 0);
        }

      serialThreadsTotal = 0;
      for (i = 1; i <= j; i++)
        {
          assert(pthread_join(t[i], (void **) &result) == 0);
          serialThreadsTotal += result;
        }

      assert(serialThreadsTotal == BARRIERS - 1);
      assert(barrierReleases[BARRIERS - 1] == j);
      assert(barrierReleases[BARRIERS] == 0);

      assert(pthread_barrier_destroy(&barrier) == 0);
    }

  assert(pthread_mutex_destroy(&mx) == 0);

  return 0;
}