40 lines
1.1 KiB
C
40 lines
1.1 KiB
C
|
/* Copyright (C) 2024 Peter McGoron
|
||
|
*
|
||
|
* This program 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 3 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 Lesser General Public
|
||
|
* License along with this program. If not, see
|
||
|
* <https://www.gnu.org/licenses/>.
|
||
|
*/
|
||
|
|
||
|
#include "uns.h"
|
||
|
|
||
|
void uns_root_add(struct uns_gc *gc, struct uns_root_list *root)
|
||
|
{
|
||
|
root->prev = NULL;
|
||
|
root->next = gc->roots;
|
||
|
gc->roots = root;
|
||
|
}
|
||
|
|
||
|
void uns_root_remove(struct uns_gc *gc, struct uns_root_list *root)
|
||
|
{
|
||
|
if (root->prev) {
|
||
|
root->prev->next = root->next;
|
||
|
}
|
||
|
if (root->next) {
|
||
|
root->next->prev = root->prev;
|
||
|
}
|
||
|
|
||
|
if (gc->roots == root)
|
||
|
gc->roots = root->next;
|
||
|
root->prev = root->next = NULL;
|
||
|
}
|