24 Plus->uplist.n_uplines = 0;
36 G_debug(3,
"dig_line_add_updated(): line = %d", line);
44 for (i = 0; i <
Plus->uplist.n_uplines; i++) {
45 if (
Plus->uplist.uplines[i] == line) {
53 if (
Plus->uplist.n_uplines ==
Plus->uplist.alloc_uplines) {
54 Plus->uplist.alloc_uplines += 1000;
56 Plus->uplist.uplines,
Plus->uplist.alloc_uplines *
sizeof(
int));
57 Plus->uplist.uplines_offset =
59 Plus->uplist.alloc_uplines *
sizeof(
off_t));
62 Plus->uplist.uplines[
Plus->uplist.n_uplines] = line;
63 Plus->uplist.uplines_offset[
Plus->uplist.n_uplines] = offset;
64 Plus->uplist.n_uplines++;
74 Plus->uplist.n_upnodes = 0;
87 G_debug(3,
"dig_node_add_updated(): node = %d", node);
90 for (i = 0; i <
Plus->uplist.n_upnodes; i++) {
91 if (
abs(
Plus->uplist.upnodes[i]) ==
abs(node)) {
98 if (
Plus->uplist.n_upnodes ==
Plus->uplist.alloc_upnodes) {
99 Plus->uplist.alloc_upnodes += 1000;
101 Plus->uplist.upnodes,
Plus->uplist.alloc_upnodes *
sizeof(
int));
104 Plus->uplist.upnodes[
Plus->uplist.n_upnodes] = node;
105 Plus->uplist.n_upnodes++;
int G_debug(int, const char *,...) __attribute__((format(printf
Basic topology-related info.
void dig_line_add_updated(struct Plus_head *Plus, int line, off_t offset)
Add new line to updated.
void dig_node_reset_updated(struct Plus_head *Plus)
Reset number of updated nodes.
void dig_line_reset_updated(struct Plus_head *Plus)
Reset number of updated lines.
void dig_node_add_updated(struct Plus_head *Plus, int node)
Add node to updated.