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
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
|
/*
* ========================
* ===== ===============
* ====== ================
* ====== ================
* ====== ==== ==== ==
* ====== === == = =
* ====== === = == =
* = === === = == ====
* = === === = == = =
* == ===== ==== ==
* ========================
*
* SPDX-License-Identifier: BSD-3-Clause
*
* Copyright (c) 2023-2024, Joe
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
*
* 1. Redistributions of source code must retain the above copyright notice,
* this list of conditions and the following disclaimer.
*
* 2. Redistributions in binary form must reproduce the above copyright notice,
* this list of conditions and the following disclaimer in the documentation
* and/or other materials provided with the distribution.
*
* 3. Neither the name of the organization nor the names of its
* contributors may be used to endorse or promote products derived from
* this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ''AS IS''
* AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
* LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
* CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
* SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
* INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
* CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
* POSSIBILITY OF SUCH DAMAGE.
*
* hardflip: src/c_ldirs.go
* Tue Jan 09 12:06:44 2024
* Joe
*
* the directories linked list
*/
package main
import "fmt"
type DirsNode struct {
ID int
Name string
Parent *DirsNode
Depth uint16
lhost *HostList
next *DirsNode
}
type DirsList struct {
head *DirsNode
last *DirsNode
}
// adds a directory node to the list
func (ldirs *DirsList) add_back(node *DirsNode) {
if ldirs.head == nil {
ldirs.head = node
ldirs.last = ldirs.head
return
}
last := ldirs.last
node.ID = last.ID + 1
last.next = node
ldirs.last = last.next
}
// removes a dir node from the list
func (ldirs *DirsList) del(dir *DirsNode) {
if ldirs.head == nil {
return
}
if ldirs.head == dir {
ldirs.head = ldirs.head.next
if ldirs.head == nil {
ldirs.last = nil
return
}
for ptr := ldirs.head; ptr != nil; ptr = ptr.next {
ptr.ID -= 1
}
return
}
if ldirs.last == dir {
ptr := ldirs.head
for ptr.next != nil {
ptr = ptr.next
}
ldirs.last = ptr
ldirs.last.next = nil
return
}
ptr := ldirs.head
for ptr.next != nil && ptr.next != dir {
ptr = ptr.next
}
if ptr.next == dir {
ptr.next = ptr.next.next
}
for ptr := ptr.next; ptr != nil; ptr = ptr.next {
ptr.ID -= 1
}
}
// return the list node with the according id
func (ldirs *DirsList) sel(id int) *DirsNode {
curr := ldirs.head
if curr == nil {
return nil
}
for curr.next != nil && curr.ID != id {
curr = curr.next
}
if curr.ID != id {
return nil
}
return curr
}
// returns a string with the full path of the dir
func (dir *DirsNode) path() string {
var path string
if dir == nil {
return ""
}
curr := dir
for curr != nil {
path = curr.Name + "/" + path
curr = curr.Parent
}
return path
}
// returns the number of hosts of the dir
func (dir *DirsNode) count_hosts() int {
if dir.lhost.head == nil || dir.lhost.last == nil {
return 0
}
return dir.lhost.last.ID + 1
}
// return the number of hosts and subfolders of the dir
func (dir *DirsNode) count_elements(skip_folds bool,
folds map[*DirsNode]*ItemsList) int {
items := 0
items += dir.count_hosts()
for ptr := dir.next; ptr != nil && ptr.Depth > dir.Depth; ptr = ptr.next {
if lfold := folds[ptr]; skip_folds == true && lfold != nil {
count := lfold.last.ID - lfold.head.ID
fmt.Println(count)
// FIX: here
for i := 1; ptr != nil && i < count; i++ {
ptr = ptr.next
}
} else {
items += ptr.count_hosts() + 1
}
}
return items
}
|
