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
|
/*
* active port forwarder - software for secure forwarding
* Copyright (C) 2003-2007 jeremian <jeremian [at] poczta.fm>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* 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. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
*/
#include <config.h>
#include <stdlib.h>
#include <assert.h>
#include "task_list_node_struct.h"
/*
* Function name: TaskListNode_new
* Description: Creates and initializes new task list node. The task must point
* at previously allocated Task structure.
* Arguments: task - pointer to Task structure, which must be previously initialized
* Returns: Pointer to newly created TaskListNode structure.
*/
TaskListNode*
TaskListNode_new(Task* task)
{
TaskListNode* tmp = calloc(1, sizeof(TaskListNode));
assert(task != NULL);
if (task == NULL) {
return NULL;
}
assert(tmp != NULL);
if (tmp == NULL) {
return NULL;
}
tmp->task = task;
return tmp;
}
/*
* Function name: TaskListNode_free
* Description: Frees the memory allocated for TaskListNode structure.
* Arguments: node - pointer to pointer to TaskListNode structure
*/
void
TaskListNode_free(TaskListNode** node)
{
assert(node != NULL);
if (node == NULL) {
return;
}
assert((*node) != NULL);
if ((*node) == NULL) {
return;
}
free((*node));
(*node) = NULL;
}
/*
* Function name: TaskListNode_set_next
* Description: Sets the next pointer of the task list node.
* Arguments: node - pointer to TaskListNode structure
* next - the new next pointer
*/
void
TaskListNode_set_next(TaskListNode* node, TaskListNode* next)
{
assert(node != NULL);
if (node == NULL) {
return;
}
node->next = next;
}
/*
* Function name: TaskListNode_set_previous
* Description: Sets the previous pointer of the task list node.
* Arguments: node - pointer to TaskListNode structure
* next - the new previous pointer
*/
void
TaskListNode_set_previous(TaskListNode* node, TaskListNode* previous)
{
assert(node != NULL);
if (node == NULL) {
return;
}
node->previous = previous;
}
/*
* Function name: TaskListNode_get_task
* Description: Returns the task contained in this node.
* Arguments: node - pointer to TaskListNode structure
* Returns: The task contained in this node.
*/
Task*
TaskListNode_get_task(TaskListNode* node)
{
assert(node != NULL);
if (node == NULL) {
return NULL;
}
return node->task;
}
|
