1 | /*
|
---|
2 | * Copyright (c) 2011 Martin Sucha
|
---|
3 | * All rights reserved.
|
---|
4 | *
|
---|
5 | * Redistribution and use in source and binary forms, with or without
|
---|
6 | * modification, are permitted provided that the following conditions
|
---|
7 | * are met:
|
---|
8 | *
|
---|
9 | * - Redistributions of source code must retain the above copyright
|
---|
10 | * notice, this list of conditions and the following disclaimer.
|
---|
11 | * - Redistributions in binary form must reproduce the above copyright
|
---|
12 | * notice, this list of conditions and the following disclaimer in the
|
---|
13 | * documentation and/or other materials provided with the distribution.
|
---|
14 | * - The name of the author may not be used to endorse or promote products
|
---|
15 | * derived from this software without specific prior written permission.
|
---|
16 | *
|
---|
17 | * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
|
---|
18 | * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
|
---|
19 | * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
|
---|
20 | * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
|
---|
21 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
|
---|
22 | * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
---|
23 | * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
---|
24 | * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
---|
25 | * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
|
---|
26 | * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
---|
27 | */
|
---|
28 |
|
---|
29 | /** @addtogroup libext2
|
---|
30 | * @{
|
---|
31 | */
|
---|
32 | /**
|
---|
33 | * @file
|
---|
34 | */
|
---|
35 |
|
---|
36 | #include "libext2.h"
|
---|
37 | #include "libext2_directory.h"
|
---|
38 | #include <byteorder.h>
|
---|
39 | #include <errno.h>
|
---|
40 | #include <assert.h>
|
---|
41 |
|
---|
42 | static int ext2_directory_iterator_set(ext2_directory_iterator_t *it,
|
---|
43 | uint32_t block_size);
|
---|
44 |
|
---|
45 | /**
|
---|
46 | * Get inode number for the directory entry
|
---|
47 | *
|
---|
48 | * @param de pointer to linked list directory entry
|
---|
49 | */
|
---|
50 | uint32_t ext2_directory_entry_ll_get_inode(ext2_directory_entry_ll_t *de)
|
---|
51 | {
|
---|
52 | return uint32_t_le2host(de->inode);
|
---|
53 | }
|
---|
54 |
|
---|
55 | /**
|
---|
56 | * Get length of the directory entry
|
---|
57 | *
|
---|
58 | * @param de pointer to linked list directory entry
|
---|
59 | */
|
---|
60 | uint16_t ext2_directory_entry_ll_get_entry_length(
|
---|
61 | ext2_directory_entry_ll_t *de)
|
---|
62 | {
|
---|
63 | return uint16_t_le2host(de->entry_length);
|
---|
64 | }
|
---|
65 |
|
---|
66 | /**
|
---|
67 | * Get length of the name stored in the directory entry
|
---|
68 | *
|
---|
69 | * @param de pointer to linked list directory entry
|
---|
70 | */
|
---|
71 | uint16_t ext2_directory_entry_ll_get_name_length(
|
---|
72 | ext2_superblock_t *sb, ext2_directory_entry_ll_t *de)
|
---|
73 | {
|
---|
74 | if (ext2_superblock_get_rev_major(sb) == 0 &&
|
---|
75 | ext2_superblock_get_rev_minor(sb) < 5) {
|
---|
76 | return ((uint16_t)de->name_length_high) << 8 |
|
---|
77 | ((uint16_t)de->name_length);
|
---|
78 | }
|
---|
79 | return de->name_length;
|
---|
80 | }
|
---|
81 |
|
---|
82 | /**
|
---|
83 | * Initialize a directory iterator
|
---|
84 | *
|
---|
85 | * @param it pointer to iterator to initialize
|
---|
86 | * @param fs pointer to filesystem structure
|
---|
87 | * @param inode pointer to inode reference structure
|
---|
88 | * @param pos position within inode to start at, 0 is the first entry
|
---|
89 | * @return EOK on success or negative error code on failure
|
---|
90 | */
|
---|
91 | int ext2_directory_iterator_init(ext2_directory_iterator_t *it,
|
---|
92 | ext2_filesystem_t *fs, ext2_inode_ref_t *inode_ref, aoff64_t pos)
|
---|
93 | {
|
---|
94 | it->inode_ref = inode_ref;
|
---|
95 | it->fs = fs;
|
---|
96 | it->current = NULL;
|
---|
97 | it->current_offset = 0;
|
---|
98 | it->current_block = NULL;
|
---|
99 |
|
---|
100 | return ext2_directory_iterator_seek(it, pos);
|
---|
101 | }
|
---|
102 |
|
---|
103 | /**
|
---|
104 | * Advance the directory iterator to the next entry
|
---|
105 | *
|
---|
106 | * @param it pointer to iterator to initialize
|
---|
107 | * @return EOK on success or negative error code on failure
|
---|
108 | */
|
---|
109 | int ext2_directory_iterator_next(ext2_directory_iterator_t *it)
|
---|
110 | {
|
---|
111 | uint16_t skip;
|
---|
112 |
|
---|
113 | assert(it->current != NULL);
|
---|
114 |
|
---|
115 | skip = ext2_directory_entry_ll_get_entry_length(it->current);
|
---|
116 |
|
---|
117 | return ext2_directory_iterator_seek(it, it->current_offset + skip);
|
---|
118 | }
|
---|
119 |
|
---|
120 | /**
|
---|
121 | * Seek the directory iterator to the given byte offset within the inode.
|
---|
122 | *
|
---|
123 | * @param it pointer to iterator to initialize
|
---|
124 | * @return EOK on success or negative error code on failure
|
---|
125 | */
|
---|
126 | int ext2_directory_iterator_seek(ext2_directory_iterator_t *it, aoff64_t pos)
|
---|
127 | {
|
---|
128 | int rc;
|
---|
129 |
|
---|
130 | uint64_t size;
|
---|
131 | aoff64_t current_block_idx;
|
---|
132 | aoff64_t next_block_idx;
|
---|
133 | uint32_t next_block_phys_idx;
|
---|
134 | uint32_t block_size;
|
---|
135 |
|
---|
136 | size = ext2_inode_get_size(it->fs->superblock, it->inode_ref->inode);
|
---|
137 |
|
---|
138 | /* The iterator is not valid until we seek to the desired position */
|
---|
139 | it->current = NULL;
|
---|
140 |
|
---|
141 | /* Are we at the end? */
|
---|
142 | if (pos >= size) {
|
---|
143 | if (it->current_block) {
|
---|
144 | rc = block_put(it->current_block);
|
---|
145 | it->current_block = NULL;
|
---|
146 | if (rc != EOK) {
|
---|
147 | return rc;
|
---|
148 | }
|
---|
149 | }
|
---|
150 |
|
---|
151 | it->current_offset = pos;
|
---|
152 | return EOK;
|
---|
153 | }
|
---|
154 |
|
---|
155 | block_size = ext2_superblock_get_block_size(it->fs->superblock);
|
---|
156 | current_block_idx = it->current_offset / block_size;
|
---|
157 | next_block_idx = pos / block_size;
|
---|
158 |
|
---|
159 | /* If we don't have a block or are moving accross block boundary,
|
---|
160 | * we need to get another block
|
---|
161 | */
|
---|
162 | if (it->current_block == NULL || current_block_idx != next_block_idx) {
|
---|
163 | if (it->current_block) {
|
---|
164 | rc = block_put(it->current_block);
|
---|
165 | it->current_block = NULL;
|
---|
166 | if (rc != EOK) {
|
---|
167 | return rc;
|
---|
168 | }
|
---|
169 | }
|
---|
170 |
|
---|
171 | rc = ext2_filesystem_get_inode_data_block_index(it->fs,
|
---|
172 | it->inode_ref->inode, next_block_idx, &next_block_phys_idx);
|
---|
173 | if (rc != EOK) {
|
---|
174 | return rc;
|
---|
175 | }
|
---|
176 |
|
---|
177 | rc = block_get(&it->current_block, it->fs->device, next_block_phys_idx,
|
---|
178 | BLOCK_FLAGS_NONE);
|
---|
179 | if (rc != EOK) {
|
---|
180 | it->current_block = NULL;
|
---|
181 | return rc;
|
---|
182 | }
|
---|
183 | }
|
---|
184 |
|
---|
185 | it->current_offset = pos;
|
---|
186 | return ext2_directory_iterator_set(it, block_size);
|
---|
187 | }
|
---|
188 |
|
---|
189 | /** Setup the entry at the current iterator offset.
|
---|
190 | *
|
---|
191 | * This function checks the validity of the directory entry,
|
---|
192 | * before setting the data pointer.
|
---|
193 | *
|
---|
194 | * @return EOK on success or error code on failure
|
---|
195 | */
|
---|
196 | static int ext2_directory_iterator_set(ext2_directory_iterator_t *it,
|
---|
197 | uint32_t block_size)
|
---|
198 | {
|
---|
199 | uint32_t offset_in_block = it->current_offset % block_size;
|
---|
200 |
|
---|
201 | it->current = NULL;
|
---|
202 |
|
---|
203 | /* Ensure proper alignment */
|
---|
204 | if ((offset_in_block % 4) != 0) {
|
---|
205 | return EIO;
|
---|
206 | }
|
---|
207 |
|
---|
208 | /* Ensure that the core of the entry does not overflow the block */
|
---|
209 | if (offset_in_block > block_size - 8) {
|
---|
210 | return EIO;
|
---|
211 | }
|
---|
212 |
|
---|
213 | ext2_directory_entry_ll_t *entry = it->current_block->data + offset_in_block;
|
---|
214 |
|
---|
215 | /* Ensure that the whole entry does not overflow the block */
|
---|
216 | uint16_t length = ext2_directory_entry_ll_get_entry_length(entry);
|
---|
217 | if (offset_in_block + length > block_size) {
|
---|
218 | return EIO;
|
---|
219 | }
|
---|
220 |
|
---|
221 | /* Ensure the name length is not too large */
|
---|
222 | if (ext2_directory_entry_ll_get_name_length(it->fs->superblock,
|
---|
223 | entry) > length-8) {
|
---|
224 | return EIO;
|
---|
225 | }
|
---|
226 |
|
---|
227 | it->current = entry;
|
---|
228 | return EOK;
|
---|
229 | }
|
---|
230 |
|
---|
231 | /**
|
---|
232 | * Release all resources asociated with the directory iterator
|
---|
233 | *
|
---|
234 | * @param it pointer to iterator to initialize
|
---|
235 | * @return EOK on success or negative error code on failure
|
---|
236 | */
|
---|
237 | int ext2_directory_iterator_fini(ext2_directory_iterator_t *it)
|
---|
238 | {
|
---|
239 | int rc;
|
---|
240 |
|
---|
241 | it->fs = NULL;
|
---|
242 | it->inode_ref = NULL;
|
---|
243 | it->current = NULL;
|
---|
244 |
|
---|
245 | if (it->current_block) {
|
---|
246 | rc = block_put(it->current_block);
|
---|
247 | if (rc != EOK) {
|
---|
248 | return rc;
|
---|
249 | }
|
---|
250 | }
|
---|
251 |
|
---|
252 | return EOK;
|
---|
253 | }
|
---|
254 |
|
---|
255 | /** @}
|
---|
256 | */
|
---|