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
|
/*
* Copyright (C) 2014 The Android Open Source Project
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in
* the documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS
* OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED
* AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
* OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
* OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#define _LARGEFILE64_SOURCE
#include <assert.h>
#include <asm/types.h>
#include <dlfcn.h>
#include <errno.h>
#include <fcntl.h>
#include <linux/fs.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h> /* memset() */
#include <sys/param.h>
#include <sys/stat.h>
#include <sys/types.h>
#include <unistd.h>
#include <f2fs_fs.h>
#include <f2fs_format_utils.h>
#include <sparse/sparse.h>
struct selabel_handle;
#include "make_f2fs.h"
#ifdef _WIN32
#include <winsock2.h>
/* These match the Linux definitions of these flags.
L_xx is defined to avoid conflicting with the win32 versions.
*/
#define L_S_IRUSR 00400
#define L_S_IWUSR 00200
#define L_S_IXUSR 00100
#define S_IRWXU (L_S_IRUSR | L_S_IWUSR | L_S_IXUSR)
#define S_IRGRP 00040
#define S_IWGRP 00020
#define S_IXGRP 00010
#define S_IRWXG (S_IRGRP | S_IWGRP | S_IXGRP)
#define S_IROTH 00004
#define S_IWOTH 00002
#define S_IXOTH 00001
#define S_IRWXO (S_IROTH | S_IWOTH | S_IXOTH)
#define S_ISUID 0004000
#define S_ISGID 0002000
#define S_ISVTX 0001000
#else
#include <selinux/selinux.h>
#include <selinux/label.h>
#define O_BINARY 0
#endif
struct f2fs_configuration c;
struct sparse_file *f2fs_sparse_file;
struct buf_item {
void *buf;
size_t len;
struct buf_item *next;
};
struct buf_item *buf_list;
static int __get_device_fd(__u64 *offset)
{
__u64 blk_addr = *offset >> F2FS_BLKSIZE_BITS;
int i;
for (i = 0; i < c.ndevs; i++) {
if (c.devices[i].start_blkaddr <= blk_addr &&
c.devices[i].end_blkaddr >= blk_addr) {
*offset -=
c.devices[i].start_blkaddr << F2FS_BLKSIZE_BITS;
return c.devices[i].fd;
}
}
return -1;
}
static int dev_write_fd(void *buf, __u64 offset, size_t len)
{
int fd = __get_device_fd(&offset);
if (lseek64(fd, (off64_t)offset, SEEK_SET) < 0)
return -1;
ssize_t written = write(fd, buf, len);
if (written == -1)
return -1;
if ((size_t)written != len)
return -1;
return 0;
}
void flush_sparse_buffs()
{
while (buf_list) {
struct buf_item *bi = buf_list;
buf_list = buf_list->next;
free(bi->buf);
free(bi);
}
}
static int dev_write_sparse(void *buf, __u64 byte_offset, size_t byte_len)
{
struct buf_item *bi = calloc(1, sizeof(struct buf_item));
if (bi == NULL) {
return -ENOMEM;
}
bi->buf = malloc(byte_len);
if (bi->buf == NULL) {
free(bi);
return -ENOMEM;
}
bi->len = byte_len;
memcpy(bi->buf, buf, byte_len);
bi->next = buf_list;
buf_list = bi;
sparse_file_add_data(f2fs_sparse_file, bi->buf, byte_len, byte_offset/F2FS_BLKSIZE);
return 0;
}
int f2fs_trim_devices(void)
{
return 0;
}
/*
* IO interfaces
*/
int dev_read_version(void *buf, __u64 offset, size_t len)
{
return 0;
}
int dev_read(void *buf, __u64 offset, size_t len)
{
return 0;
}
int dev_readahead(__u64 offset, size_t len)
{
return 0;
}
int dev_write(void *buf, __u64 offset, size_t len)
{
int fd = __get_device_fd(&offset);
if (fd >= 0) {
return dev_write_fd(buf, offset, len);
} else {
return dev_write_sparse(buf, offset, len);
}
}
int dev_write_block(void *buf, __u64 blk_addr)
{
assert(false); // Must not be invoked.
return 0;
}
int dev_write_dump(void *buf, __u64 offset, size_t len)
{
assert(false); // Must not be invoked.
return 0;
}
int dev_fill(void *buf, __u64 offset, size_t len)
{
int fd = __get_device_fd(&offset);
int ret;
if (fd >= 0) {
return dev_write_fd(buf, offset, len);
}
// sparse file fills with zero by default.
// return sparse_file_add_fill(f2fs_sparse_file, ((__u8*)(bi->buf))[0], byte_len, byte_offset/F2FS_BLKSIZE);
return 0;
}
int dev_fill_block(void *buf, __u64 blk_addr)
{
assert(false); // Must not be invoked.
return 0;
}
int dev_read_block(void *buf, __u64 blk_addr)
{
assert(false); // Must not be invoked.
return 0;
}
int dev_read_blocks(void *buf, __u64 addr, __u32 nr_blks)
{
assert(false); // Must not be invoked.
return 0;
}
int dev_reada_block(__u64 blk_addr)
{
assert(false); // Must not be invoked.
return 0;
}
|