74 	struct hardlink_node *hl;  in hardlink_q_cleanup()  local
83 		hl = SLIST_FIRST(hl_q);  in hardlink_q_cleanup()
87 			    hl->inode);  in hardlink_q_cleanup()
92 		if (hl->is_tmp) {  in hardlink_q_cleanup()
93 			if (hl->path) {  in hardlink_q_cleanup()
95 				    hl->path);  in hardlink_q_cleanup()
96 				if (remove(hl->path)) {  in hardlink_q_cleanup()
102 				    hl->inode);  in hardlink_q_cleanup()
106 		if (hl->path)  in hardlink_q_cleanup()
107 			free(hl->path);  in hardlink_q_cleanup()
108 		free(hl);  in hardlink_q_cleanup()
123 	struct hardlink_node *hl;  in hardlink_q_get()  local
132 	SLIST_FOREACH(hl, hl_q, next_hardlink) {  in hardlink_q_get()
135 			    hl->inode);  in hardlink_q_get()
137 		if (hl->inode != inode)  in hardlink_q_get()
141 			*offset = hl->offset;  in hardlink_q_get()
144 			*path = hl->path;  in hardlink_q_get()
161 	struct hardlink_node *hl;  in hardlink_q_add()  local
177 	hl = (struct hardlink_node *)malloc(sizeof (struct hardlink_node));  in hardlink_q_add()
178 	if (!hl)  in hardlink_q_add()
181 	hl->inode = inode;  in hardlink_q_add()
182 	hl->offset = offset;  in hardlink_q_add()
183 	hl->is_tmp = is_tmp_file;  in hardlink_q_add()
185 		hl->path = strdup(path);  in hardlink_q_add()
187 		hl->path = NULL;  in hardlink_q_add()
192 		    hl->inode, hl->path, hl->path? hl->path : "(--)");  in hardlink_q_add()
194 	SLIST_INSERT_HEAD(hl_q, hl, next_hardlink);  in hardlink_q_add()
202 	struct hardlink_node *hl;  in hardlink_q_dump()  local
209 	SLIST_FOREACH(hl, hl_q, next_hardlink)  in hardlink_q_dump()  local
212 		    hl->inode, hl->offset, hl->path? hl->path : "--",  in hardlink_q_dump()
213 		    hl->is_tmp);  in hardlink_q_dump()