blob: b5587b4cd4977ee635970ac5c7db723b8c060dbc (
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
|
// IBM_PROLOG_BEGIN_TAG
// This is an automatically generated prolog.
//
// $Source: src/include/kernel/barrier.H $
//
// IBM CONFIDENTIAL
//
// COPYRIGHT International Business Machines Corp. 2011
//
// p1
//
// Object Code Only (OCO) source materials
// Licensed Internal Code Source Materials
// IBM HostBoot Licensed Internal Code
//
// The source code for this program is not published or other-
// wise divested of its trade secrets, irrespective of what has
// been deposited with the U.S. Copyright Office.
//
// Origin: 30
//
// IBM_PROLOG_END
#ifndef __KERNEL_BARRIER_H
#define __KERNEL_BARRIER_H
#include <kernel/spinlock.H>
#include <stdint.h>
/**
* Barrier to be used in kernel space
*/
class Barrier
{
public:
/**
* Default Constructor
*/
Barrier() :
iv_count(0),
iv_event(0),
iv_missing(0) {};
/**
* Construct and init a barrier
* @param[in] i_count number of cpus to wait on
*/
Barrier(size_t i_count) :
iv_count(i_count),
iv_event(0),
iv_missing(i_count) {}
/**
* Initialize the barrier
* @param[in] i_count number of cpus to wait on
*/
void init(size_t i_count)
{
iv_count = i_count;
iv_missing = i_count;
}
/**
* Wait until all threads have been arrived
*/
void wait();
private:
Spinlock iv_spinlock; //!< Spinlock acts as mutex
volatile size_t iv_count; //!< Barrier thread count
volatile size_t iv_event; //!< Barrier event
volatile size_t iv_missing; //!< # of missing threads to wait for
};
#endif
|
