1 /************************************************************************
2 Copyright (c) 2015, The Linux Foundation. All rights reserved.
3
4 Redistribution and use in source and binary forms, with or without
5 modification, are permitted provided that the following conditions are
6 met:
7 * Redistributions of source code must retain the above copyright
8 notice, this list of conditions and the following disclaimer.
9 * Redistributions in binary form must reproduce the above
10 copyright notice, this list of conditions and the following
11 disclaimer in the documentation and/or other materials provided
12 with the distribution.
13 * Neither the name of The Linux Foundation nor the names of its
14 contributors may be used to endorse or promote products derived
15 from this software without specific prior written permission.
16
17 THIS SOFTWARE IS PROVIDED "AS IS" AND ANY EXPRESS OR IMPLIED
18 WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
19 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NON-INFRINGEMENT
20 ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
21 BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
22 CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
23 SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR
24 BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
25 WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
26 OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN
27 IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
28 ************************************************************************/
29
30 /**
31 * @file datatop_linked_list.c
32 * @brief Necessary linked_list functions created.
33 *
34 * Holds function which adds to or creates a linked list
35 * used for storing dtop_data_point_gatherer's (dpg's).
36 * Datapoints are stored in linked list for ability to
37 * iteratively poll and print efficiently. Handles creation
38 * and deletion of memory for linked list nodes.
39 */
40
41 #include <stdio.h>
42 #include <string.h>
43 #include <stdlib.h>
44
45 #include "datatop_linked_list.h"
46
47 /**
48 * @brief Adds a node to the beginning of a linked list.
49 *
50 * @param data A void pointer which can hold any data in the node.
51 * @param list The list that is added to.
52 * @return Updated linked list struct.
53 */
dtop_add_linked_list(void * data,struct dtop_linked_list * list)54 struct dtop_linked_list *dtop_add_linked_list(void *data,
55 struct dtop_linked_list *list)
56 {
57 struct dtop_linked_list *list_node;
58 list_node = malloc(sizeof(struct dtop_linked_list));
59
60 if (!list_node) {
61 fprintf(stderr, "failed to allocate memory.\n");
62 exit(EXIT_FAILURE);
63 }
64
65 list_node->data = data;
66 list_node->next_ptr = list;
67 list = list_node;
68 return list;
69 }
70
71 /**
72 * @brief Deletes a linked list.
73 *
74 * @param head_ptr Pointer to the first node in the linked list that is to be deleted.
75 */
dtop_rem_linked_list(struct dtop_linked_list * head_ptr)76 void dtop_rem_linked_list(struct dtop_linked_list *head_ptr)
77 {
78 struct dtop_linked_list *tmp_ptr = NULL;
79 while (head_ptr) {
80 tmp_ptr = head_ptr;
81 head_ptr = head_ptr->next_ptr;
82 free(tmp_ptr);
83 }
84 }
85