forked from pbatard/ntfs-3g
-
Notifications
You must be signed in to change notification settings - Fork 0
/
dir.c
2909 lines (2707 loc) · 77.9 KB
/
dir.c
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
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/**
* dir.c - Directory handling code. Originated from the Linux-NTFS project.
*
* Copyright (c) 2002-2005 Anton Altaparmakov
* Copyright (c) 2004-2005 Richard Russon
* Copyright (c) 2004-2008 Szabolcs Szakacsits
* Copyright (c) 2005-2007 Yura Pakhuchiy
* Copyright (c) 2008-2021 Jean-Pierre Andre
*
* This program/include file is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License as published
* by the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* This program/include file is distributed in the hope that it will be
* useful, but WITHOUT ANY WARRANTY; without even the implied warranty
* of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program (in the main directory of the NTFS-3G
* distribution in the file COPYING); if not, write to the Free Software
* Foundation,Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
*/
#ifdef HAVE_CONFIG_H
#include "config.h"
#endif
#ifdef HAVE_STDLIB_H
#include <stdlib.h>
#endif
#ifdef HAVE_ERRNO_H
#include <errno.h>
#endif
#ifdef HAVE_STRING_H
#include <string.h>
#endif
#ifdef HAVE_SYS_STAT_H
#include <sys/stat.h>
#endif
#ifdef HAVE_SYS_TYPES_H
#include <sys/types.h>
#endif
#ifdef MAJOR_IN_MKDEV
#include <sys/mkdev.h>
#endif
#ifdef MAJOR_IN_SYSMACROS
#include <sys/sysmacros.h>
#endif
#include "param.h"
#include "types.h"
#include "debug.h"
#include "attrib.h"
#include "inode.h"
#include "dir.h"
#include "volume.h"
#include "mft.h"
#include "index.h"
#include "ntfstime.h"
#include "lcnalloc.h"
#include "logging.h"
#include "cache.h"
#include "misc.h"
#include "security.h"
#include "reparse.h"
#include "object_id.h"
#include "xattrs.h"
#include "ea.h"
/*
* The little endian Unicode strings "$I30", "$SII", "$SDH", "$O"
* and "$Q" as global constants.
*/
ntfschar NTFS_INDEX_I30[5] = { const_cpu_to_le16('$'), const_cpu_to_le16('I'),
const_cpu_to_le16('3'), const_cpu_to_le16('0'),
const_cpu_to_le16('\0') };
ntfschar NTFS_INDEX_SII[5] = { const_cpu_to_le16('$'), const_cpu_to_le16('S'),
const_cpu_to_le16('I'), const_cpu_to_le16('I'),
const_cpu_to_le16('\0') };
ntfschar NTFS_INDEX_SDH[5] = { const_cpu_to_le16('$'), const_cpu_to_le16('S'),
const_cpu_to_le16('D'), const_cpu_to_le16('H'),
const_cpu_to_le16('\0') };
ntfschar NTFS_INDEX_O[3] = { const_cpu_to_le16('$'), const_cpu_to_le16('O'),
const_cpu_to_le16('\0') };
ntfschar NTFS_INDEX_Q[3] = { const_cpu_to_le16('$'), const_cpu_to_le16('Q'),
const_cpu_to_le16('\0') };
ntfschar NTFS_INDEX_R[3] = { const_cpu_to_le16('$'), const_cpu_to_le16('R'),
const_cpu_to_le16('\0') };
#if CACHE_INODE_SIZE
/*
* Pathname hashing
*
* Based on first char and second char (which may be '\0')
*/
int ntfs_dir_inode_hash(const struct CACHED_GENERIC *cached)
{
const char *path;
const unsigned char *name;
path = (const char*)cached->variable;
if (!path) {
ntfs_log_error("Bad inode cache entry\n");
return (-1);
}
name = (const unsigned char*)strrchr(path,'/');
if (!name)
name = (const unsigned char*)path;
return (((name[0] << 1) + name[1] + strlen((const char*)name))
% (2*CACHE_INODE_SIZE));
}
/*
* Pathname comparing for entering/fetching from cache
*/
static int inode_cache_compare(const struct CACHED_GENERIC *cached,
const struct CACHED_GENERIC *wanted)
{
return (!cached->variable
|| strcmp(cached->variable, wanted->variable));
}
/*
* Pathname comparing for invalidating entries in cache
*
* A partial path is compared in order to invalidate all paths
* related to a renamed directory
* inode numbers are also checked, as deleting a long name may
* imply deleting a short name and conversely
*
* Only use associated with a CACHE_NOHASH flag
*/
static int inode_cache_inv_compare(const struct CACHED_GENERIC *cached,
const struct CACHED_GENERIC *wanted)
{
int len;
BOOL different;
const struct CACHED_INODE *w;
const struct CACHED_INODE *c;
w = (const struct CACHED_INODE*)wanted;
c = (const struct CACHED_INODE*)cached;
if (w->pathname) {
len = strlen(w->pathname);
different = !cached->variable
|| ((w->inum != MREF(c->inum))
&& (strncmp(c->pathname, w->pathname, len)
|| ((c->pathname[len] != '\0')
&& (c->pathname[len] != '/'))));
} else
different = !c->pathname
|| (w->inum != MREF(c->inum));
return (different);
}
#endif
#if CACHE_LOOKUP_SIZE
/*
* File name comparing for entering/fetching from lookup cache
*/
static int lookup_cache_compare(const struct CACHED_GENERIC *cached,
const struct CACHED_GENERIC *wanted)
{
const struct CACHED_LOOKUP *c = (const struct CACHED_LOOKUP*) cached;
const struct CACHED_LOOKUP *w = (const struct CACHED_LOOKUP*) wanted;
return (!c->name
|| (c->parent != w->parent)
|| (c->namesize != w->namesize)
|| memcmp(c->name, w->name, c->namesize));
}
/*
* Inode number comparing for invalidating lookup cache
*
* All entries with designated inode number are invalidated
*
* Only use associated with a CACHE_NOHASH flag
*/
static int lookup_cache_inv_compare(const struct CACHED_GENERIC *cached,
const struct CACHED_GENERIC *wanted)
{
const struct CACHED_LOOKUP *c = (const struct CACHED_LOOKUP*) cached;
const struct CACHED_LOOKUP *w = (const struct CACHED_LOOKUP*) wanted;
return (!c->name
|| (c->parent != w->parent)
|| (MREF(c->inum) != MREF(w->inum)));
}
/*
* Lookup hashing
*
* Based on first, second and and last char
*/
int ntfs_dir_lookup_hash(const struct CACHED_GENERIC *cached)
{
const unsigned char *name;
int count;
unsigned int val;
name = (const unsigned char*)cached->variable;
count = cached->varsize;
if (!name || !count) {
ntfs_log_error("Bad lookup cache entry\n");
return (-1);
}
val = (name[0] << 2) + (name[1] << 1) + name[count - 1] + count;
return (val % (2*CACHE_LOOKUP_SIZE));
}
#endif
/**
* ntfs_inode_lookup_by_name - find an inode in a directory given its name
* @dir_ni: ntfs inode of the directory in which to search for the name
* @uname: Unicode name for which to search in the directory
* @uname_len: length of the name @uname in Unicode characters
*
* Look for an inode with name @uname in the directory with inode @dir_ni.
* ntfs_inode_lookup_by_name() walks the contents of the directory looking for
* the Unicode name. If the name is found in the directory, the corresponding
* inode number (>= 0) is returned as a mft reference in cpu format, i.e. it
* is a 64-bit number containing the sequence number.
*
* On error, return -1 with errno set to the error code. If the inode is is not
* found errno is ENOENT.
*
* Note, @uname_len does not include the (optional) terminating NULL character.
*
* Note, we look for a case sensitive match first but we also look for a case
* insensitive match at the same time. If we find a case insensitive match, we
* save that for the case that we don't find an exact match, where we return
* the mft reference of the case insensitive match.
*
* If the volume is mounted with the case sensitive flag set, then we only
* allow exact matches.
*/
u64 ntfs_inode_lookup_by_name(ntfs_inode *dir_ni,
const ntfschar *uname, const int uname_len)
{
VCN vcn;
u64 mref = 0;
s64 br;
ntfs_volume *vol;
ntfs_attr_search_ctx *ctx;
INDEX_ROOT *ir;
INDEX_ENTRY *ie;
INDEX_ALLOCATION *ia;
IGNORE_CASE_BOOL case_sensitivity;
u8 *index_end;
ntfs_attr *ia_na;
int eo, rc;
u32 index_block_size;
u8 index_vcn_size_bits;
ntfs_log_trace("Entering\n");
if (!dir_ni || !dir_ni->mrec || !uname || uname_len <= 0) {
errno = EINVAL;
return -1;
}
vol = dir_ni->vol;
ctx = ntfs_attr_get_search_ctx(dir_ni, NULL);
if (!ctx)
return -1;
/* Find the index root attribute in the mft record. */
if (ntfs_attr_lookup(AT_INDEX_ROOT, NTFS_INDEX_I30, 4, CASE_SENSITIVE, 0, NULL,
0, ctx)) {
ntfs_log_perror("Index root attribute missing in directory inode "
"%lld", (unsigned long long)dir_ni->mft_no);
goto put_err_out;
}
case_sensitivity = (NVolCaseSensitive(vol) ? CASE_SENSITIVE : IGNORE_CASE);
/* Get to the index root value. */
ir = (INDEX_ROOT*)((u8*)ctx->attr +
le16_to_cpu(ctx->attr->value_offset));
index_block_size = le32_to_cpu(ir->index_block_size);
if (index_block_size < NTFS_BLOCK_SIZE ||
index_block_size & (index_block_size - 1)) {
ntfs_log_error("Index block size %u is invalid.\n",
(unsigned)index_block_size);
goto put_err_out;
}
/* Consistency check of ir done while fetching attribute */
index_end = (u8*)&ir->index + le32_to_cpu(ir->index.index_length);
/* The first index entry. */
ie = (INDEX_ENTRY*)((u8*)&ir->index +
le32_to_cpu(ir->index.entries_offset));
/*
* Loop until we exceed valid memory (corruption case) or until we
* reach the last entry.
*/
for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) {
/* Bounds checks. */
if ((u8*)ie < (u8*)ctx->mrec || (u8*)ie +
sizeof(INDEX_ENTRY_HEADER) > index_end ||
(u8*)ie + le16_to_cpu(ie->length) >
index_end) {
ntfs_log_error("Index root entry out of bounds in"
" inode %lld\n",
(unsigned long long)dir_ni->mft_no);
goto put_err_out;
}
/*
* The last entry cannot contain a name. It can however contain
* a pointer to a child node in the B+tree so we just break out.
*/
if (ie->ie_flags & INDEX_ENTRY_END)
break;
/* The file name must not overflow from the entry */
if (ntfs_index_entry_inconsistent(ie, COLLATION_FILE_NAME,
dir_ni->mft_no)) {
errno = EIO;
goto put_err_out;
}
/*
* Not a perfect match, need to do full blown collation so we
* know which way in the B+tree we have to go.
*/
rc = ntfs_names_full_collate(uname, uname_len,
(ntfschar*)&ie->key.file_name.file_name,
ie->key.file_name.file_name_length,
case_sensitivity, vol->upcase, vol->upcase_len);
/*
* If uname collates before the name of the current entry, there
* is definitely no such name in this index but we might need to
* descend into the B+tree so we just break out of the loop.
*/
if (rc == -1)
break;
/* The names are not equal, continue the search. */
if (rc)
continue;
/*
* Perfect match, this will never happen as the
* ntfs_are_names_equal() call will have gotten a match but we
* still treat it correctly.
*/
mref = le64_to_cpu(ie->indexed_file);
ntfs_attr_put_search_ctx(ctx);
return mref;
}
/*
* We have finished with this index without success. Check for the
* presence of a child node and if not present return error code
* ENOENT, unless we have got the mft reference of a matching name
* cached in mref in which case return mref.
*/
if (!(ie->ie_flags & INDEX_ENTRY_NODE)) {
ntfs_attr_put_search_ctx(ctx);
if (mref)
return mref;
ntfs_log_debug("Entry not found - between root entries.\n");
errno = ENOENT;
return -1;
} /* Child node present, descend into it. */
/* Open the index allocation attribute. */
ia_na = ntfs_attr_open(dir_ni, AT_INDEX_ALLOCATION, NTFS_INDEX_I30, 4);
if (!ia_na) {
ntfs_log_perror("Failed to open index allocation (inode %lld)",
(unsigned long long)dir_ni->mft_no);
goto put_err_out;
}
/* Allocate a buffer for the current index block. */
ia = ntfs_malloc(index_block_size);
if (!ia) {
ntfs_attr_close(ia_na);
goto put_err_out;
}
/* Determine the size of a vcn in the directory index. */
if (vol->cluster_size <= index_block_size) {
index_vcn_size_bits = vol->cluster_size_bits;
} else {
index_vcn_size_bits = NTFS_BLOCK_SIZE_BITS;
}
/* Get the starting vcn of the index_block holding the child node. */
vcn = sle64_to_cpup((sle64*)((u8*)ie + le16_to_cpu(ie->length) - 8));
descend_into_child_node:
/* Read the index block starting at vcn. */
br = ntfs_attr_mst_pread(ia_na, vcn << index_vcn_size_bits, 1,
index_block_size, ia);
if (br != 1) {
if (br != -1)
errno = EIO;
ntfs_log_perror("Failed to read vcn 0x%llx from inode %lld",
(unsigned long long)vcn,
(unsigned long long)ia_na->ni->mft_no);
goto close_err_out;
}
if (ntfs_index_block_inconsistent((INDEX_BLOCK*)ia, index_block_size,
ia_na->ni->mft_no, vcn)) {
errno = EIO;
goto close_err_out;
}
index_end = (u8*)&ia->index + le32_to_cpu(ia->index.index_length);
/* The first index entry. */
ie = (INDEX_ENTRY*)((u8*)&ia->index +
le32_to_cpu(ia->index.entries_offset));
/*
* Iterate similar to above big loop but applied to index buffer, thus
* loop until we exceed valid memory (corruption case) or until we
* reach the last entry.
*/
for (;; ie = (INDEX_ENTRY*)((u8*)ie + le16_to_cpu(ie->length))) {
/* Bounds check. */
if ((u8*)ie < (u8*)ia || (u8*)ie +
sizeof(INDEX_ENTRY_HEADER) > index_end ||
(u8*)ie + le16_to_cpu(ie->length) >
index_end) {
ntfs_log_error("Index entry out of bounds in directory "
"inode %lld.\n",
(unsigned long long)dir_ni->mft_no);
errno = EIO;
goto close_err_out;
}
/*
* The last entry cannot contain a name. It can however contain
* a pointer to a child node in the B+tree so we just break out.
*/
if (ie->ie_flags & INDEX_ENTRY_END)
break;
/* The file name must not overflow from the entry */
if (ntfs_index_entry_inconsistent(ie, COLLATION_FILE_NAME,
dir_ni->mft_no)) {
errno = EIO;
goto close_err_out;
}
/*
* Not a perfect match, need to do full blown collation so we
* know which way in the B+tree we have to go.
*/
rc = ntfs_names_full_collate(uname, uname_len,
(ntfschar*)&ie->key.file_name.file_name,
ie->key.file_name.file_name_length,
case_sensitivity, vol->upcase, vol->upcase_len);
/*
* If uname collates before the name of the current entry, there
* is definitely no such name in this index but we might need to
* descend into the B+tree so we just break out of the loop.
*/
if (rc == -1)
break;
/* The names are not equal, continue the search. */
if (rc)
continue;
mref = le64_to_cpu(ie->indexed_file);
free(ia);
ntfs_attr_close(ia_na);
ntfs_attr_put_search_ctx(ctx);
return mref;
}
/*
* We have finished with this index buffer without success. Check for
* the presence of a child node.
*/
if (ie->ie_flags & INDEX_ENTRY_NODE) {
if ((ia->index.ih_flags & NODE_MASK) == LEAF_NODE) {
ntfs_log_error("Index entry with child node found in a leaf "
"node in directory inode %lld.\n",
(unsigned long long)dir_ni->mft_no);
errno = EIO;
goto close_err_out;
}
/* Child node present, descend into it. */
vcn = sle64_to_cpup((sle64*)((u8*)ie + le16_to_cpu(ie->length) - 8));
if (vcn >= 0)
goto descend_into_child_node;
ntfs_log_error("Negative child node vcn in directory inode "
"0x%llx.\n", (unsigned long long)dir_ni->mft_no);
errno = EIO;
goto close_err_out;
}
free(ia);
ntfs_attr_close(ia_na);
ntfs_attr_put_search_ctx(ctx);
/*
* No child node present, return error code ENOENT, unless we have got
* the mft reference of a matching name cached in mref in which case
* return mref.
*/
if (mref)
return mref;
ntfs_log_debug("Entry not found.\n");
errno = ENOENT;
return -1;
put_err_out:
eo = EIO;
ntfs_log_debug("Corrupt directory. Aborting lookup.\n");
eo_put_err_out:
ntfs_attr_put_search_ctx(ctx);
errno = eo;
return -1;
close_err_out:
eo = errno;
free(ia);
ntfs_attr_close(ia_na);
goto eo_put_err_out;
}
/*
* Lookup a file in a directory from its UTF-8 name
*
* The name is first fetched from cache if one is defined
*
* Returns the inode number
* or -1 if not possible (errno tells why)
*/
u64 ntfs_inode_lookup_by_mbsname(ntfs_inode *dir_ni, const char *name)
{
int uname_len;
ntfschar *uname = (ntfschar*)NULL;
u64 inum;
char *cached_name;
const char *const_name;
if (!NVolCaseSensitive(dir_ni->vol)) {
cached_name = ntfs_uppercase_mbs(name,
dir_ni->vol->upcase, dir_ni->vol->upcase_len);
const_name = cached_name;
} else {
cached_name = (char*)NULL;
const_name = name;
}
if (const_name) {
#if CACHE_LOOKUP_SIZE
/*
* fetch inode from cache
*/
if (dir_ni->vol->lookup_cache) {
struct CACHED_LOOKUP item;
struct CACHED_LOOKUP *cached;
item.name = const_name;
item.namesize = strlen(const_name) + 1;
item.parent = dir_ni->mft_no;
cached = (struct CACHED_LOOKUP*)ntfs_fetch_cache(
dir_ni->vol->lookup_cache,
GENERIC(&item), lookup_cache_compare);
if (cached) {
inum = cached->inum;
if (inum == (u64)-1)
errno = ENOENT;
} else {
/* Generate unicode name. */
uname_len = ntfs_mbstoucs(name, &uname);
if (uname_len >= 0) {
inum = ntfs_inode_lookup_by_name(dir_ni,
uname, uname_len);
item.inum = inum;
/* enter into cache, even if not found */
ntfs_enter_cache(dir_ni->vol->lookup_cache,
GENERIC(&item),
lookup_cache_compare);
free(uname);
} else
inum = (s64)-1;
}
} else
#endif
{
/* Generate unicode name. */
uname_len = ntfs_mbstoucs(cached_name, &uname);
if (uname_len >= 0) {
inum = ntfs_inode_lookup_by_name(dir_ni,
uname, uname_len);
free(uname);
} else
inum = (s64)-1;
}
if (cached_name)
free(cached_name);
} else
inum = (s64)-1;
return (inum);
}
/*
* Update a cache lookup record when a name has been defined
*
* The UTF-8 name is required
*/
void ntfs_inode_update_mbsname(ntfs_inode *dir_ni, const char *name, u64 inum)
{
#if CACHE_LOOKUP_SIZE
struct CACHED_LOOKUP item;
struct CACHED_LOOKUP *cached;
char *cached_name;
if (dir_ni->vol->lookup_cache) {
if (!NVolCaseSensitive(dir_ni->vol)) {
cached_name = ntfs_uppercase_mbs(name,
dir_ni->vol->upcase, dir_ni->vol->upcase_len);
item.name = cached_name;
} else {
cached_name = (char*)NULL;
item.name = name;
}
if (item.name) {
item.namesize = strlen(item.name) + 1;
item.parent = dir_ni->mft_no;
item.inum = inum;
cached = (struct CACHED_LOOKUP*)ntfs_enter_cache(
dir_ni->vol->lookup_cache,
GENERIC(&item), lookup_cache_compare);
if (cached)
cached->inum = inum;
if (cached_name)
free(cached_name);
}
}
#endif
}
/**
* ntfs_pathname_to_inode - Find the inode which represents the given pathname
* @vol: An ntfs volume obtained from ntfs_mount
* @parent: A directory inode to begin the search (may be NULL)
* @pathname: Pathname to be located
*
* Take an ASCII pathname and find the inode that represents it. The function
* splits the path and then descends the directory tree. If @parent is NULL,
* then the root directory '.' will be used as the base for the search.
*
* Return: inode Success, the pathname was valid
* NULL Error, the pathname was invalid, or some other error occurred
*/
ntfs_inode *ntfs_pathname_to_inode(ntfs_volume *vol, ntfs_inode *parent,
const char *pathname)
{
u64 inum;
int len, err = 0;
char *p, *q;
ntfs_inode *ni;
ntfs_inode *result = NULL;
ntfschar *unicode = NULL;
char *ascii = NULL;
#if CACHE_INODE_SIZE
struct CACHED_INODE item;
struct CACHED_INODE *cached;
char *fullname;
#endif
if (!vol || !pathname) {
errno = EINVAL;
return NULL;
}
ntfs_log_trace("path: '%s'\n", pathname);
ascii = strdup(pathname);
if (!ascii) {
ntfs_log_error("Out of memory.\n");
err = ENOMEM;
goto out;
}
p = ascii;
/* Remove leading /'s. */
while (p && *p && *p == PATH_SEP)
p++;
#if CACHE_INODE_SIZE
fullname = p;
if (p[0] && (p[strlen(p)-1] == PATH_SEP))
ntfs_log_error("Unnormalized path %s\n",ascii);
#endif
if (parent) {
ni = parent;
} else {
#if CACHE_INODE_SIZE
/*
* fetch inode for full path from cache
*/
if (*fullname) {
item.pathname = fullname;
item.varsize = strlen(fullname) + 1;
cached = (struct CACHED_INODE*)ntfs_fetch_cache(
vol->xinode_cache, GENERIC(&item),
inode_cache_compare);
} else
cached = (struct CACHED_INODE*)NULL;
if (cached) {
/*
* return opened inode if found in cache
*/
inum = MREF(cached->inum);
ni = ntfs_inode_open(vol, inum);
if (!ni) {
ntfs_log_debug("Cannot open inode %llu: %s.\n",
(unsigned long long)inum, p);
err = EIO;
}
result = ni;
goto out;
}
#endif
ni = ntfs_inode_open(vol, FILE_root);
if (!ni) {
ntfs_log_debug("Couldn't open the inode of the root "
"directory.\n");
err = EIO;
result = (ntfs_inode*)NULL;
goto out;
}
}
while (p && *p) {
/* Find the end of the first token. */
q = strchr(p, PATH_SEP);
if (q != NULL) {
*q = '\0';
}
#if CACHE_INODE_SIZE
/*
* fetch inode for partial path from cache
*/
cached = (struct CACHED_INODE*)NULL;
if (!parent) {
item.pathname = fullname;
item.varsize = strlen(fullname) + 1;
cached = (struct CACHED_INODE*)ntfs_fetch_cache(
vol->xinode_cache, GENERIC(&item),
inode_cache_compare);
if (cached) {
inum = cached->inum;
}
}
/*
* if not in cache, translate, search, then
* insert into cache if found
*/
if (!cached) {
len = ntfs_mbstoucs(p, &unicode);
if (len < 0) {
ntfs_log_perror("Could not convert filename to Unicode:"
" '%s'", p);
err = errno;
goto close;
} else if (len > NTFS_MAX_NAME_LEN) {
err = ENAMETOOLONG;
goto close;
}
inum = ntfs_inode_lookup_by_name(ni, unicode, len);
if (!parent && (inum != (u64) -1)) {
item.inum = inum;
ntfs_enter_cache(vol->xinode_cache,
GENERIC(&item),
inode_cache_compare);
}
}
#else
len = ntfs_mbstoucs(p, &unicode);
if (len < 0) {
ntfs_log_perror("Could not convert filename to Unicode:"
" '%s'", p);
err = errno;
goto close;
} else if (len > NTFS_MAX_NAME_LEN) {
err = ENAMETOOLONG;
goto close;
}
inum = ntfs_inode_lookup_by_name(ni, unicode, len);
#endif
if (inum == (u64) -1) {
ntfs_log_debug("Couldn't find name '%s' in pathname "
"'%s'.\n", p, pathname);
err = ENOENT;
goto close;
}
if (ni != parent)
if (ntfs_inode_close(ni)) {
err = errno;
goto out;
}
inum = MREF(inum);
ni = ntfs_inode_open(vol, inum);
if (!ni) {
ntfs_log_debug("Cannot open inode %llu: %s.\n",
(unsigned long long)inum, p);
err = EIO;
goto close;
}
free(unicode);
unicode = NULL;
if (q) *q++ = PATH_SEP; /* JPA */
p = q;
while (p && *p && *p == PATH_SEP)
p++;
}
result = ni;
ni = NULL;
close:
if (ni && (ni != parent))
if (ntfs_inode_close(ni) && !err)
err = errno;
out:
free(ascii);
free(unicode);
if (err)
errno = err;
return result;
}
/*
* The little endian Unicode string ".." for ntfs_readdir().
*/
static const ntfschar dotdot[3] = { const_cpu_to_le16('.'),
const_cpu_to_le16('.'),
const_cpu_to_le16('\0') };
/**
* enum INDEX_TYPE -
* More helpers for ntfs_readdir().
*/
typedef enum {
INDEX_TYPE_ROOT, /* index root */
INDEX_TYPE_ALLOCATION, /* index allocation */
} INDEX_TYPE;
/*
* Decode Interix file types
*
* Non-Interix types are returned as plain files, because a
* Windows user may force patterns very similar to Interix,
* and most metadata files have such similar patters.
*/
u32 ntfs_interix_types(ntfs_inode *ni)
{
ntfs_attr *na;
u32 dt_type;
le64 magic;
dt_type = NTFS_DT_UNKNOWN;
na = ntfs_attr_open(ni, AT_DATA, NULL, 0);
if (na) {
/*
* Unrecognized patterns (eg HID + SYST for metadata)
* are plain files or directories
*/
if (ni->mrec->flags & MFT_RECORD_IS_DIRECTORY)
dt_type = NTFS_DT_DIR;
else
dt_type = NTFS_DT_REG;
if (na->data_size <= 1) {
if (!(ni->flags & FILE_ATTR_HIDDEN))
dt_type = (na->data_size ?
NTFS_DT_SOCK : NTFS_DT_FIFO);
} else {
if ((na->data_size >= (s64)sizeof(magic))
&& (ntfs_attr_pread(na, 0, sizeof(magic), &magic)
== sizeof(magic))) {
if (magic == INTX_SYMBOLIC_LINK)
dt_type = NTFS_DT_LNK;
else if (magic == INTX_BLOCK_DEVICE)
dt_type = NTFS_DT_BLK;
else if (magic == INTX_CHARACTER_DEVICE)
dt_type = NTFS_DT_CHR;
}
}
ntfs_attr_close(na);
}
return (dt_type);
}
/*
* Decode file types
*
* Better only use for Interix types and junctions,
* unneeded complexity when used for plain files or directories
*
* Error cases are logged and returned as unknown.
*/
static u32 ntfs_dir_entry_type(ntfs_inode *dir_ni, MFT_REF mref,
FILE_ATTR_FLAGS attributes)
{
ntfs_inode *ni;
u32 dt_type;
dt_type = NTFS_DT_UNKNOWN;
ni = ntfs_inode_open(dir_ni->vol, mref);
if (ni) {
if (attributes & FILE_ATTR_REPARSE_POINT)
dt_type = (ntfs_possible_symlink(ni)
? NTFS_DT_LNK : NTFS_DT_REPARSE);
else
if ((attributes & FILE_ATTR_SYSTEM)
&& !(attributes & FILE_ATTR_I30_INDEX_PRESENT))
dt_type = ntfs_interix_types(ni);
else
dt_type = (attributes
& FILE_ATTR_I30_INDEX_PRESENT
? NTFS_DT_DIR : NTFS_DT_REG);
if (ntfs_inode_close(ni)) {
/* anything special worth doing ? */
ntfs_log_error("Failed to close inode %lld\n",
(long long)MREF(mref));
}
}
if (dt_type == NTFS_DT_UNKNOWN)
ntfs_log_error("Could not decode the type of inode %lld\n",
(long long)MREF(mref));
return (dt_type);
}
/**
* ntfs_filldir - ntfs specific filldir method
* @dir_ni: ntfs inode of current directory
* @pos: current position in directory
* @ie: current index entry
* @dirent: context for filldir callback supplied by the caller
* @filldir: filldir callback supplied by the caller
*
* Pass information specifying the current directory entry @ie to the @filldir
* callback.
*/
static int ntfs_filldir(ntfs_inode *dir_ni, s64 *pos,
INDEX_ENTRY *ie, void *dirent, ntfs_filldir_t filldir)
{
FILE_NAME_ATTR *fn = &ie->key.file_name;
unsigned dt_type;
BOOL metadata;
ntfschar *loname;
int res;
MFT_REF mref;
ntfs_log_trace("Entering.\n");
mref = le64_to_cpu(ie->indexed_file);
metadata = (MREF(mref) != FILE_root) && (MREF(mref) < FILE_first_user);
/* Skip root directory self reference entry. */
if (MREF_LE(ie->indexed_file) == FILE_root)
return 0;
if ((ie->key.file_name.file_attributes
& (FILE_ATTR_REPARSE_POINT | FILE_ATTR_SYSTEM))
&& !metadata)
dt_type = ntfs_dir_entry_type(dir_ni, mref,
ie->key.file_name.file_attributes);
else if (ie->key.file_name.file_attributes
& FILE_ATTR_I30_INDEX_PRESENT)
dt_type = NTFS_DT_DIR;
else
dt_type = NTFS_DT_REG;
/* return metadata files and hidden files if requested */
if ((!metadata && (NVolShowHidFiles(dir_ni->vol)
|| !(fn->file_attributes & FILE_ATTR_HIDDEN)))
|| (NVolShowSysFiles(dir_ni->vol) && (NVolShowHidFiles(dir_ni->vol)
|| metadata))) {
if (NVolCaseSensitive(dir_ni->vol)) {
res = filldir(dirent, fn->file_name,
fn->file_name_length,
fn->file_name_type, *pos,
mref, dt_type);
} else {
loname = (ntfschar*)ntfs_malloc(2*fn->file_name_length);
if (loname) {
memcpy(loname, fn->file_name,
2*fn->file_name_length);
ntfs_name_locase(loname, fn->file_name_length,
dir_ni->vol->locase,
dir_ni->vol->upcase_len);
res = filldir(dirent, loname,
fn->file_name_length,
fn->file_name_type, *pos,
mref, dt_type);
free(loname);
} else