blob: 2ea7f6357fe69938833e7a76e32d025d8f021e7c (
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
|
/*
* nvpair.h - Header file for nvpair.c
* Copyright (c) 2007-08 Red Hat Inc., Durham, North Carolina.
* All Rights Reserved.
*
* 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
*
* Authors:
* Steve Grubb <sgrubb@redhat.com>
*/
#ifndef NVPAIR_HEADER
#define NVPAIR_HEADER
#include "config.h"
#include "private.h"
#include <sys/types.h>
/* This is the node of the linked list. Any data elements that are
* per item goes here. */
typedef struct _nvpnode{
char *name; // The name string
long val; // The value field
struct _nvpnode* next; // Next nvpair node pointer
} nvpnode;
/* This is the linked list head. Only data elements that are 1 per
* event goes here. */
typedef struct {
nvpnode *head; // List head
nvpnode *cur; // Pointer to current node
unsigned int cnt; // How many items in this list
} nvpair;
void nvpair_create(nvpair *l) hidden;
static inline void nvpair_first(nvpair *l) { l->cur = l->head; }
static inline nvpnode *nvpair_get_cur(nvpair *l) { return l->cur; }
void nvpair_append(nvpair *l, nvpnode *node) hidden;
void nvpair_clear(nvpair *l) hidden;
int nvpair_find_val(nvpair *l, long val) hidden;
#endif
|
