Lines Matching defs:node
19 struct hard_link_node *node = NULL, *tmp = NULL, *prev = NULL;
21 node = calloc(sizeof(struct hard_link_node), 1);
22 ASSERT(node != NULL);
24 node->nid = nid;
25 node->links = link_cnt;
26 node->next = NULL;
29 fsck->hard_link_list_head = node;
43 node->next = tmp;
44 fsck->hard_link_list_head = node;
46 prev->next = node;
47 node->next = tmp;
58 struct hard_link_node *node = NULL, *prev = NULL;
65 node = fsck->hard_link_list_head;
67 while (node && (nid < node->nid)) {
68 prev = node;
69 node = node->next;
72 if (node == NULL || (nid != node->nid)) {
78 node->links = node->links - 1;
80 /* if link count becomes one, remove the node */
81 if (node->links == 1) {
82 if (fsck->hard_link_list_head == node)
83 fsck->hard_link_list_head = node->next;
85 prev->next = node->next;
86 free(node);
102 ASSERT_MSG(0, "Summary footer is not a node segment summary\n");;
112 DBG(0, "--> node block's nid [0x%x]\n", nid);
113 ASSERT_MSG(0, "Invalid node seg summary\n");
116 /* current node segment has no ssa */
143 DBG(0, "idx in parent node [0x%x]\n", idx_in_node);
223 DBG(0, "Duplicated node block. ino[0x%x][0x%x]\n", nid, ni.blk_addr);
283 /* Orphan node. i_links should be 0 */
304 /* First time. Create new hard link node */
310 DBG(0, "Error. Node ID [0x%x]."
321 /* No need to go deep into the node */
353 /* check node blocks in inode */
703 ASSERT_MSG(0, "Duplicated node block for x_attr. "
744 struct hard_link_node *node = NULL;
756 node = fsck->hard_link_list_head;
757 while (node) {
759 node->nid, node->links);
760 node = node->next;
