blob: 97cf51613d7706cd5689c255a292d08c5e310dae (
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
|
/* IBM_PROLOG_BEGIN_TAG */
/* This is an automatically generated prolog. */
/* */
/* $Source: src/usr/diag/attn/attnlistutil.H $ */
/* */
/* IBM CONFIDENTIAL */
/* */
/* COPYRIGHT International Business Machines Corp. 2012 */
/* */
/* 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 otherwise */
/* divested of its trade secrets, irrespective of what has been */
/* deposited with the U.S. Copyright Office. */
/* */
/* Origin: 30 */
/* */
/* IBM_PROLOG_END_TAG */
#ifndef __ATTN_ATTNLISTUTIL_H
#define __ATTN_ATTNLISTUTIL_H
/**
* @file attnlistutil.H
*
* @brief HBATTN AttentionList utility type definitions.
*/
#include "attnfwd.H"
#include "attnops.H"
namespace ATTN
{
/**
* @brief MaskFunct Mask attentions functor.
*/
struct MaskFunct
{
errlHndl_t err;
MaskFunct() : err(0) {}
void operator()(const Attention & i_attn)
{
if(!err)
{
err = i_attn.mask();
}
}
};
/**
* @brief UnmaskFunct Unmask attentions functor.
*/
struct UnmaskFunct
{
errlHndl_t err;
UnmaskFunct() : err(0) {}
void operator()(const Attention & i_attn)
{
if(!err)
{
err = i_attn.unmask();
}
}
};
/**
* @brief ClearedPredicate Attention query predicate.
*/
struct ClearedPredicate
{
errlHndl_t err;
ClearedPredicate() : err(0) {}
bool operator()(const Attention & i_attn)
{
bool attnIsOn = false, condition = false;
if(!err)
{
err = i_attn.query(attnIsOn);
if(!err && !attnIsOn)
{
condition = true;
}
}
return condition;
}
};
}
#endif
|
