File: itkBarrierTest.cxx

package info (click to toggle)
insighttoolkit5 5.4.3-5
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 704,384 kB
  • sloc: cpp: 783,592; ansic: 628,724; xml: 44,704; fortran: 34,250; python: 22,874; sh: 4,078; pascal: 2,636; lisp: 2,158; makefile: 464; yacc: 328; asm: 205; perl: 203; lex: 146; tcl: 132; javascript: 98; csh: 81
file content (178 lines) | stat: -rw-r--r-- 5,105 bytes parent folder | download
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
/*=========================================================================
 *
 *  Copyright NumFOCUS
 *
 *  Licensed under the Apache License, Version 2.0 (the "License");
 *  you may not use this file except in compliance with the License.
 *  You may obtain a copy of the License at
 *
 *         https://www.apache.org/licenses/LICENSE-2.0.txt
 *
 *  Unless required by applicable law or agreed to in writing, software
 *  distributed under the License is distributed on an "AS IS" BASIS,
 *  WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 *  See the License for the specific language governing permissions and
 *  limitations under the License.
 *
 *=========================================================================*/

#include "itkBarrier.h"
#include "itkMultiThreaderBase.h"
#include "itkTestingMacros.h"


class BarrierTestUserData
{
public:
  itk::Barrier::Pointer m_FirstBarrier;
  itk::Barrier::Pointer m_SecondBarrier;
  unsigned int          m_Counter[itk::ITK_MAX_THREADS];
  unsigned int          m_NumberOfIterations;
  unsigned int          m_NumberOfWorkUnits;
  bool                  m_TestFailure;

  BarrierTestUserData(unsigned int number_of_threads)
  {
    m_TestFailure = false;
    m_NumberOfWorkUnits = number_of_threads;
    for (unsigned int i = 0; i < number_of_threads - 1; ++i)
    {
      m_Counter[i] = 0;
    }
    m_NumberOfIterations = 50;
    m_FirstBarrier = itk::Barrier::New();
    m_SecondBarrier = itk::Barrier::New();
    m_FirstBarrier->Initialize(number_of_threads);
    m_SecondBarrier->Initialize(number_of_threads);
  }
  ~BarrierTestUserData() = default;
};

ITK_THREAD_RETURN_FUNCTION_CALL_CONVENTION
BarrierTestIncrement(void * ptr)
{
  itk::ThreadIdType threadId = ((itk::MultiThreaderBase::WorkUnitInfo *)(ptr))->WorkUnitID;
  auto * data = static_cast<BarrierTestUserData *>(((itk::MultiThreaderBase::WorkUnitInfo *)(ptr))->UserData);

  for (unsigned int i = 0; i < data->m_NumberOfIterations; ++i)
  {
    // set the value for this iteration
    data->m_Counter[threadId] = i;

    // wait for all the other threads
    data->m_FirstBarrier->Wait();
    data->m_SecondBarrier->Wait();
  }

  return ITK_THREAD_RETURN_DEFAULT_VALUE;
}

ITK_THREAD_RETURN_FUNCTION_CALL_CONVENTION
BarrierCheckIncrement(void * ptr)
{
  auto * data = static_cast<BarrierTestUserData *>(((itk::MultiThreaderBase::WorkUnitInfo *)(ptr))->UserData);

  for (unsigned int i = 0; i < data->m_NumberOfIterations; ++i)
  {
    // Wait for other threads to populate the m_Counter array
    data->m_FirstBarrier->Wait();

    // Check the values in the m_Counter array
    for (unsigned int j = 0; j < data->m_NumberOfWorkUnits - 1; ++j)
    {
      if (data->m_Counter[j] != i)
      {
        data->m_TestFailure = true;
      }
    }
    data->m_SecondBarrier->Wait();
  }

  return ITK_THREAD_RETURN_DEFAULT_VALUE;
}

ITK_THREAD_RETURN_FUNCTION_CALL_CONVENTION
BarrierTestCallback(void * ptr)
{
  itk::ThreadIdType threadId = ((itk::MultiThreaderBase::WorkUnitInfo *)(ptr))->WorkUnitID;
  auto * data = static_cast<BarrierTestUserData *>(((itk::MultiThreaderBase::WorkUnitInfo *)(ptr))->UserData);

  if (threadId == data->m_NumberOfWorkUnits - 1)
  {
    BarrierCheckIncrement(ptr);
  }
  else
  {
    BarrierTestIncrement(ptr);
  }

  return ITK_THREAD_RETURN_DEFAULT_VALUE;
}

ITK_THREAD_RETURN_FUNCTION_CALL_CONVENTION
BarrierSpecialTest(void * ptr)
{
  auto * data = static_cast<BarrierTestUserData *>(((itk::MultiThreaderBase::WorkUnitInfo *)(ptr))->UserData);

  for (unsigned int j = 0; j < 1000; ++j)
  {
    data->m_FirstBarrier->Wait();
  }

  return ITK_THREAD_RETURN_DEFAULT_VALUE;
}

int
itkBarrierTest(int argc, char * argv[])
{
  itk::Barrier::Pointer barrier = itk::Barrier::New();
  ITK_EXERCISE_BASIC_OBJECT_METHODS(barrier, Barrier, LightObject);

  itk::ThreadIdType number_of_threads = 4;
  if (argc > 1)
  {
    number_of_threads = std::stoi(argv[1]);
  }

  BarrierTestUserData data(number_of_threads);

  try
  {
    itk::MultiThreaderBase::Pointer multithreader = itk::MultiThreaderBase::New();
    multithreader->SetMaximumNumberOfThreads(number_of_threads);
    if (multithreader->GetMaximumNumberOfThreads() < number_of_threads)
    {
      std::cerr << "Could not increase number of threads to " << number_of_threads << " in "
                << multithreader->GetNameOfClass() << std::endl;
      return EXIT_FAILURE;
    }

    multithreader->SetNumberOfWorkUnits(number_of_threads);
    multithreader->SetSingleMethod(BarrierTestCallback, &data);

    for (unsigned int i = 0; i < 5; ++i) // repeat test 5 times
    {
      multithreader->SingleMethodExecute();
    }

    // perform another test
    multithreader->SetSingleMethod(BarrierSpecialTest, &data);
    multithreader->SingleMethodExecute();
  }
  catch (const itk::ExceptionObject & e)
  {
    std::cerr << e << std::endl;
    return EXIT_FAILURE;
  }

  if (data.m_TestFailure == false)
  {
    std::cout << "[TEST PASSED]" << std::endl;
    return EXIT_SUCCESS;
  }
  else
  {
    std::cout << "[TEST FAILED]" << std::endl;
    return 2;
  }
}