• Home
  • Raw
  • Download

Lines Matching refs:de

13 	struct hpfs_dirent *de;  in get_pos()  local
16 for (de = dnode_first_de(d); de < de_end; de = de_next_de(de)) { in get_pos()
17 if (de == fde) return ((loff_t) d->self << 4) | (loff_t)i; in get_pos()
111 struct hpfs_dirent *de, *de_end, *dee = NULL, *deee = NULL; in dnode_pre_last_de() local
113 for (de = dnode_first_de(d); de < de_end; de = de_next_de(de)) { in dnode_pre_last_de()
114 deee = dee; dee = de; in dnode_pre_last_de()
121 struct hpfs_dirent *de, *de_end, *dee = NULL; in dnode_last_de() local
123 for (de = dnode_first_de(d); de < de_end; de = de_next_de(de)) { in dnode_last_de()
124 dee = de; in dnode_last_de()
131 struct hpfs_dirent *de; in set_last_pointer() local
132 if (!(de = dnode_last_de(d))) { in set_last_pointer()
137 if (de->down) { in set_last_pointer()
139 d->self, de_down_pointer(de)); in set_last_pointer()
142 if (de->length != 32) { in set_last_pointer()
153 de->length = 36; in set_last_pointer()
154 de->down = 1; in set_last_pointer()
155 *(dnode_secno *)((char *)de + 32) = ptr; in set_last_pointer()
164 struct hpfs_dirent *de; in hpfs_add_de() local
167 for (de = dnode_first_de(d); de < de_end; de = de_next_de(de)) { in hpfs_add_de()
168 int c = hpfs_compare_names(s, name, namelen, de->name, de->namelen, de->last); in hpfs_add_de()
175 memmove((char *)de + d_size, de, (char *)de_end - (char *)de); in hpfs_add_de()
176 memset(de, 0, d_size); in hpfs_add_de()
178 *(int *)((char *)de + d_size - 4) = down_ptr; in hpfs_add_de()
179 de->down = 1; in hpfs_add_de()
181 de->length = d_size; in hpfs_add_de()
182 if (down_ptr) de->down = 1; in hpfs_add_de()
183 de->not_8x3 = hpfs_is_name_long(name, namelen); in hpfs_add_de()
184 de->namelen = namelen; in hpfs_add_de()
185 memcpy(de->name, name, namelen); in hpfs_add_de()
187 return de; in hpfs_add_de()
193 struct hpfs_dirent *de) in hpfs_delete_de() argument
195 if (de->last) { in hpfs_delete_de()
199 d->first_free -= de->length; in hpfs_delete_de()
200 memmove(de, de_next_de(de), d->first_free + (char *)d - (char *)de); in hpfs_delete_de()
205 struct hpfs_dirent *de; in fix_up_ptrs() local
208 for (de = dnode_first_de(d); de < de_end; de = de_next_de(de)) in fix_up_ptrs()
209 if (de->down) { in fix_up_ptrs()
212 if ((dd = hpfs_map_dnode(s, de_down_pointer(de), &qbh))) { in fix_up_ptrs()
232 struct hpfs_dirent *de; in hpfs_add_to_dnode() local
266 copy_de(de=hpfs_add_de(i->i_sb, d, name, namelen, down_ptr), new_de); in hpfs_add_to_dnode()
267 t = get_pos(d, de); in hpfs_add_to_dnode()
289 copy_de(de = hpfs_add_de(i->i_sb, nd, name, namelen, down_ptr), new_de); in hpfs_add_to_dnode()
290 for_all_poss(i, hpfs_pos_ins, get_pos(nd, de), 1); in hpfs_add_to_dnode()
302 for (de = dnode_first_de(nd); (char *)de_next_de(de) - (char *)nd < h; de = de_next_de(de)) { in hpfs_add_to_dnode()
303 copy_de(hpfs_add_de(i->i_sb, ad, de->name, de->namelen, de->down ? de_down_pointer(de) : 0), de); in hpfs_add_to_dnode()
307 copy_de(new_de = &nde, de); in hpfs_add_to_dnode()
308 memcpy(name = nname, de->name, namelen = de->namelen); in hpfs_add_to_dnode()
311 set_last_pointer(i->i_sb, ad, de->down ? de_down_pointer(de) : 0); in hpfs_add_to_dnode()
312 de = de_next_de(de); in hpfs_add_to_dnode()
313 memmove((char *)nd + 20, de, nd->first_free + (char *)nd - (char *)de); in hpfs_add_to_dnode()
314 nd->first_free -= (char *)de - (char *)nd - 20; in hpfs_add_to_dnode()
376 struct hpfs_dirent *de, *de_end; in hpfs_add_dirent() local
387 for (de = dnode_first_de(d); de < de_end; de = de_next_de(de)) { in hpfs_add_dirent()
388 if (!(c = hpfs_compare_names(i->i_sb, name, namelen, de->name, de->namelen, de->last))) { in hpfs_add_dirent()
393 if (de->down) { in hpfs_add_dirent()
394 dno = de_down_pointer(de); in hpfs_add_dirent()
425 struct hpfs_dirent *de, *nde; in move_to_top() local
444 if (!(de = dnode_last_de(dnode))) { in move_to_top()
449 if (!de->down) break; in move_to_top()
450 dno = de_down_pointer(de); in move_to_top()
453 while (!(de = dnode_pre_last_de(dnode))) { in move_to_top()
467 de = dnode_last_de(dnode); in move_to_top()
468 if (!de || !de->down) { in move_to_top()
474 de->length -= 4; in move_to_top()
475 de->down = 0; in move_to_top()
479 t = get_pos(dnode, de); in move_to_top()
482 if (!(nde = kmalloc(de->length, GFP_NOFS))) { in move_to_top()
487 memcpy(nde, de, de->length); in move_to_top()
488 ddno = de->down ? de_down_pointer(de) : 0; in move_to_top()
489 hpfs_delete_de(i->i_sb, dnode, de); in move_to_top()
511 struct hpfs_dirent *de; in delete_empty_dnode() local
521 de = dnode_first_de(dnode); in delete_empty_dnode()
522 down = de->down ? de_down_pointer(de) : 0; in delete_empty_dnode()
561 for (de = dnode_first_de(dnode); de < de_end; de = de_next_de(de), p++) in delete_empty_dnode()
562 if (de->down) if (de_down_pointer(de) == dno) goto fnd; in delete_empty_dnode()
568 de->down = 0; in delete_empty_dnode()
569 de->length -= 4; in delete_empty_dnode()
571 memmove(de_next_de(de), (char *)de_next_de(de) + 4, in delete_empty_dnode()
572 (char *)dnode + dnode->first_free - (char *)de_next_de(de)); in delete_empty_dnode()
576 *(dnode_secno *) ((void *) de + de->length - 4) = down; in delete_empty_dnode()
588 if (!de->last) { in delete_empty_dnode()
589 struct hpfs_dirent *de_next = de_next_de(de); in delete_empty_dnode()
595 if (!(de_cp = kmalloc(de->length, GFP_NOFS))) { in delete_empty_dnode()
599 memcpy(de_cp, de, de->length); in delete_empty_dnode()
600 hpfs_delete_de(i->i_sb, dnode, de); in delete_empty_dnode()
676 if (down) if ((d1 = hpfs_map_dnode(i->i_sb, de_down_pointer(de), &qbh1))) { in delete_empty_dnode()
695 int hpfs_remove_dirent(struct inode *i, dnode_secno dno, struct hpfs_dirent *de, in hpfs_remove_dirent() argument
702 if (de->first || de->last) { in hpfs_remove_dirent()
707 if (de->down) down = de_down_pointer(de); in hpfs_remove_dirent()
708 if (depth && (de->down || (de == dnode_first_de(dnode) && de_next_de(de)->last))) { in hpfs_remove_dirent()
718 for_all_poss(i, hpfs_pos_del, (t = get_pos(dnode, de)) + 1, 1); in hpfs_remove_dirent()
719 hpfs_delete_de(i->i_sb, dnode, de); in hpfs_remove_dirent()
739 struct hpfs_dirent *de; in hpfs_count_dnodes() local
752 de = dnode_first_de(dnode); in hpfs_count_dnodes()
754 if (de->down) if (de_down_pointer(de) == ptr) goto process_de; in hpfs_count_dnodes()
755 if (de->last) { in hpfs_count_dnodes()
761 de = de_next_de(de); in hpfs_count_dnodes()
764 if (de->down) { in hpfs_count_dnodes()
766 dno = de_down_pointer(de); in hpfs_count_dnodes()
771 if (!de->first && !de->last && de->directory && n_subdirs) (*n_subdirs)++; in hpfs_count_dnodes()
772 if (!de->first && !de->last && n_items) (*n_items)++; in hpfs_count_dnodes()
773 if ((de = de_next_de(de)) < dnode_end_de(dnode)) goto next_de; in hpfs_count_dnodes()
791 struct hpfs_dirent *de, *de_end; in map_nth_dirent() local
796 de = dnode_first_de(dnode); in map_nth_dirent()
798 for (i = 1; de < de_end; i++, de = de_next_de(de)) { in map_nth_dirent()
800 return de; in map_nth_dirent()
802 if (de->last) break; in map_nth_dirent()
814 struct hpfs_dirent *de; in hpfs_de_as_down_as_possible() local
821 if (!(de = map_nth_dirent(s, d, 1, &qbh, NULL))) return dno; in hpfs_de_as_down_as_possible()
825 if (!de->down) { in hpfs_de_as_down_as_possible()
830 d = de_down_pointer(de); in hpfs_de_as_down_as_possible()
841 struct hpfs_dirent *de, *d; in map_pos_dirent() local
851 if (!(de = map_nth_dirent(inode->i_sb, dno, pos, qbh, &dnode))) in map_pos_dirent()
855 if ((d = de_next_de(de)) < dnode_end_de(dnode)) { in map_pos_dirent()
867 return de; in map_pos_dirent()
885 return de; in map_pos_dirent()
895 return de; in map_pos_dirent()
904 struct hpfs_dirent *de; in map_dirent() local
915 for (de = dnode_first_de(dnode); de < de_end; de = de_next_de(de)) { in map_dirent()
916 int t = hpfs_compare_names(inode->i_sb, name, len, de->name, de->namelen, de->last); in map_dirent()
919 return de; in map_dirent()
922 if (de->down) { in map_dirent()
923 dno = de_down_pointer(de); in map_dirent()
944 struct hpfs_dirent *de; in hpfs_remove_dtree() local
948 de = dnode_first_de(dnode); in hpfs_remove_dtree()
949 if (de->last) { in hpfs_remove_dtree()
950 if (de->down) d1 = de_down_pointer(de); in hpfs_remove_dtree()
957 if (!de->first) goto error; in hpfs_remove_dtree()
958 d1 = de->down ? de_down_pointer(de) : 0; in hpfs_remove_dtree()
959 de = de_next_de(de); in hpfs_remove_dtree()
960 if (!de->last) goto error; in hpfs_remove_dtree()
961 d2 = de->down ? de_down_pointer(de) : 0; in hpfs_remove_dtree()
967 de = dnode_first_de(dnode); in hpfs_remove_dtree()
968 if (!de->last) goto error; in hpfs_remove_dtree()
969 d1 = de->down ? de_down_pointer(de) : 0; in hpfs_remove_dtree()
998 struct hpfs_dirent *de, *de_end; in map_fnode_dirent() local
1035 de = dnode_first_de(d); in map_fnode_dirent()
1037 while (de < de_end) { in map_fnode_dirent()
1038 if (de->down) if (de_down_pointer(de) == downd) goto f; in map_fnode_dirent()
1039 de = de_next_de(de); in map_fnode_dirent()
1047 if (de->fnode == fno) { in map_fnode_dirent()
1049 return de; in map_fnode_dirent()
1051 c = hpfs_compare_names(s, name1, name1len, de->name, de->namelen, de->last); in map_fnode_dirent()
1052 if (c < 0 && de->down) { in map_fnode_dirent()
1053 dno = de_down_pointer(de); in map_fnode_dirent()
1063 if (de->fnode == fno) { in map_fnode_dirent()
1065 return de; in map_fnode_dirent()
1067 c = hpfs_compare_names(s, name2, name2len, de->name, de->namelen, de->last); in map_fnode_dirent()
1068 if (c < 0 && !de->last) goto not_found; in map_fnode_dirent()
1069 if ((de = de_next_de(de)) < de_end) goto next_de; in map_fnode_dirent()