| 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 | * @return EOK on success or negative error code on failure
|
|---|
| 89 | */
|
|---|
| 90 | int ext2_directory_iterator_init(ext2_directory_iterator_t *it,
|
|---|
| 91 | ext2_filesystem_t *fs, ext2_inode_ref_t *inode_ref)
|
|---|
| 92 | {
|
|---|
| 93 | int rc;
|
|---|
| 94 | uint32_t block_id;
|
|---|
| 95 | uint32_t block_size;
|
|---|
| 96 |
|
|---|
| 97 | it->inode_ref = inode_ref;
|
|---|
| 98 | it->fs = fs;
|
|---|
| 99 |
|
|---|
| 100 | /* Get the first data block, so we can get the first entry */
|
|---|
| 101 | rc = ext2_filesystem_get_inode_data_block_index(fs, inode_ref->inode, 0,
|
|---|
| 102 | &block_id);
|
|---|
| 103 | if (rc != EOK) {
|
|---|
| 104 | return rc;
|
|---|
| 105 | }
|
|---|
| 106 |
|
|---|
| 107 | rc = block_get(&it->current_block, fs->device, block_id, 0);
|
|---|
| 108 | if (rc != EOK) {
|
|---|
| 109 | return rc;
|
|---|
| 110 | }
|
|---|
| 111 |
|
|---|
| 112 | block_size = ext2_superblock_get_block_size(fs->superblock);
|
|---|
| 113 |
|
|---|
| 114 | it->current_offset = 0;
|
|---|
| 115 | return ext2_directory_iterator_set(it, block_size);
|
|---|
| 116 | }
|
|---|
| 117 |
|
|---|
| 118 | /**
|
|---|
| 119 | * Advance the directory iterator to the next entry
|
|---|
| 120 | *
|
|---|
| 121 | * @param it pointer to iterator to initialize
|
|---|
| 122 | * @return EOK on success or negative error code on failure
|
|---|
| 123 | */
|
|---|
| 124 | int ext2_directory_iterator_next(ext2_directory_iterator_t *it)
|
|---|
| 125 | {
|
|---|
| 126 | int rc;
|
|---|
| 127 | uint16_t skip;
|
|---|
| 128 | uint64_t size;
|
|---|
| 129 | aoff64_t current_block_idx;
|
|---|
| 130 | aoff64_t next_block_idx;
|
|---|
| 131 | uint32_t next_block_phys_idx;
|
|---|
| 132 | uint32_t block_size;
|
|---|
| 133 |
|
|---|
| 134 | assert(it->current != NULL);
|
|---|
| 135 |
|
|---|
| 136 | skip = ext2_directory_entry_ll_get_entry_length(it->current);
|
|---|
| 137 | size = ext2_inode_get_size(it->fs->superblock, it->inode_ref->inode);
|
|---|
| 138 |
|
|---|
| 139 | /* Are we at the end? */
|
|---|
| 140 | if (it->current_offset + skip >= size) {
|
|---|
| 141 | rc = block_put(it->current_block);
|
|---|
| 142 | it->current_block = NULL;
|
|---|
| 143 | it->current = NULL;
|
|---|
| 144 | if (rc != EOK) {
|
|---|
| 145 | return rc;
|
|---|
| 146 | }
|
|---|
| 147 |
|
|---|
| 148 | it->current_offset += skip;
|
|---|
| 149 | return EOK;
|
|---|
| 150 | }
|
|---|
| 151 |
|
|---|
| 152 | block_size = ext2_superblock_get_block_size(it->fs->superblock);
|
|---|
| 153 | current_block_idx = it->current_offset / block_size;
|
|---|
| 154 | next_block_idx = (it->current_offset + skip) / block_size;
|
|---|
| 155 |
|
|---|
| 156 | /* If we are moving accross block boundary,
|
|---|
| 157 | * we need to get another block
|
|---|
| 158 | */
|
|---|
| 159 | if (current_block_idx != next_block_idx) {
|
|---|
| 160 | rc = block_put(it->current_block);
|
|---|
| 161 | it->current_block = NULL;
|
|---|
| 162 | it->current = NULL;
|
|---|
| 163 | if (rc != EOK) {
|
|---|
| 164 | return rc;
|
|---|
| 165 | }
|
|---|
| 166 |
|
|---|
| 167 | rc = ext2_filesystem_get_inode_data_block_index(it->fs,
|
|---|
| 168 | it->inode_ref->inode, next_block_idx, &next_block_phys_idx);
|
|---|
| 169 | if (rc != EOK) {
|
|---|
| 170 | return rc;
|
|---|
| 171 | }
|
|---|
| 172 |
|
|---|
| 173 | rc = block_get(&it->current_block, it->fs->device, next_block_phys_idx,
|
|---|
| 174 | BLOCK_FLAGS_NONE);
|
|---|
| 175 | if (rc != EOK) {
|
|---|
| 176 | it->current_block = NULL;
|
|---|
| 177 | return rc;
|
|---|
| 178 | }
|
|---|
| 179 | }
|
|---|
| 180 |
|
|---|
| 181 | it->current_offset += skip;
|
|---|
| 182 | return ext2_directory_iterator_set(it, block_size);
|
|---|
| 183 | }
|
|---|
| 184 |
|
|---|
| 185 | static int ext2_directory_iterator_set(ext2_directory_iterator_t *it,
|
|---|
| 186 | uint32_t block_size)
|
|---|
| 187 | {
|
|---|
| 188 | uint32_t offset_in_block = it->current_offset % block_size;
|
|---|
| 189 |
|
|---|
| 190 | it->current = NULL;
|
|---|
| 191 |
|
|---|
| 192 | /* Ensure proper alignment */
|
|---|
| 193 | if ((offset_in_block % 4) != 0) {
|
|---|
| 194 | return EIO;
|
|---|
| 195 | }
|
|---|
| 196 |
|
|---|
| 197 | /* Ensure that the core of the entry does not overflow the block */
|
|---|
| 198 | if (offset_in_block > block_size - 8) {
|
|---|
| 199 | return EIO;
|
|---|
| 200 | }
|
|---|
| 201 |
|
|---|
| 202 | ext2_directory_entry_ll_t *entry = it->current_block->data + offset_in_block;
|
|---|
| 203 |
|
|---|
| 204 | /* Ensure that the whole entry does not overflow the block */
|
|---|
| 205 | uint16_t length = ext2_directory_entry_ll_get_entry_length(entry);
|
|---|
| 206 | if (offset_in_block + length > block_size) {
|
|---|
| 207 | return EIO;
|
|---|
| 208 | }
|
|---|
| 209 |
|
|---|
| 210 | /* Ensure the name length is not too large */
|
|---|
| 211 | if (ext2_directory_entry_ll_get_name_length(it->fs->superblock,
|
|---|
| 212 | entry) > length-8) {
|
|---|
| 213 | return EIO;
|
|---|
| 214 | }
|
|---|
| 215 |
|
|---|
| 216 | it->current = entry;
|
|---|
| 217 | return EOK;
|
|---|
| 218 | }
|
|---|
| 219 |
|
|---|
| 220 | /**
|
|---|
| 221 | * Release all resources asociated with the directory iterator
|
|---|
| 222 | *
|
|---|
| 223 | * @param it pointer to iterator to initialize
|
|---|
| 224 | * @return EOK on success or negative error code on failure
|
|---|
| 225 | */
|
|---|
| 226 | int ext2_directory_iterator_fini(ext2_directory_iterator_t *it)
|
|---|
| 227 | {
|
|---|
| 228 | int rc;
|
|---|
| 229 |
|
|---|
| 230 | it->fs = NULL;
|
|---|
| 231 | it->inode_ref = NULL;
|
|---|
| 232 | it->current = NULL;
|
|---|
| 233 |
|
|---|
| 234 | if (it->current_block) {
|
|---|
| 235 | rc = block_put(it->current_block);
|
|---|
| 236 | if (rc != EOK) {
|
|---|
| 237 | return rc;
|
|---|
| 238 | }
|
|---|
| 239 | }
|
|---|
| 240 |
|
|---|
| 241 | return EOK;
|
|---|
| 242 | }
|
|---|
| 243 |
|
|---|
| 244 | /** @}
|
|---|
| 245 | */
|
|---|