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
|
/* -*- linux-c -*-
*
* (C) Copyright IBM Corp. 2003-2006
* Copyright (c) 2003 by Intel Corp.
*
* This program 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. This
* file and program are licensed under a BSD style license. See
* the Copying file included with the OpenHPI distribution for
* full licensing terms.
*
* Authors:
* David Ashley <dashley@us.ibm.com>
* Renier Morales <renier@openhpi.org>
*/
#include <stdio.h>
#include <stdlib.h>
#include <glib.h>
#include <fcntl.h>
#include <string.h>
#include <unistd.h>
#include <time.h>
#include <SaHpi.h>
#include <oh_utils.h>
#include <oh_error.h>
/* allocate and initialize an announcement list */
oh_announcement *oh_announcement_create(void)
{
oh_announcement *ann;
ann = (oh_announcement *)g_malloc0(sizeof(oh_announcement));
if (ann != NULL) {
ann->nextId = SAHPI_OLDEST_ENTRY + 1; // always start at 1
ann->annentries = NULL;
}
return ann;
}
/* close and free all memory associated with an announcement list */
SaErrorT oh_announcement_close(oh_announcement *ann)
{
if (ann == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
oh_announcement_clear(ann);
g_free(ann);
return SA_OK;
}
/* append a new entry to the announcement list */
SaErrorT oh_announcement_append(oh_announcement *ann, SaHpiAnnouncementT *myann)
{
oh_ann_entry *entry;
time_t tt1;
/* check for valid el params and state */
if (ann == NULL || myann == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
/* alloc and copy the new entry */
entry = (oh_ann_entry *) g_malloc0(sizeof(oh_ann_entry));
if (entry == NULL) {
return SA_ERR_HPI_OUT_OF_SPACE;
}
memcpy(&entry->annentry, myann, sizeof(SaHpiAnnouncementT));
/* initialize the struct and append the new entry */
entry->annentry.EntryId = ann->nextId++;
time(&tt1);
entry->annentry.Timestamp = ((SaHpiTimeT) tt1) * 1000000000;
entry->annentry.AddedByUser = TRUE;
ann->annentries = g_list_append(ann->annentries, entry);
/* copy the new generated info back to the user's announcement */
memcpy(myann, &entry->annentry, sizeof(SaHpiAnnouncementT));
return SA_OK;
}
/* clear all announcement entries */
SaErrorT oh_announcement_clear(oh_announcement *ann)
{
GList *temp;
if (ann == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
/* free the list data elements */
temp = g_list_first(ann->annentries);
while (temp != NULL) {
g_free(temp->data);
temp = g_list_next(temp);
}
/* free the list nodes */
g_list_free(ann->annentries);
/* reset the control structure */
ann->nextId = SAHPI_OLDEST_ENTRY + 1; // always start at 1
ann->annentries = NULL;
return SA_OK;
}
/* get an announcement entry */
SaErrorT oh_announcement_get(oh_announcement *ann, SaHpiEntryIdT srchid,
SaHpiAnnouncementT *entry)
{
oh_ann_entry *myentry;
GList *annlist;
if (ann == NULL || entry == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
annlist = g_list_first(ann->annentries);
if (annlist == NULL) return SA_ERR_HPI_NOT_PRESENT;
if (srchid == SAHPI_FIRST_ENTRY && annlist != NULL) {
myentry = (oh_ann_entry *) annlist->data;
memcpy(entry, &myentry->annentry, sizeof(SaHpiAnnouncementT));
return SA_OK;
}
if (srchid == SAHPI_LAST_ENTRY && annlist != NULL) {
annlist = g_list_last(ann->annentries);
myentry = (oh_ann_entry *) annlist->data;
memcpy(entry, &myentry->annentry, sizeof(SaHpiAnnouncementT));
return SA_OK;
}
while (annlist != NULL) {
myentry = (oh_ann_entry *) annlist->data;
if (srchid == myentry->annentry.EntryId) {
memcpy(entry, &myentry->annentry, sizeof(SaHpiAnnouncementT));
return SA_OK;
}
annlist = g_list_next(annlist);
}
return SA_ERR_HPI_NOT_PRESENT;
}
/* get next announcement entry */
SaErrorT oh_announcement_get_next(oh_announcement *ann, SaHpiSeverityT sev,
SaHpiBoolT ack, SaHpiAnnouncementT *entry)
{
GList *annlist = NULL;
if (ann == NULL || entry == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
if (entry->EntryId == SAHPI_FIRST_ENTRY) {
annlist = ann->annentries; /* start search at beginning */
} else {
/* find the previous matching entry */
for (annlist = ann->annentries;
annlist; annlist = annlist->next) {
oh_ann_entry *annentry = annlist->data;
if (entry->EntryId == annentry->annentry.EntryId) {
if (entry->Timestamp ==
annentry->annentry.Timestamp) {
break;
} else {
return SA_ERR_HPI_INVALID_DATA;
}
}
}
/* Set list node for searching for next matching entry */
if (annlist)
annlist = g_list_next(annlist);
else {
dbg("Did not find previous entry."
" Searching from first one.");
annlist = g_list_first(ann->annentries);
}
}
/* Find the matching entry based on severity and ack */
for (; annlist; annlist = annlist->next) {
oh_ann_entry *annentry = annlist->data;
if (annentry && (sev == SAHPI_ALL_SEVERITIES ||
sev == annentry->annentry.Severity) &&
(ack ? !annentry->annentry.Acknowledged : 1)) {
dbg("Severity searched for is %d."
" Severity found is %d",
sev, annentry->annentry.Severity);
*entry = annentry->annentry;
return SA_OK;
}
}
return SA_ERR_HPI_NOT_PRESENT;
}
SaErrorT oh_announcement_ack(oh_announcement *ann, SaHpiEntryIdT srchid,
SaHpiSeverityT sev)
{
oh_ann_entry *myentry;
GList *annlist;
if (ann == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
/* Search for one announcement if entryid is specified */
if (srchid != SAHPI_ENTRY_UNSPECIFIED) {
annlist = g_list_first(ann->annentries);
while (annlist != NULL) {
myentry = (oh_ann_entry *) annlist->data;
if (srchid == myentry->annentry.EntryId) {
myentry->annentry.Acknowledged = TRUE;
return SA_OK;
}
annlist = g_list_next(annlist);
}
return SA_ERR_HPI_NOT_PRESENT;
}
/* EntryId not specified, so ack announcements which have the specified severity */
annlist = g_list_first(ann->annentries);
if (annlist == NULL) return SA_OK;
while (annlist != NULL) {
myentry = (oh_ann_entry *) annlist->data;
if (sev == SAHPI_ALL_SEVERITIES ||
sev == myentry->annentry.Severity) {
myentry->annentry.Acknowledged = TRUE;
}
annlist = g_list_next(annlist);
}
return SA_OK;
}
SaErrorT oh_announcement_del(oh_announcement *ann, SaHpiEntryIdT srchid,
SaHpiSeverityT sev)
{
oh_ann_entry *myentry;
GList *annlist;
if (ann == NULL) {
return SA_ERR_HPI_INVALID_PARAMS;
}
/* Search for one announcement if entryid is specified */
if (srchid != SAHPI_ENTRY_UNSPECIFIED) {
annlist = g_list_first(ann->annentries);
while (annlist != NULL) {
myentry = (oh_ann_entry *) annlist->data;
if (srchid == myentry->annentry.EntryId) {
free(annlist->data);
ann->annentries =
g_list_remove(ann->annentries, myentry);
return SA_OK;
}
annlist = g_list_next(annlist);
}
return SA_ERR_HPI_NOT_PRESENT;
}
/* remove all announcements with a specified severity */
annlist = g_list_first(ann->annentries);
if (annlist == NULL) return SA_OK;
while (annlist != NULL) {
myentry = (oh_ann_entry *) annlist->data;
if (sev == SAHPI_ALL_SEVERITIES ||
sev == myentry->annentry.Severity) {
free(annlist->data);
ann->annentries = g_list_remove(ann->annentries, myentry);
annlist = g_list_first(ann->annentries);
} else {
annlist = g_list_next(annlist);
}
}
return SA_OK;
}
|
