auparse/normalize-llist.c - master - githubmirror/audit-userspace

auparse/normalize-llist.c
90 строк2 KB
Steve Grubb
cllist_append append improvement
19 июн 2025, 19:31
19 июн 2025, 19:311a483c7
/*
 * normalize-llist.c - Minimal linked list library
 * Copyright (c) 2016-17 Red Hat Inc.
 * 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>
 */

#include <stdlib.h>
#include "normalize-llist.h"

void cllist_create(cllist *l, void (*cleanup)(void *))
{
	l->head = NULL;
	l->cur = NULL;
	l->tail = NULL;
	l->cleanup = cleanup;
	l->cnt = 0;
}

void cllist_clear(cllist *l)
{
	data_node *nextnode;
	register data_node *current;

	if (l == NULL)
		return;

	current = l->head;
	while (current) {
		nextnode = current->next;
		if (l->cleanup)
			l->cleanup(current->data);
		free(current);
		current=nextnode;
	}
	l->head = NULL;
	l->cur = NULL;
	l->tail = NULL;
	l->cnt = 0;
}

data_node *cllist_next(cllist *l)
{
	if (l->cur == NULL)
		return NULL;
	l->cur = l->cur->next;
	return l->cur;
}

// Returns 0 on success and 1 on error
int cllist_append(cllist *l, uint32_t num, void *data)
{
	data_node *newnode;

	newnode = malloc(sizeof(data_node));
	if (newnode == NULL)
		return 1;

	newnode->num = num;
	newnode->data = data;
	newnode->next = NULL;

	// if we are at top, fix this up
	if (l->head == NULL)
		l->head = newnode;
	else	// Otherwise add pointer to newnode
		l->tail->next = newnode;

	// update tail and make newnode current
	l->tail = newnode;
	l->cur = newnode;
	l->cnt++;
	return 0;
}