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
|
/**
* PLL (version 1.0.0) a software library for phylogenetic inference
* Copyright (C) 2013 Tomas Flouri and Alexandros Stamatakis
*
* Derived from
* RAxML-HPC, a program for sequential and parallel estimation of phylogenetic
* trees by Alexandros Stamatakis
*
* 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 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 General Public License along with
* this program. If not, see <http://www.gnu.org/licenses/>.
*
* For any other enquiries send an Email to Tomas Flouri
* Tomas.Flouri@h-its.org
*
* When publishing work that uses PLL please cite PLL
*
* @file stack.c
* @brief Generic stack implementation
*
* Detailed description to appear soon.
*/
#include <stdio.h>
#include "stack.h"
#include "mem_alloc.h"
int pllStackSize (pllStack ** stack)
{
pllStack * top;
int size = 0;
top = *stack;
while (top)
{
++ size;
top = top->next;
}
return (size);
}
int
pllStackPush (pllStack ** head, void * item)
{
pllStack * new;
new = (pllStack *) rax_malloc (sizeof (pllStack));
if (!new) return (0);
new->item = item;
new->next = *head;
*head = new;
return (1);
}
void * pllStackPop (pllStack ** head)
{
void * item;
pllStack * tmp;
if (!*head) return (NULL);
tmp = (*head);
item = (*head)->item;
(*head) = (*head)->next;
rax_free (tmp);
return (item);
}
void
pllStackClear (pllStack ** stack)
{
while (*stack) pllStackPop (stack);
}
|
