cd9660.c revision 224762
1/* $NetBSD: cd9660.c,v 1.31 2011/08/06 23:25:19 christos Exp $ */ 2 3/* 4 * Copyright (c) 2005 Daniel Watt, Walter Deignan, Ryan Gabrys, Alan 5 * Perez-Rathke and Ram Vedam. All rights reserved. 6 * 7 * This code was written by Daniel Watt, Walter Deignan, Ryan Gabrys, 8 * Alan Perez-Rathke and Ram Vedam. 9 * 10 * Redistribution and use in source and binary forms, with or 11 * without modification, are permitted provided that the following 12 * conditions are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above 16 * copyright notice, this list of conditions and the following 17 * disclaimer in the documentation and/or other materials provided 18 * with the distribution. 19 * 20 * THIS SOFTWARE IS PROVIDED BY DANIEL WATT, WALTER DEIGNAN, RYAN 21 * GABRYS, ALAN PEREZ-RATHKE AND RAM VEDAM ``AS IS'' AND ANY EXPRESS OR 22 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 23 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE 24 * DISCLAIMED. IN NO EVENT SHALL DANIEL WATT, WALTER DEIGNAN, RYAN 25 * GABRYS, ALAN PEREZ-RATHKE AND RAM VEDAM BE LIABLE FOR ANY DIRECT, INDIRECT, 26 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 27 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF 28 * USE,DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND 29 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, 30 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY 32 * OF SUCH DAMAGE. 33 */ 34/* 35 * Copyright (c) 2001 Wasabi Systems, Inc. 36 * All rights reserved. 37 * 38 * Written by Luke Mewburn for Wasabi Systems, Inc. 39 * 40 * Redistribution and use in source and binary forms, with or without 41 * modification, are permitted provided that the following conditions 42 * are met: 43 * 1. Redistributions of source code must retain the above copyright 44 * notice, this list of conditions and the following disclaimer. 45 * 2. Redistributions in binary form must reproduce the above copyright 46 * notice, this list of conditions and the following disclaimer in the 47 * documentation and/or other materials provided with the distribution. 48 * 3. All advertising materials mentioning features or use of this software 49 * must display the following acknowledgement: 50 * This product includes software developed for the NetBSD Project by 51 * Wasabi Systems, Inc. 52 * 4. The name of Wasabi Systems, Inc. may not be used to endorse 53 * or promote products derived from this software without specific prior 54 * written permission. 55 * 56 * THIS SOFTWARE IS PROVIDED BY WASABI SYSTEMS, INC. ``AS IS'' AND 57 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 58 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 59 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL WASABI SYSTEMS, INC 60 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 61 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 62 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 63 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 64 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 65 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 66 * POSSIBILITY OF SUCH DAMAGE. 67 */ 68/* 69 * Copyright (c) 1982, 1986, 1989, 1993 70 * The Regents of the University of California. All rights reserved. 71 * 72 * Redistribution and use in source and binary forms, with or without 73 * modification, are permitted provided that the following conditions 74 * are met: 75 * 1. Redistributions of source code must retain the above copyright 76 * notice, this list of conditions and the following disclaimer. 77 * 2. Redistributions in binary form must reproduce the above copyright 78 * notice, this list of conditions and the following disclaimer in the 79 * documentation and/or other materials provided with the distribution. 80 * 3. Neither the name of the University nor the names of its contributors 81 * may be used to endorse or promote products derived from this software 82 * without specific prior written permission. 83 * 84 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 85 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 86 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 87 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 88 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 89 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 90 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 91 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 92 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 93 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 94 * SUCH DAMAGE. 95 * 96 */ 97 98#include <sys/cdefs.h> 99__FBSDID("$FreeBSD: head/usr.sbin/makefs/cd9660.c 224762 2011-08-10 19:12:21Z marius $"); 100 101#include <string.h> 102#include <ctype.h> 103#include <sys/param.h> 104#include <sys/queue.h> 105 106#include "makefs.h" 107#include "cd9660.h" 108#include "cd9660/iso9660_rrip.h" 109#include "cd9660/cd9660_archimedes.h" 110 111/* 112 * Global variables 113 */ 114iso9660_disk diskStructure; 115 116static void cd9660_finalize_PVD(void); 117static cd9660node *cd9660_allocate_cd9660node(void); 118static void cd9660_set_defaults(void); 119static int cd9660_arguments_set_string(const char *, const char *, int, 120 char, char *); 121static void cd9660_populate_iso_dir_record( 122 struct _iso_directory_record_cd9660 *, u_char, u_char, u_char, 123 const char *); 124static void cd9660_setup_root_node(void); 125static int cd9660_setup_volume_descriptors(void); 126#if 0 127static int cd9660_fill_extended_attribute_record(cd9660node *); 128#endif 129static void cd9660_sort_nodes(cd9660node *); 130static int cd9660_translate_node_common(cd9660node *); 131static int cd9660_translate_node(fsnode *, cd9660node *); 132static int cd9660_compare_filename(const char *, const char *); 133static void cd9660_sorted_child_insert(cd9660node *, cd9660node *); 134static int cd9660_handle_collisions(cd9660node *, int); 135static cd9660node *cd9660_rename_filename(cd9660node *, int, int); 136static void cd9660_copy_filenames(cd9660node *); 137static void cd9660_sorting_nodes(cd9660node *); 138static int cd9660_count_collisions(cd9660node *); 139static cd9660node *cd9660_rrip_move_directory(cd9660node *); 140static int cd9660_add_dot_records(cd9660node *); 141 142static void cd9660_convert_structure(fsnode *, cd9660node *, int, 143 int *, int *); 144static void cd9660_free_structure(cd9660node *); 145static int cd9660_generate_path_table(void); 146static int cd9660_level1_convert_filename(const char *, char *, int); 147static int cd9660_level2_convert_filename(const char *, char *, int); 148#if 0 149static int cd9660_joliet_convert_filename(const char *, char *, int); 150#endif 151static int cd9660_convert_filename(const char *, char *, int); 152static void cd9660_populate_dot_records(cd9660node *); 153static int64_t cd9660_compute_offsets(cd9660node *, int64_t); 154#if 0 155static int cd9660_copy_stat_info(cd9660node *, cd9660node *, int); 156#endif 157static cd9660node *cd9660_create_virtual_entry(const char *, cd9660node *, int, 158 int); 159static cd9660node *cd9660_create_file(const char *, cd9660node *, cd9660node *); 160static cd9660node *cd9660_create_directory(const char *, cd9660node *, 161 cd9660node *); 162static cd9660node *cd9660_create_special_directory(u_char, cd9660node *); 163 164 165/* 166 * Allocate and initalize a cd9660node 167 * @returns struct cd9660node * Pointer to new node, or NULL on error 168 */ 169static cd9660node * 170cd9660_allocate_cd9660node(void) 171{ 172 cd9660node *temp; 173 174 if ((temp = calloc(1, sizeof(cd9660node))) == NULL) 175 err(EXIT_FAILURE, "%s: calloc", __func__); 176 TAILQ_INIT(&temp->cn_children); 177 temp->parent = temp->dot_record = temp->dot_dot_record = NULL; 178 temp->ptnext = temp->ptprev = temp->ptlast = NULL; 179 temp->node = NULL; 180 temp->isoDirRecord = NULL; 181 temp->isoExtAttributes = NULL; 182 temp->rr_real_parent = temp->rr_relocated = NULL; 183 temp->su_tail_data = NULL; 184 return temp; 185} 186 187int cd9660_defaults_set = 0; 188 189/** 190* Set default values for cd9660 extension to makefs 191*/ 192static void 193cd9660_set_defaults(void) 194{ 195 /*Fix the sector size for now, though the spec allows for other sizes*/ 196 diskStructure.sectorSize = 2048; 197 198 /* Set up defaults in our own structure */ 199 diskStructure.verbose_level = 0; 200 diskStructure.keep_bad_images = 0; 201 diskStructure.follow_sym_links = 0; 202 diskStructure.isoLevel = 2; 203 204 diskStructure.rock_ridge_enabled = 0; 205 diskStructure.rock_ridge_renamed_dir_name = 0; 206 diskStructure.rock_ridge_move_count = 0; 207 diskStructure.rr_moved_dir = 0; 208 209 diskStructure.archimedes_enabled = 0; 210 diskStructure.chrp_boot = 0; 211 212 diskStructure.include_padding_areas = 1; 213 214 /* Spec breaking functionality */ 215 diskStructure.allow_deep_trees = 216 diskStructure.allow_start_dot = 217 diskStructure.allow_max_name = 218 diskStructure.allow_illegal_chars = 219 diskStructure.allow_lowercase = 220 diskStructure.allow_multidot = 221 diskStructure.omit_trailing_period = 0; 222 223 /* Make sure the PVD is clear */ 224 memset(&diskStructure.primaryDescriptor, 0, 2048); 225 226 memset(diskStructure.primaryDescriptor.publisher_id, 0x20,128); 227 memset(diskStructure.primaryDescriptor.preparer_id, 0x20,128); 228 memset(diskStructure.primaryDescriptor.application_id, 0x20,128); 229 memset(diskStructure.primaryDescriptor.copyright_file_id, 0x20,37); 230 memset(diskStructure.primaryDescriptor.abstract_file_id, 0x20,37); 231 memset(diskStructure.primaryDescriptor.bibliographic_file_id, 0x20,37); 232 233 strcpy(diskStructure.primaryDescriptor.system_id,"NetBSD"); 234 235 cd9660_defaults_set = 1; 236 237 /* Boot support: Initially disabled */ 238 diskStructure.has_generic_bootimage = 0; 239 diskStructure.generic_bootimage = NULL; 240 241 diskStructure.boot_image_directory = 0; 242 /*memset(diskStructure.boot_descriptor, 0, 2048);*/ 243 244 diskStructure.is_bootable = 0; 245 TAILQ_INIT(&diskStructure.boot_images); 246 LIST_INIT(&diskStructure.boot_entries); 247} 248 249void 250cd9660_prep_opts(fsinfo_t *fsopts __unused) 251{ 252 cd9660_set_defaults(); 253} 254 255void 256cd9660_cleanup_opts(fsinfo_t *fsopts __unused) 257{ 258 259} 260 261static int 262cd9660_arguments_set_string(const char *val, const char *fieldtitle, int length, 263 char testmode, char * dest) 264{ 265 int len, test; 266 267 if (val == NULL) 268 warnx("error: The %s requires a string argument", fieldtitle); 269 else if ((len = strlen(val)) <= length) { 270 if (testmode == 'd') 271 test = cd9660_valid_d_chars(val); 272 else 273 test = cd9660_valid_a_chars(val); 274 if (test) { 275 memcpy(dest, val, len); 276 if (test == 2) 277 cd9660_uppercase_characters(dest, len); 278 return 1; 279 } else 280 warnx("error: The %s must be composed of " 281 "%c-characters", fieldtitle, testmode); 282 } else 283 warnx("error: The %s must be at most 32 characters long", 284 fieldtitle); 285 return 0; 286} 287 288/* 289 * Command-line parsing function 290 */ 291 292int 293cd9660_parse_opts(const char *option, fsinfo_t *fsopts) 294{ 295 char *var, *val; 296 int rv; 297 /* Set up allowed options - integer options ONLY */ 298 option_t cd9660_options[] = { 299 { "l", &diskStructure.isoLevel, 1, 3, "ISO Level" }, 300 { "isolevel", &diskStructure.isoLevel, 1, 3, "ISO Level" }, 301 { "verbose", &diskStructure.verbose_level, 0, 2, 302 "Turns on verbose output" }, 303 { "v", &diskStructure.verbose_level, 0 , 2, 304 "Turns on verbose output"}, 305 { .name = NULL } 306 }; 307 308 if (cd9660_defaults_set == 0) 309 cd9660_set_defaults(); 310 311 /* 312 * Todo : finish implementing this, and make a function that 313 * parses them 314 */ 315 /* 316 string_option_t cd9660_string_options[] = { 317 { "L", "Label", &diskStructure.primaryDescriptor.volume_id, 1, 32, "Disk Label", ISO_STRING_FILTER_DCHARS }, 318 { NULL } 319 } 320 */ 321 322 assert(option != NULL); 323 324 if (debug & DEBUG_FS_PARSE_OPTS) 325 printf("cd9660_parse_opts: got `%s'\n", option); 326 327 if ((var = strdup(option)) == NULL) 328 err(1, "allocating memory for copy of option string"); 329 rv = 1; 330 331 val = strchr(var, '='); 332 if (val != NULL) 333 *val++ = '\0'; 334 335 /* First handle options with no parameters */ 336 if (strcmp(var, "h") == 0) { 337 diskStructure.displayHelp = 1; 338 rv = 1; 339 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "S", "follow-symlinks")) { 340 /* this is not handled yet */ 341 diskStructure.follow_sym_links = 1; 342 rv = 1; 343 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "L", "label")) { 344 rv = cd9660_arguments_set_string(val, "Disk Label", 32, 'd', 345 diskStructure.primaryDescriptor.volume_id); 346 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "A", "applicationid")) { 347 rv = cd9660_arguments_set_string(val, "Application Identifier", 128, 'a', 348 diskStructure.primaryDescriptor.application_id); 349 } else if(CD9660_IS_COMMAND_ARG_DUAL(var, "P", "publisher")) { 350 rv = cd9660_arguments_set_string(val, "Publisher Identifier", 351 128, 'a', diskStructure.primaryDescriptor.publisher_id); 352 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "p", "preparer")) { 353 rv = cd9660_arguments_set_string(val, "Preparer Identifier", 354 128, 'a', diskStructure.primaryDescriptor.preparer_id); 355 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "V", "volumeid")) { 356 rv = cd9660_arguments_set_string(val, "Volume Set Identifier", 357 128, 'a', diskStructure.primaryDescriptor.volume_set_id); 358 /* Boot options */ 359 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "B", "bootimage")) { 360 if (val == NULL) 361 warnx("error: The Boot Image parameter requires a valid boot information string"); 362 else 363 rv = cd9660_add_boot_disk(val); 364 } else if (CD9660_IS_COMMAND_ARG(var, "bootimagedir")) { 365 /* 366 * XXXfvdl this is unused. 367 */ 368 if (val == NULL) 369 errx(1, "error: The Boot Image Directory parameter" 370 " requires a directory name\n"); 371 else { 372 if ((diskStructure.boot_image_directory = 373 malloc(strlen(val) + 1)) == NULL) { 374 CD9660_MEM_ALLOC_ERROR("cd9660_parse_opts"); 375 exit(1); 376 } 377 378 /* BIG TODO: Add the max length function here */ 379 cd9660_arguments_set_string(val, "Boot Image Directory", 380 12 , 'd', diskStructure.boot_image_directory); 381 } 382 } else if (CD9660_IS_COMMAND_ARG_DUAL(var, "G", "generic-bootimage")) { 383 if (val == NULL) 384 warnx("error: The Boot Image parameter requires a valid boot information string"); 385 else 386 rv = cd9660_add_generic_bootimage(val); 387 } else if (CD9660_IS_COMMAND_ARG(var, "no-trailing-padding")) 388 diskStructure.include_padding_areas = 0; 389 /* RRIP */ 390 else if (CD9660_IS_COMMAND_ARG_DUAL(var, "R", "rockridge")) 391 diskStructure.rock_ridge_enabled = 1; 392 else if (CD9660_IS_COMMAND_ARG_DUAL(var, "A", "archimedes")) 393 diskStructure.archimedes_enabled = 1; 394 else if (CD9660_IS_COMMAND_ARG(var, "chrp-boot")) 395 diskStructure.chrp_boot = 1; 396 else if (CD9660_IS_COMMAND_ARG_DUAL(var, "K", "keep-bad-images")) 397 diskStructure.keep_bad_images = 1; 398 else if (CD9660_IS_COMMAND_ARG(var, "allow-deep-trees")) 399 diskStructure.allow_deep_trees = 1; 400 else if (CD9660_IS_COMMAND_ARG(var, "allow-max-name")) 401 diskStructure.allow_max_name = 1; 402 else if (CD9660_IS_COMMAND_ARG(var, "allow-illegal-chars")) 403 diskStructure.allow_illegal_chars = 1; 404 else if (CD9660_IS_COMMAND_ARG(var, "allow-lowercase")) 405 diskStructure.allow_lowercase = 1; 406 else if (CD9660_IS_COMMAND_ARG(var,"allow-multidot")) 407 diskStructure.allow_multidot = 1; 408 else if (CD9660_IS_COMMAND_ARG(var, "omit-trailing-period")) 409 diskStructure.omit_trailing_period = 1; 410 else if (CD9660_IS_COMMAND_ARG(var, "no-emul-boot") || 411 CD9660_IS_COMMAND_ARG(var, "no-boot") || 412 CD9660_IS_COMMAND_ARG(var, "hard-disk-boot")) { 413 cd9660_eltorito_add_boot_option(var, 0); 414 415 /* End of flag variables */ 416 } else if (CD9660_IS_COMMAND_ARG(var, "boot-load-segment")) { 417 if (val == NULL) { 418 warnx("Option `%s' doesn't contain a value", var); 419 rv = 0; 420 } else { 421 cd9660_eltorito_add_boot_option(var, val); 422 } 423 } else { 424 if (val == NULL) { 425 warnx("Option `%s' doesn't contain a value", var); 426 rv = 0; 427 } else 428 rv = set_option(cd9660_options, var, val); 429 } 430 431 if (var) 432 free(var); 433 return (rv); 434} 435 436/* 437 * Main function for cd9660_makefs 438 * Builds the ISO image file 439 * @param const char *image The image filename to create 440 * @param const char *dir The directory that is being read 441 * @param struct fsnode *root The root node of the filesystem tree 442 * @param struct fsinfo_t *fsopts Any options 443 */ 444void 445cd9660_makefs(const char *image, const char *dir, fsnode *root, 446 fsinfo_t *fsopts) 447{ 448 int64_t startoffset; 449 int numDirectories; 450 uint64_t pathTableSectors; 451 int64_t firstAvailableSector; 452 int64_t totalSpace; 453 int error; 454 cd9660node *real_root; 455 456 if (diskStructure.verbose_level > 0) 457 printf("cd9660_makefs: ISO level is %i\n", 458 diskStructure.isoLevel); 459 if (diskStructure.isoLevel < 2 && 460 diskStructure.allow_multidot) 461 errx(1, "allow-multidot requires iso level of 2\n"); 462 463 assert(image != NULL); 464 assert(dir != NULL); 465 assert(root != NULL); 466 467 if (diskStructure.displayHelp) { 468 /* 469 * Display help here - probably want to put it in 470 * a separate function 471 */ 472 return; 473 } 474 475 diskStructure.rootFilesystemPath = dir; 476 477 if (diskStructure.verbose_level > 0) 478 printf("cd9660_makefs: image %s directory %s root %p\n", 479 image, dir, root); 480 481 /* Set up some constants. Later, these will be defined with options */ 482 483 /* Counter needed for path tables */ 484 numDirectories = 0; 485 486 /* Convert tree to our own format */ 487 /* Actually, we now need to add the REAL root node, at level 0 */ 488 489 real_root = cd9660_allocate_cd9660node(); 490 if ((real_root->isoDirRecord = 491 malloc( sizeof(iso_directory_record_cd9660) )) == NULL) { 492 CD9660_MEM_ALLOC_ERROR("cd9660_makefs"); 493 exit(1); 494 } 495 496 /* Leave filename blank for root */ 497 memset(real_root->isoDirRecord->name, 0, 498 ISO_FILENAME_MAXLENGTH_WITH_PADDING); 499 500 real_root->level = 0; 501 diskStructure.rootNode = real_root; 502 real_root->type = CD9660_TYPE_DIR; 503 error = 0; 504 real_root->node = root; 505 cd9660_convert_structure(root, real_root, 1, &numDirectories, &error); 506 507 if (TAILQ_EMPTY(&real_root->cn_children)) { 508 errx(1, "cd9660_makefs: converted directory is empty. " 509 "Tree conversion failed\n"); 510 } else if (error != 0) { 511 errx(1, "cd9660_makefs: tree conversion failed\n"); 512 } else { 513 if (diskStructure.verbose_level > 0) 514 printf("cd9660_makefs: tree converted\n"); 515 } 516 517 /* Add the dot and dot dot records */ 518 cd9660_add_dot_records(real_root); 519 520 cd9660_setup_root_node(); 521 522 if (diskStructure.verbose_level > 0) 523 printf("cd9660_makefs: done converting tree\n"); 524 525 /* non-SUSP extensions */ 526 if (diskStructure.archimedes_enabled) 527 archimedes_convert_tree(diskStructure.rootNode); 528 529 /* Rock ridge / SUSP init pass */ 530 if (diskStructure.rock_ridge_enabled) { 531 cd9660_susp_initialize(diskStructure.rootNode, 532 diskStructure.rootNode, NULL); 533 } 534 535 /* Build path table structure */ 536 diskStructure.pathTableLength = cd9660_generate_path_table(); 537 538 pathTableSectors = CD9660_BLOCKS(diskStructure.sectorSize, 539 diskStructure.pathTableLength); 540 541 firstAvailableSector = cd9660_setup_volume_descriptors(); 542 if (diskStructure.is_bootable) { 543 firstAvailableSector = cd9660_setup_boot(firstAvailableSector); 544 if (firstAvailableSector < 0) 545 errx(1, "setup_boot failed"); 546 } 547 /* LE first, then BE */ 548 diskStructure.primaryLittleEndianTableSector = firstAvailableSector; 549 diskStructure.primaryBigEndianTableSector = 550 diskStructure.primaryLittleEndianTableSector + pathTableSectors; 551 552 /* Set the secondary ones to -1, not going to use them for now */ 553 diskStructure.secondaryBigEndianTableSector = -1; 554 diskStructure.secondaryLittleEndianTableSector = -1; 555 556 diskStructure.dataFirstSector = 557 diskStructure.primaryBigEndianTableSector + pathTableSectors; 558 if (diskStructure.verbose_level > 0) 559 printf("cd9660_makefs: Path table conversion complete. " 560 "Each table is %i bytes, or %" PRIu64 " sectors.\n", 561 diskStructure.pathTableLength, pathTableSectors); 562 563 startoffset = diskStructure.sectorSize*diskStructure.dataFirstSector; 564 565 totalSpace = cd9660_compute_offsets(real_root, startoffset); 566 567 diskStructure.totalSectors = diskStructure.dataFirstSector + 568 CD9660_BLOCKS(diskStructure.sectorSize, totalSpace); 569 570 /* Disabled until pass 1 is done */ 571 if (diskStructure.rock_ridge_enabled) { 572 diskStructure.susp_continuation_area_start_sector = 573 diskStructure.totalSectors; 574 diskStructure.totalSectors += 575 CD9660_BLOCKS(diskStructure.sectorSize, 576 diskStructure.susp_continuation_area_size); 577 cd9660_susp_finalize(diskStructure.rootNode); 578 } 579 580 581 cd9660_finalize_PVD(); 582 583 /* Add padding sectors, just for testing purposes right now */ 584 /* diskStructure.totalSectors+=150; */ 585 586 /* Debugging output */ 587 if (diskStructure.verbose_level > 0) { 588 printf("cd9660_makefs: Sectors 0-15 reserved\n"); 589 printf("cd9660_makefs: Primary path tables starts in sector %" 590 PRId64 "\n", diskStructure.primaryLittleEndianTableSector); 591 printf("cd9660_makefs: File data starts in sector %" 592 PRId64 "\n", diskStructure.dataFirstSector); 593 printf("cd9660_makefs: Total sectors: %" 594 PRId64 "\n", diskStructure.totalSectors); 595 } 596 597 /* 598 * Add padding sectors at the end 599 * TODO: Clean this up and separate padding 600 */ 601 if (diskStructure.include_padding_areas) 602 diskStructure.totalSectors += 150; 603 604 cd9660_write_image(image); 605 606 if (diskStructure.verbose_level > 1) { 607 debug_print_volume_descriptor_information(); 608 debug_print_tree(real_root,0); 609 debug_print_path_tree(real_root); 610 } 611 612 /* Clean up data structures */ 613 cd9660_free_structure(real_root); 614 615 if (diskStructure.verbose_level > 0) 616 printf("cd9660_makefs: done\n"); 617} 618 619/* Generic function pointer - implement later */ 620typedef int (*cd9660node_func)(cd9660node *); 621 622static void 623cd9660_finalize_PVD(void) 624{ 625 time_t tim; 626 unsigned char *temp; 627 628 /* Copy the root directory record */ 629 temp = (unsigned char *) &diskStructure.primaryDescriptor; 630 631 /* root should be a fixed size of 34 bytes since it has no name */ 632 memcpy(diskStructure.primaryDescriptor.root_directory_record, 633 diskStructure.rootNode->dot_record->isoDirRecord, 34); 634 635 /* In RRIP, this might be longer than 34 */ 636 diskStructure.primaryDescriptor.root_directory_record[0] = 34; 637 638 /* Set up all the important numbers in the PVD */ 639 cd9660_bothendian_dword(diskStructure.totalSectors, 640 (unsigned char *)diskStructure.primaryDescriptor.volume_space_size); 641 cd9660_bothendian_word(1, 642 (unsigned char *)diskStructure.primaryDescriptor.volume_set_size); 643 cd9660_bothendian_word(1, 644 (unsigned char *) 645 diskStructure.primaryDescriptor.volume_sequence_number); 646 cd9660_bothendian_word(diskStructure.sectorSize, 647 (unsigned char *) 648 diskStructure.primaryDescriptor.logical_block_size); 649 cd9660_bothendian_dword(diskStructure.pathTableLength, 650 (unsigned char *)diskStructure.primaryDescriptor.path_table_size); 651 652 cd9660_731(diskStructure.primaryLittleEndianTableSector, 653 (u_char *)diskStructure.primaryDescriptor.type_l_path_table); 654 cd9660_732(diskStructure.primaryBigEndianTableSector, 655 (u_char *)diskStructure.primaryDescriptor.type_m_path_table); 656 657 diskStructure.primaryDescriptor.file_structure_version[0] = 1; 658 659 /* Pad all strings with spaces instead of nulls */ 660 cd9660_pad_string_spaces(diskStructure.primaryDescriptor.volume_id, 32); 661 cd9660_pad_string_spaces(diskStructure.primaryDescriptor.system_id, 32); 662 cd9660_pad_string_spaces(diskStructure.primaryDescriptor.volume_set_id, 663 128); 664 cd9660_pad_string_spaces(diskStructure.primaryDescriptor.publisher_id, 665 128); 666 cd9660_pad_string_spaces(diskStructure.primaryDescriptor.preparer_id, 667 128); 668 cd9660_pad_string_spaces(diskStructure.primaryDescriptor.application_id, 669 128); 670 cd9660_pad_string_spaces( 671 diskStructure.primaryDescriptor.copyright_file_id, 37); 672 cd9660_pad_string_spaces( 673 diskStructure.primaryDescriptor.abstract_file_id, 37); 674 cd9660_pad_string_spaces( 675 diskStructure.primaryDescriptor.bibliographic_file_id, 37); 676 677 /* Setup dates */ 678 time(&tim); 679 cd9660_time_8426( 680 (unsigned char *)diskStructure.primaryDescriptor.creation_date, 681 tim); 682 cd9660_time_8426( 683 (unsigned char *)diskStructure.primaryDescriptor.modification_date, 684 tim); 685 686 /* 687 cd9660_set_date(diskStructure.primaryDescriptor.expiration_date, now); 688 */ 689 690 memset(diskStructure.primaryDescriptor.expiration_date, '0' ,17); 691 cd9660_time_8426( 692 (unsigned char *)diskStructure.primaryDescriptor.effective_date, 693 tim); 694} 695 696static void 697cd9660_populate_iso_dir_record(struct _iso_directory_record_cd9660 *record, 698 u_char ext_attr_length, u_char flags, 699 u_char name_len, const char * name) 700{ 701 record->ext_attr_length[0] = ext_attr_length; 702 record->flags[0] = ISO_FLAG_CLEAR | flags; 703 record->file_unit_size[0] = 0; 704 record->interleave[0] = 0; 705 cd9660_bothendian_word(1, record->volume_sequence_number); 706 record->name_len[0] = name_len; 707 memset(record->name, '\0', sizeof (record->name)); 708 memcpy(record->name, name, name_len); 709 record->length[0] = 33 + name_len; 710 711 /* Todo : better rounding */ 712 record->length[0] += (record->length[0] & 1) ? 1 : 0; 713} 714 715static void 716cd9660_setup_root_node(void) 717{ 718 cd9660_populate_iso_dir_record(diskStructure.rootNode->isoDirRecord, 719 0, ISO_FLAG_DIRECTORY, 1, "\0"); 720 721} 722 723/*********** SUPPORT FUNCTIONS ***********/ 724static int 725cd9660_setup_volume_descriptors(void) 726{ 727 /* Boot volume descriptor should come second */ 728 int sector = 16; 729 /* For now, a fixed 2 : PVD and terminator */ 730 volume_descriptor *temp, *t; 731 732 /* Set up the PVD */ 733 if ((temp = malloc(sizeof(volume_descriptor))) == NULL) { 734 CD9660_MEM_ALLOC_ERROR("cd9660_setup_volume_descriptors"); 735 exit(1); 736 } 737 738 temp->volumeDescriptorData = 739 (unsigned char *)&diskStructure.primaryDescriptor; 740 temp->volumeDescriptorData[0] = ISO_VOLUME_DESCRIPTOR_PVD; 741 temp->volumeDescriptorData[6] = 1; 742 temp->sector = sector; 743 memcpy(temp->volumeDescriptorData + 1, 744 ISO_VOLUME_DESCRIPTOR_STANDARD_ID, 5); 745 diskStructure.firstVolumeDescriptor = temp; 746 747 sector++; 748 /* Set up boot support if enabled. BVD must reside in sector 17 */ 749 if (diskStructure.is_bootable) { 750 if ((t = malloc(sizeof(volume_descriptor))) == NULL) { 751 CD9660_MEM_ALLOC_ERROR( 752 "cd9660_setup_volume_descriptors"); 753 exit(1); 754 } 755 if ((t->volumeDescriptorData = malloc(2048)) == NULL) { 756 CD9660_MEM_ALLOC_ERROR( 757 "cd9660_setup_volume_descriptors"); 758 exit(1); 759 } 760 temp->next = t; 761 temp = t; 762 memset(t->volumeDescriptorData, 0, 2048); 763 t->sector = 17; 764 if (diskStructure.verbose_level > 0) 765 printf("Setting up boot volume descriptor\n"); 766 cd9660_setup_boot_volume_descriptor(t); 767 sector++; 768 } 769 770 /* Set up the terminator */ 771 if ((t = malloc(sizeof(volume_descriptor))) == NULL) { 772 CD9660_MEM_ALLOC_ERROR("cd9660_setup_volume_descriptors"); 773 exit(1); 774 } 775 if ((t->volumeDescriptorData = malloc(2048)) == NULL) { 776 CD9660_MEM_ALLOC_ERROR("cd9660_setup_volume_descriptors"); 777 exit(1); 778 } 779 780 temp->next = t; 781 memset(t->volumeDescriptorData, 0, 2048); 782 t->volumeDescriptorData[0] = ISO_VOLUME_DESCRIPTOR_TERMINATOR; 783 t->next = 0; 784 t->volumeDescriptorData[6] = 1; 785 t->sector = sector; 786 memcpy(t->volumeDescriptorData + 1, 787 ISO_VOLUME_DESCRIPTOR_STANDARD_ID, 5); 788 789 sector++; 790 return sector; 791} 792 793#if 0 794/* 795 * Populate EAR at some point. Not required, but is used by NetBSD's 796 * cd9660 support 797 */ 798static int 799cd9660_fill_extended_attribute_record(cd9660node *node) 800{ 801 if ((node->isoExtAttributes = 802 malloc(sizeof(struct iso_extended_attributes))) == NULL) { 803 CD9660_MEM_ALLOC_ERROR("cd9660_fill_extended_attribute_record"); 804 exit(1); 805 }; 806 807 return 1; 808} 809#endif 810 811static int 812cd9660_translate_node_common(cd9660node *newnode) 813{ 814 time_t tim; 815 int test; 816 u_char flag; 817 char temp[ISO_FILENAME_MAXLENGTH_WITH_PADDING]; 818 819 /* Now populate the isoDirRecord structure */ 820 memset(temp, 0, ISO_FILENAME_MAXLENGTH_WITH_PADDING); 821 822 test = cd9660_convert_filename(newnode->node->name, 823 temp, !(S_ISDIR(newnode->node->type))); 824 825 flag = ISO_FLAG_CLEAR; 826 if (S_ISDIR(newnode->node->type)) 827 flag |= ISO_FLAG_DIRECTORY; 828 829 cd9660_populate_iso_dir_record(newnode->isoDirRecord, 0, 830 flag, strlen(temp), temp); 831 832 /* Set the various dates */ 833 834 /* If we want to use the current date and time */ 835 time(&tim); 836 837 cd9660_time_915(newnode->isoDirRecord->date, tim); 838 839 cd9660_bothendian_dword(newnode->fileDataLength, 840 newnode->isoDirRecord->size); 841 /* If the file is a link, we want to set the size to 0 */ 842 if (S_ISLNK(newnode->node->type)) 843 newnode->fileDataLength = 0; 844 845 return 1; 846} 847 848/* 849 * Translate fsnode to cd9660node 850 * Translate filenames and other metadata, including dates, sizes, 851 * permissions, etc 852 * @param struct fsnode * The node generated by makefs 853 * @param struct cd9660node * The intermediate node to be written to 854 * @returns int 0 on failure, 1 on success 855 */ 856static int 857cd9660_translate_node(fsnode *node, cd9660node *newnode) 858{ 859 if (node == NULL) { 860 if (diskStructure.verbose_level > 0) 861 printf("cd9660_translate_node: NULL node passed, " 862 "returning\n"); 863 return 0; 864 } 865 if ((newnode->isoDirRecord = 866 malloc(sizeof(iso_directory_record_cd9660))) == NULL) { 867 CD9660_MEM_ALLOC_ERROR("cd9660_translate_node"); 868 return 0; 869 } 870 871 /* Set the node pointer */ 872 newnode->node = node; 873 874 /* Set the size */ 875 if (!(S_ISDIR(node->type))) 876 newnode->fileDataLength = node->inode->st.st_size; 877 878 if (cd9660_translate_node_common(newnode) == 0) 879 return 0; 880 881 /* Finally, overwrite some of the values that are set by default */ 882 cd9660_time_915(newnode->isoDirRecord->date, node->inode->st.st_mtime); 883 884 return 1; 885} 886 887/* 888 * Compares two ISO filenames 889 * @param const char * The first file name 890 * @param const char * The second file name 891 * @returns : -1 if first is less than second, 0 if they are the same, 1 if 892 * the second is greater than the first 893 */ 894static int 895cd9660_compare_filename(const char *first, const char *second) 896{ 897 /* 898 * This can be made more optimal once it has been tested 899 * (the extra character, for example, is for testing) 900 */ 901 902 int p1 = 0; 903 int p2 = 0; 904 char c1, c2; 905 /* First, on the filename */ 906 907 while (p1 < ISO_FILENAME_MAXLENGTH_BEFORE_VERSION-1 908 && p2 < ISO_FILENAME_MAXLENGTH_BEFORE_VERSION-1) { 909 c1 = first[p1]; 910 c2 = second[p2]; 911 if (c1 == '.' && c2 =='.') 912 break; 913 else if (c1 == '.') { 914 p2++; 915 c1 = ' '; 916 } else if (c2 == '.') { 917 p1++; 918 c2 = ' '; 919 } else { 920 p1++; 921 p2++; 922 } 923 924 if (c1 < c2) 925 return -1; 926 else if (c1 > c2) { 927 return 1; 928 } 929 } 930 931 if (first[p1] == '.' && second[p2] == '.') { 932 p1++; 933 p2++; 934 while (p1 < ISO_FILENAME_MAXLENGTH_BEFORE_VERSION - 1 935 && p2 < ISO_FILENAME_MAXLENGTH_BEFORE_VERSION - 1) { 936 c1 = first[p1]; 937 c2 = second[p2]; 938 if (c1 == ';' && c2 == ';') 939 break; 940 else if (c1 == ';') { 941 p2++; 942 c1 = ' '; 943 } else if (c2 == ';') { 944 p1++; 945 c2 = ' '; 946 } else { 947 p1++; 948 p2++; 949 } 950 951 if (c1 < c2) 952 return -1; 953 else if (c1 > c2) 954 return 1; 955 } 956 } 957 return 0; 958} 959 960/* 961 * Insert a node into list with ISO sorting rules 962 * @param cd9660node * The head node of the list 963 * @param cd9660node * The node to be inserted 964 */ 965static void 966cd9660_sorted_child_insert(cd9660node *parent, cd9660node *cn_new) 967{ 968 int compare; 969 cd9660node *cn; 970 struct cd9660_children_head *head = &parent->cn_children; 971 972 /* TODO: Optimize? */ 973 cn_new->parent = parent; 974 975 /* 976 * first will either be 0, the . or the .. 977 * if . or .., this means no other entry may be written before first 978 * if 0, the new node may be inserted at the head 979 */ 980 981 TAILQ_FOREACH(cn, head, cn_next_child) { 982 /* 983 * Dont insert a node twice - 984 * that would cause an infinite loop 985 */ 986 if (cn_new == cn) 987 return; 988 989 compare = cd9660_compare_filename(cn_new->isoDirRecord->name, 990 cn->isoDirRecord->name); 991 992 if (compare == 0) 993 compare = cd9660_compare_filename(cn_new->node->name, 994 cn->node->name); 995 996 if (compare < 0) 997 break; 998 } 999 if (cn == NULL) 1000 TAILQ_INSERT_TAIL(head, cn_new, cn_next_child); 1001 else 1002 TAILQ_INSERT_BEFORE(cn, cn_new, cn_next_child); 1003} 1004 1005/* 1006 * Called After cd9660_sorted_child_insert 1007 * handles file collisions by suffixing each filname with ~n 1008 * where n represents the files respective place in the ordering 1009 */ 1010static int 1011cd9660_handle_collisions(cd9660node *colliding, int past) 1012{ 1013 cd9660node *iter, *next, *prev; 1014 int skip; 1015 int delete_chars = 0; 1016 int temp_past = past; 1017 int temp_skip; 1018 int flag = 0; 1019 cd9660node *end_of_range; 1020 1021 for (iter = TAILQ_FIRST(&colliding->cn_children); 1022 iter != NULL && (next = TAILQ_NEXT(iter, cn_next_child)) != NULL;) { 1023 if (strcmp(iter->isoDirRecord->name, 1024 next->isoDirRecord->name) != 0) { 1025 iter = TAILQ_NEXT(iter, cn_next_child); 1026 continue; 1027 } 1028 flag = 1; 1029 temp_skip = skip = cd9660_count_collisions(iter); 1030 end_of_range = iter; 1031 while (temp_skip > 0) { 1032 temp_skip--; 1033 end_of_range = TAILQ_NEXT(end_of_range, cn_next_child); 1034 } 1035 temp_past = past; 1036 while (temp_past > 0) { 1037 if ((next = TAILQ_NEXT(end_of_range, cn_next_child)) != NULL) 1038 end_of_range = next; 1039 else if ((prev = TAILQ_PREV(iter, cd9660_children_head, cn_next_child)) != NULL) 1040 iter = prev; 1041 else 1042 delete_chars++; 1043 temp_past--; 1044 } 1045 skip += past; 1046 iter = cd9660_rename_filename(iter, skip, delete_chars); 1047 } 1048 return flag; 1049} 1050 1051 1052static cd9660node * 1053cd9660_rename_filename(cd9660node *iter, int num, int delete_chars) 1054{ 1055 int i = 0; 1056 int numbts, dot, semi, digit, digits, temp, powers, multiplier, count; 1057 char *naming; 1058 int maxlength; 1059 char *tmp; 1060 1061 if (diskStructure.verbose_level > 0) 1062 printf("Rename_filename called\n"); 1063 1064 /* TODO : A LOT of chanes regarding 8.3 filenames */ 1065 if (diskStructure.isoLevel == 1) 1066 maxlength = 8; 1067 else if (diskStructure.isoLevel == 2) 1068 maxlength = 31; 1069 else 1070 maxlength = ISO_FILENAME_MAXLENGTH_BEFORE_VERSION; 1071 1072 tmp = malloc(ISO_FILENAME_MAXLENGTH_WITH_PADDING); 1073 1074 while (i < num) { 1075 powers = 1; 1076 count = 0; 1077 digits = 1; 1078 multiplier = 1; 1079 while (((int)(i / powers) ) >= 10) { 1080 digits++; 1081 powers = powers * 10; 1082 } 1083 1084 naming = iter->o_name; 1085 1086 /* 1087 while ((*naming != '.') && (*naming != ';')) { 1088 naming++; 1089 count++; 1090 } 1091 */ 1092 1093 dot = -1; 1094 semi = -1; 1095 while (count < maxlength) { 1096 if (*naming == '.') 1097 dot = count; 1098 else if (*naming == ';') { 1099 semi = count; 1100 break; 1101 } 1102 naming++; 1103 count++; 1104 } 1105 1106 if ((count + digits) < maxlength) 1107 numbts = count; 1108 else 1109 numbts = maxlength - (digits); 1110 numbts -= delete_chars; 1111 1112 /* 8.3 rules - keep the extension, add before the dot */ 1113 1114 /* 1115 * This code makes a bunch of assumptions. 1116 * See if you can spot them all :) 1117 */ 1118 1119 /* 1120 if (diskStructure.isoLevel == 1) { 1121 numbts = 8 - digits - delete_chars; 1122 if (dot < 0) { 1123 1124 } else { 1125 if (dot < 8) { 1126 memmove(&tmp[numbts],&tmp[dot],4); 1127 } 1128 } 1129 } 1130 */ 1131 1132 /* (copying just the filename before the '.' */ 1133 memcpy(tmp, (iter->o_name), numbts); 1134 1135 /* adding the appropriate number following the name */ 1136 temp = i; 1137 while (digits > 0) { 1138 digit = (int)(temp / powers); 1139 temp = temp - digit * powers; 1140 sprintf(&tmp[numbts] , "%d", digit); 1141 digits--; 1142 numbts++; 1143 powers = powers / 10; 1144 } 1145 1146 while ((*naming != ';') && (numbts < maxlength)) { 1147 tmp[numbts] = (*naming); 1148 naming++; 1149 numbts++; 1150 } 1151 1152 tmp[numbts] = ';'; 1153 tmp[numbts+1] = '1'; 1154 tmp[numbts+2] = '\0'; 1155 1156 /* 1157 * now tmp has exactly the identifier 1158 * we want so we'll copy it back to record 1159 */ 1160 memcpy((iter->isoDirRecord->name), tmp, numbts + 3); 1161 1162 iter = TAILQ_NEXT(iter, cn_next_child); 1163 i++; 1164 } 1165 1166 free(tmp); 1167 return iter; 1168} 1169 1170/* Todo: Figure out why these functions are nec. */ 1171static void 1172cd9660_copy_filenames(cd9660node *node) 1173{ 1174 cd9660node *cn; 1175 1176 if (TAILQ_EMPTY(&node->cn_children)) 1177 return; 1178 1179 if (TAILQ_FIRST(&node->cn_children)->isoDirRecord == NULL) { 1180 debug_print_tree(diskStructure.rootNode, 0); 1181 exit(1); 1182 } 1183 1184 TAILQ_FOREACH(cn, &node->cn_children, cn_next_child) { 1185 cd9660_copy_filenames(cn); 1186 memcpy(cn->o_name, cn->isoDirRecord->name, 1187 ISO_FILENAME_MAXLENGTH_WITH_PADDING); 1188 } 1189} 1190 1191static void 1192cd9660_sorting_nodes(cd9660node *node) 1193{ 1194 cd9660node *cn; 1195 1196 TAILQ_FOREACH(cn, &node->cn_children, cn_next_child) 1197 cd9660_sorting_nodes(cn); 1198 cd9660_sort_nodes(node); 1199} 1200 1201/* XXX Bubble sort. */ 1202static void 1203cd9660_sort_nodes(cd9660node *node) 1204{ 1205 cd9660node *cn, *next; 1206 1207 do { 1208 TAILQ_FOREACH(cn, &node->cn_children, cn_next_child) { 1209 if ((next = TAILQ_NEXT(cn, cn_next_child)) == NULL) 1210 return; 1211 else if (strcmp(next->isoDirRecord->name, 1212 cn->isoDirRecord->name) >= 0) 1213 continue; 1214 TAILQ_REMOVE(&node->cn_children, next, cn_next_child); 1215 TAILQ_INSERT_BEFORE(cn, next, cn_next_child); 1216 break; 1217 } 1218 } while (cn != NULL); 1219} 1220 1221static int 1222cd9660_count_collisions(cd9660node *copy) 1223{ 1224 int count = 0; 1225 cd9660node *iter, *next; 1226 1227 for (iter = copy; 1228 (next = TAILQ_NEXT(iter, cn_next_child)) != NULL; 1229 iter = next) { 1230 if (cd9660_compare_filename(iter->isoDirRecord->name, 1231 next->isoDirRecord->name) == 0) 1232 count++; 1233 else 1234 return count; 1235 } 1236#if 0 1237 if ((next = TAILQ_NEXT(iter, cn_next_child)) != NULL) { 1238 printf("cd9660_recurse_on_collision: count is %i \n", count); 1239 compare = cd9660_compare_filename(iter->isoDirRecord->name, 1240 next->isoDirRecord->name); 1241 if (compare == 0) { 1242 count++; 1243 return cd9660_recurse_on_collision(next, count); 1244 } else 1245 return count; 1246 } 1247#endif 1248 return count; 1249} 1250 1251static cd9660node * 1252cd9660_rrip_move_directory(cd9660node *dir) 1253{ 1254 char newname[9]; 1255 cd9660node *tfile; 1256 1257 /* 1258 * This function needs to: 1259 * 1) Create an empty virtual file in place of the old directory 1260 * 2) Point the virtual file to the new directory 1261 * 3) Point the relocated directory to its old parent 1262 * 4) Move the directory specified by dir into rr_moved_dir, 1263 * and rename it to "diskStructure.rock_ridge_move_count" (as a string) 1264 */ 1265 1266 /* First see if the moved directory even exists */ 1267 if (diskStructure.rr_moved_dir == NULL) { 1268 diskStructure.rr_moved_dir = 1269 cd9660_create_directory(ISO_RRIP_DEFAULT_MOVE_DIR_NAME, 1270 diskStructure.rootNode, dir); 1271 if (diskStructure.rr_moved_dir == NULL) 1272 return 0; 1273 } 1274 1275 /* Create a file with the same ORIGINAL name */ 1276 tfile = cd9660_create_file(dir->node->name, dir->parent, dir); 1277 if (tfile == NULL) 1278 return NULL; 1279 1280 diskStructure.rock_ridge_move_count++; 1281 snprintf(newname, sizeof(newname), "%08i", 1282 diskStructure.rock_ridge_move_count); 1283 1284 /* Point to old parent */ 1285 dir->rr_real_parent = dir->parent; 1286 1287 /* Place the placeholder file */ 1288 if (TAILQ_EMPTY(&dir->rr_real_parent->cn_children)) { 1289 TAILQ_INSERT_HEAD(&dir->rr_real_parent->cn_children, tfile, 1290 cn_next_child); 1291 } else { 1292 cd9660_sorted_child_insert(dir->rr_real_parent, tfile); 1293 } 1294 1295 /* Point to new parent */ 1296 dir->parent = diskStructure.rr_moved_dir; 1297 1298 /* Point the file to the moved directory */ 1299 tfile->rr_relocated = dir; 1300 1301 /* Actually move the directory */ 1302 cd9660_sorted_child_insert(diskStructure.rr_moved_dir, dir); 1303 1304 /* TODO: Inherit permissions / ownership (basically the entire inode) */ 1305 1306 /* Set the new name */ 1307 memset(dir->isoDirRecord->name, 0, ISO_FILENAME_MAXLENGTH_WITH_PADDING); 1308 strncpy(dir->isoDirRecord->name, newname, 8); 1309 dir->isoDirRecord->length[0] = 34 + 8; 1310 dir->isoDirRecord->name_len[0] = 8; 1311 1312 return dir; 1313} 1314 1315static int 1316cd9660_add_dot_records(cd9660node *root) 1317{ 1318 struct cd9660_children_head *head = &root->cn_children; 1319 cd9660node *cn; 1320 1321 TAILQ_FOREACH(cn, head, cn_next_child) { 1322 if ((cn->type & CD9660_TYPE_DIR) == 0) 1323 continue; 1324 /* Recursion first */ 1325 cd9660_add_dot_records(cn); 1326 } 1327 cd9660_create_special_directory(CD9660_TYPE_DOT, root); 1328 cd9660_create_special_directory(CD9660_TYPE_DOTDOT, root); 1329 return 1; 1330} 1331 1332/* 1333 * Convert node to cd9660 structure 1334 * This function is designed to be called recursively on the root node of 1335 * the filesystem 1336 * Lots of recursion going on here, want to make sure it is efficient 1337 * @param struct fsnode * The root node to be converted 1338 * @param struct cd9660* The parent node (should not be NULL) 1339 * @param int Current directory depth 1340 * @param int* Running count of the number of directories that are being created 1341 */ 1342static void 1343cd9660_convert_structure(fsnode *root, cd9660node *parent_node, int level, 1344 int *numDirectories, int *error) 1345{ 1346 fsnode *iterator = root; 1347 cd9660node *this_node; 1348 int working_level; 1349 int add; 1350 int flag = 0; 1351 int counter = 0; 1352 1353 /* 1354 * Newer, more efficient method, reduces recursion depth 1355 */ 1356 if (root == NULL) { 1357 warnx("%s: root is null\n", __func__); 1358 return; 1359 } 1360 1361 /* Test for an empty directory - makefs still gives us the . record */ 1362 if ((S_ISDIR(root->type)) && (root->name[0] == '.') 1363 && (root->name[1] == '\0')) { 1364 root = root->next; 1365 if (root == NULL) 1366 return; 1367 } 1368 if ((this_node = cd9660_allocate_cd9660node()) == NULL) { 1369 CD9660_MEM_ALLOC_ERROR(__func__); 1370 } 1371 1372 /* 1373 * To reduce the number of recursive calls, we will iterate over 1374 * the next pointers to the right. 1375 */ 1376 while (iterator != NULL) { 1377 add = 1; 1378 /* 1379 * Increment the directory count if this is a directory 1380 * Ignore "." entries. We will generate them later 1381 */ 1382 if (!S_ISDIR(iterator->type) || 1383 strcmp(iterator->name, ".") != 0) { 1384 1385 /* Translate the node, including its filename */ 1386 this_node->parent = parent_node; 1387 cd9660_translate_node(iterator, this_node); 1388 this_node->level = level; 1389 1390 if (S_ISDIR(iterator->type)) { 1391 (*numDirectories)++; 1392 this_node->type = CD9660_TYPE_DIR; 1393 working_level = level + 1; 1394 1395 /* 1396 * If at level 8, directory would be at 8 1397 * and have children at 9 which is not 1398 * allowed as per ISO spec 1399 */ 1400 if (level == 8) { 1401 if ((!diskStructure.allow_deep_trees) && 1402 (!diskStructure.rock_ridge_enabled)) { 1403 warnx("error: found entry " 1404 "with depth greater " 1405 "than 8."); 1406 (*error) = 1; 1407 return; 1408 } else if (diskStructure. 1409 rock_ridge_enabled) { 1410 working_level = 3; 1411 /* 1412 * Moved directory is actually 1413 * at level 2. 1414 */ 1415 this_node->level = 1416 working_level - 1; 1417 if (cd9660_rrip_move_directory( 1418 this_node) == 0) { 1419 warnx("Failure in " 1420 "cd9660_rrip_" 1421 "move_directory" 1422 ); 1423 (*error) = 1; 1424 return; 1425 } 1426 add = 0; 1427 } 1428 } 1429 1430 /* Do the recursive call on the children */ 1431 if (iterator->child != 0) { 1432 cd9660_convert_structure( 1433 iterator->child, this_node, 1434 working_level, 1435 numDirectories, error); 1436 1437 if ((*error) == 1) { 1438 warnx("%s: Error on recursive " 1439 "call", __func__); 1440 return; 1441 } 1442 } 1443 1444 } else { 1445 /* Only directories should have children */ 1446 assert(iterator->child == NULL); 1447 1448 this_node->type = CD9660_TYPE_FILE; 1449 } 1450 1451 /* 1452 * Finally, do a sorted insert 1453 */ 1454 if (add) { 1455 cd9660_sorted_child_insert( 1456 parent_node, this_node); 1457 } 1458 1459 /*Allocate new temp_node */ 1460 if (iterator->next != 0) { 1461 this_node = cd9660_allocate_cd9660node(); 1462 if (this_node == NULL) 1463 CD9660_MEM_ALLOC_ERROR(__func__); 1464 } 1465 } 1466 iterator = iterator->next; 1467 } 1468 1469 /* cd9660_handle_collisions(first_node); */ 1470 1471 /* TODO: need cleanup */ 1472 cd9660_copy_filenames(parent_node); 1473 1474 do { 1475 flag = cd9660_handle_collisions(parent_node, counter); 1476 counter++; 1477 cd9660_sorting_nodes(parent_node); 1478 } while ((flag == 1) && (counter < 100)); 1479} 1480 1481/* 1482 * Clean up the cd9660node tree 1483 * This is designed to be called recursively on the root node 1484 * @param struct cd9660node *root The node to free 1485 * @returns void 1486 */ 1487static void 1488cd9660_free_structure(cd9660node *root) 1489{ 1490 cd9660node *cn; 1491 1492 while ((cn = TAILQ_FIRST(&root->cn_children)) != NULL) { 1493 TAILQ_REMOVE(&root->cn_children, cn, cn_next_child); 1494 cd9660_free_structure(cn); 1495 } 1496 free(root); 1497} 1498 1499/* 1500 * Be a little more memory conservative: 1501 * instead of having the TAILQ_ENTRY as part of the cd9660node, 1502 * just create a temporary structure 1503 */ 1504struct ptq_entry 1505{ 1506 TAILQ_ENTRY(ptq_entry) ptq; 1507 cd9660node *node; 1508} *n; 1509 1510#define PTQUEUE_NEW(n,s,r,t){\ 1511 n = malloc(sizeof(struct s)); \ 1512 if (n == NULL) \ 1513 return r; \ 1514 n->node = t;\ 1515} 1516 1517/* 1518 * Generate the path tables 1519 * The specific implementation of this function is left as an exercise to the 1520 * programmer. It could be done recursively. Make sure you read how the path 1521 * table has to be laid out, it has levels. 1522 * @param struct iso9660_disk *disk The disk image 1523 * @returns int The number of built path tables (between 1 and 4), 0 on failure 1524 */ 1525static int 1526cd9660_generate_path_table(void) 1527{ 1528 cd9660node *cn, *dirNode = diskStructure.rootNode; 1529 cd9660node *last = dirNode; 1530 int pathTableSize = 0; /* computed as we go */ 1531 int counter = 1; /* root gets a count of 0 */ 1532 int parentRecNum = 0; /* root's parent is '0' */ 1533 1534 TAILQ_HEAD(cd9660_pt_head, ptq_entry) pt_head; 1535 TAILQ_INIT(&pt_head); 1536 1537 PTQUEUE_NEW(n, ptq_entry, -1, diskStructure.rootNode); 1538 1539 /* Push the root node */ 1540 TAILQ_INSERT_HEAD(&pt_head, n, ptq); 1541 1542 /* Breadth-first traversal of file structure */ 1543 while (pt_head.tqh_first != 0) { 1544 n = pt_head.tqh_first; 1545 dirNode = n->node; 1546 TAILQ_REMOVE(&pt_head, pt_head.tqh_first, ptq); 1547 free(n); 1548 1549 /* Update the size */ 1550 pathTableSize += ISO_PATHTABLE_ENTRY_BASESIZE 1551 + dirNode->isoDirRecord->name_len[0]+ 1552 (dirNode->isoDirRecord->name_len[0] % 2 == 0 ? 0 : 1); 1553 /* includes the padding bit */ 1554 1555 dirNode->ptnumber=counter; 1556 if (dirNode != last) { 1557 last->ptnext = dirNode; 1558 dirNode->ptprev = last; 1559 } 1560 last = dirNode; 1561 1562 parentRecNum = 1; 1563 if (dirNode->parent != 0) 1564 parentRecNum = dirNode->parent->ptnumber; 1565 1566 /* Push children onto queue */ 1567 TAILQ_FOREACH(cn, &dirNode->cn_children, cn_next_child) { 1568 /* 1569 * Dont add the DOT and DOTDOT types to the path 1570 * table. 1571 */ 1572 if ((cn->type != CD9660_TYPE_DOT) 1573 && (cn->type != CD9660_TYPE_DOTDOT)) { 1574 1575 if (S_ISDIR(cn->node->type)) { 1576 PTQUEUE_NEW(n, ptq_entry, -1, cn); 1577 TAILQ_INSERT_TAIL(&pt_head, n, ptq); 1578 } 1579 } 1580 } 1581 counter++; 1582 } 1583 return pathTableSize; 1584} 1585 1586void 1587cd9660_compute_full_filename(cd9660node *node, char *buf, int level) 1588{ 1589 cd9660node *parent; 1590 1591 parent = (node->rr_real_parent == NULL ? 1592 node->parent : node->rr_real_parent); 1593 if (parent != NULL) { 1594 cd9660_compute_full_filename(parent, buf, level + 1); 1595 strcat(buf, node->node->name); 1596 } else { 1597 /* We are at the root */ 1598 strcat(buf, diskStructure.rootFilesystemPath); 1599 if (buf[strlen(buf) - 1] == '/') 1600 buf[strlen(buf) - 1] = '\0'; 1601 } 1602 1603 if (level != 0) 1604 strcat(buf, "/"); 1605} 1606 1607/* NEW filename conversion method */ 1608typedef int(*cd9660_filename_conversion_functor)(const char *, char *, int); 1609 1610 1611/* 1612 * TODO: These two functions are almost identical. 1613 * Some code cleanup is possible here 1614 * 1615 * XXX bounds checking! 1616 */ 1617static int 1618cd9660_level1_convert_filename(const char *oldname, char *newname, int is_file) 1619{ 1620 /* 1621 * ISO 9660 : 10.1 1622 * File Name shall not contain more than 8 d or d1 characters 1623 * File Name Extension shall not contain more than 3 d or d1 characters 1624 * Directory Identifier shall not contain more than 8 d or d1 characters 1625 */ 1626 int namelen = 0; 1627 int extlen = 0; 1628 int found_ext = 0; 1629 1630 while (*oldname != '\0') { 1631 /* Handle period first, as it is special */ 1632 if (*oldname == '.') { 1633 if (found_ext) { 1634 *newname++ = '_'; 1635 extlen ++; 1636 } 1637 else { 1638 *newname++ = '.'; 1639 found_ext = 1; 1640 } 1641 } else { 1642 /* cut RISC OS file type off ISO name */ 1643 if (diskStructure.archimedes_enabled && 1644 *oldname == ',' && strlen(oldname) == 4) 1645 break; 1646 /* Enforce 12.3 / 8 */ 1647 if (((namelen == 8) && !found_ext) || 1648 (found_ext && extlen == 3)) { 1649 break; 1650 } 1651 1652 if (islower((unsigned char)*oldname)) 1653 *newname++ = toupper((unsigned char)*oldname); 1654 else if (isupper((unsigned char)*oldname) 1655 || isdigit((unsigned char)*oldname)) 1656 *newname++ = *oldname; 1657 else 1658 *newname++ = '_'; 1659 1660 if (found_ext) 1661 extlen++; 1662 else 1663 namelen++; 1664 } 1665 oldname ++; 1666 } 1667 if (is_file) { 1668 if (!found_ext && !diskStructure.omit_trailing_period) 1669 *newname++ = '.'; 1670 /* Add version */ 1671 sprintf(newname, ";%i", 1); 1672 } 1673 return namelen + extlen + found_ext; 1674} 1675 1676/* XXX bounds checking! */ 1677static int 1678cd9660_level2_convert_filename(const char *oldname, char *newname, int is_file) 1679{ 1680 /* 1681 * ISO 9660 : 7.5.1 1682 * File name : 0+ d or d1 characters 1683 * separator 1 (.) 1684 * File name extension : 0+ d or d1 characters 1685 * separator 2 (;) 1686 * File version number (5 characters, 1-32767) 1687 * 1 <= Sum of File name and File name extension <= 30 1688 */ 1689 int namelen = 0; 1690 int extlen = 0; 1691 int found_ext = 0; 1692 1693 while (*oldname != '\0') { 1694 /* Handle period first, as it is special */ 1695 if (*oldname == '.') { 1696 if (found_ext) { 1697 if (diskStructure.allow_multidot) { 1698 *newname++ = '.'; 1699 } else { 1700 *newname++ = '_'; 1701 } 1702 extlen ++; 1703 } 1704 else { 1705 *newname++ = '.'; 1706 found_ext = 1; 1707 } 1708 } else { 1709 /* cut RISC OS file type off ISO name */ 1710 if (diskStructure.archimedes_enabled && 1711 *oldname == ',' && strlen(oldname) == 4) 1712 break; 1713 if ((namelen + extlen) == 30) 1714 break; 1715 1716 if (islower((unsigned char)*oldname)) 1717 *newname++ = toupper((unsigned char)*oldname); 1718 else if (isupper((unsigned char)*oldname) || 1719 isdigit((unsigned char)*oldname)) 1720 *newname++ = *oldname; 1721 else if (diskStructure.allow_multidot && 1722 *oldname == '.') { 1723 *newname++ = '.'; 1724 } else { 1725 *newname++ = '_'; 1726 } 1727 1728 if (found_ext) 1729 extlen++; 1730 else 1731 namelen++; 1732 } 1733 oldname ++; 1734 } 1735 if (is_file) { 1736 if (!found_ext && !diskStructure.omit_trailing_period) 1737 *newname++ = '.'; 1738 /* Add version */ 1739 sprintf(newname, ";%i", 1); 1740 } 1741 return namelen + extlen + found_ext; 1742} 1743 1744#if 0 1745static int 1746cd9660_joliet_convert_filename(const char *oldname, char *newname, int is_file) 1747{ 1748 /* TODO: implement later, move to cd9660_joliet.c ?? */ 1749} 1750#endif 1751 1752 1753/* 1754 * Convert a file name to ISO compliant file name 1755 * @param char * oldname The original filename 1756 * @param char ** newname The new file name, in the appropriate character 1757 * set and of appropriate length 1758 * @param int 1 if file, 0 if directory 1759 * @returns int The length of the new string 1760 */ 1761static int 1762cd9660_convert_filename(const char *oldname, char *newname, int is_file) 1763{ 1764 /* NEW */ 1765 cd9660_filename_conversion_functor conversion_function = 0; 1766 if (diskStructure.isoLevel == 1) 1767 conversion_function = &cd9660_level1_convert_filename; 1768 else if (diskStructure.isoLevel == 2) 1769 conversion_function = &cd9660_level2_convert_filename; 1770 return (*conversion_function)(oldname, newname, is_file); 1771} 1772 1773int 1774cd9660_compute_record_size(cd9660node *node) 1775{ 1776 int size = node->isoDirRecord->length[0]; 1777 1778 if (diskStructure.rock_ridge_enabled) 1779 size += node->susp_entry_size; 1780 size += node->su_tail_size; 1781 size += size & 1; /* Ensure length of record is even. */ 1782 assert(size <= 254); 1783 return size; 1784} 1785 1786static void 1787cd9660_populate_dot_records(cd9660node *node) 1788{ 1789 node->dot_record->fileDataSector = node->fileDataSector; 1790 memcpy(node->dot_record->isoDirRecord,node->isoDirRecord, 34); 1791 node->dot_record->isoDirRecord->name_len[0] = 1; 1792 node->dot_record->isoDirRecord->name[0] = 0; 1793 node->dot_record->isoDirRecord->name[1] = 0; 1794 node->dot_record->isoDirRecord->length[0] = 34; 1795 node->dot_record->fileRecordSize = 1796 cd9660_compute_record_size(node->dot_record); 1797 1798 if (node == diskStructure.rootNode) { 1799 node->dot_dot_record->fileDataSector = node->fileDataSector; 1800 memcpy(node->dot_dot_record->isoDirRecord,node->isoDirRecord, 1801 34); 1802 } else { 1803 node->dot_dot_record->fileDataSector = 1804 node->parent->fileDataSector; 1805 memcpy(node->dot_dot_record->isoDirRecord, 1806 node->parent->isoDirRecord,34); 1807 } 1808 node->dot_dot_record->isoDirRecord->name_len[0] = 1; 1809 node->dot_dot_record->isoDirRecord->name[0] = 1; 1810 node->dot_dot_record->isoDirRecord->name[1] = 0; 1811 node->dot_dot_record->isoDirRecord->length[0] = 34; 1812 node->dot_dot_record->fileRecordSize = 1813 cd9660_compute_record_size(node->dot_dot_record); 1814} 1815 1816/* 1817 * @param struct cd9660node *node The node 1818 * @param int The offset (in bytes) - SHOULD align to the beginning of a sector 1819 * @returns int The total size of files and directory entries (should be 1820 * a multiple of sector size) 1821*/ 1822static int64_t 1823cd9660_compute_offsets(cd9660node *node, int64_t startOffset) 1824{ 1825 /* 1826 * This function needs to compute the size of directory records and 1827 * runs, file lengths, and set the appropriate variables both in 1828 * cd9660node and isoDirEntry 1829 */ 1830 int64_t used_bytes = 0; 1831 int64_t current_sector_usage = 0; 1832 cd9660node *child; 1833 fsinode *inode; 1834 int64_t r; 1835 1836 assert(node != NULL); 1837 1838 1839 /* 1840 * NOTE : There needs to be some special case detection for 1841 * the "real root" node, since for it, node->node is undefined 1842 */ 1843 1844 node->fileDataSector = -1; 1845 1846 if (node->type & CD9660_TYPE_DIR) { 1847 node->fileRecordSize = cd9660_compute_record_size(node); 1848 /*Set what sector this directory starts in*/ 1849 node->fileDataSector = 1850 CD9660_BLOCKS(diskStructure.sectorSize,startOffset); 1851 1852 cd9660_bothendian_dword(node->fileDataSector, 1853 node->isoDirRecord->extent); 1854 1855 /* 1856 * First loop over children, need to know the size of 1857 * their directory records 1858 */ 1859 node->fileSectorsUsed = 1; 1860 TAILQ_FOREACH(child, &node->cn_children, cn_next_child) { 1861 node->fileDataLength += 1862 cd9660_compute_record_size(child); 1863 if ((cd9660_compute_record_size(child) + 1864 current_sector_usage) >= 1865 diskStructure.sectorSize) { 1866 current_sector_usage = 0; 1867 node->fileSectorsUsed++; 1868 } 1869 1870 current_sector_usage += 1871 cd9660_compute_record_size(child); 1872 } 1873 1874 cd9660_bothendian_dword(node->fileSectorsUsed * 1875 diskStructure.sectorSize,node->isoDirRecord->size); 1876 1877 /* 1878 * This should point to the sector after the directory 1879 * record (or, the first byte in that sector) 1880 */ 1881 used_bytes += node->fileSectorsUsed * diskStructure.sectorSize; 1882 1883 for (child = TAILQ_NEXT(node->dot_dot_record, cn_next_child); 1884 child != NULL; child = TAILQ_NEXT(child, cn_next_child)) { 1885 /* Directories need recursive call */ 1886 if (S_ISDIR(child->node->type)) { 1887 r = cd9660_compute_offsets(child, 1888 used_bytes + startOffset); 1889 1890 if (r != -1) 1891 used_bytes += r; 1892 else 1893 return -1; 1894 } 1895 } 1896 1897 /* Explicitly set the . and .. records */ 1898 cd9660_populate_dot_records(node); 1899 1900 /* Finally, do another iteration to write the file data*/ 1901 for (child = TAILQ_NEXT(node->dot_dot_record, cn_next_child); 1902 child != NULL; 1903 child = TAILQ_NEXT(child, cn_next_child)) { 1904 /* Files need extent set */ 1905 if (S_ISDIR(child->node->type)) 1906 continue; 1907 child->fileRecordSize = 1908 cd9660_compute_record_size(child); 1909 1910 child->fileSectorsUsed = 1911 CD9660_BLOCKS(diskStructure.sectorSize, 1912 child->fileDataLength); 1913 1914 inode = child->node->inode; 1915 if ((inode->flags & FI_ALLOCATED) == 0) { 1916 inode->ino = 1917 CD9660_BLOCKS(diskStructure.sectorSize, 1918 used_bytes + startOffset); 1919 inode->flags |= FI_ALLOCATED; 1920 used_bytes += child->fileSectorsUsed * 1921 diskStructure.sectorSize; 1922 } else { 1923 INODE_WARNX(("%s: already allocated inode %d " 1924 "data sectors at %" PRIu32, __func__, 1925 (int)inode->st.st_ino, inode->ino)); 1926 } 1927 child->fileDataSector = inode->ino; 1928 cd9660_bothendian_dword(child->fileDataSector, 1929 child->isoDirRecord->extent); 1930 } 1931 } 1932 1933 return used_bytes; 1934} 1935 1936#if 0 1937/* Might get rid of this func */ 1938static int 1939cd9660_copy_stat_info(cd9660node *from, cd9660node *to, int file) 1940{ 1941 to->node->inode->st.st_dev = 0; 1942 to->node->inode->st.st_ino = 0; 1943 to->node->inode->st.st_size = 0; 1944 to->node->inode->st.st_blksize = from->node->inode->st.st_blksize; 1945 to->node->inode->st.st_atime = from->node->inode->st.st_atime; 1946 to->node->inode->st.st_mtime = from->node->inode->st.st_mtime; 1947 to->node->inode->st.st_ctime = from->node->inode->st.st_ctime; 1948 to->node->inode->st.st_uid = from->node->inode->st.st_uid; 1949 to->node->inode->st.st_gid = from->node->inode->st.st_gid; 1950 to->node->inode->st.st_mode = from->node->inode->st.st_mode; 1951 /* Clear out type */ 1952 to->node->inode->st.st_mode = to->node->inode->st.st_mode & ~(S_IFMT); 1953 if (file) 1954 to->node->inode->st.st_mode |= S_IFREG; 1955 else 1956 to->node->inode->st.st_mode |= S_IFDIR; 1957 return 1; 1958} 1959#endif 1960 1961static cd9660node * 1962cd9660_create_virtual_entry(const char *name, cd9660node *parent, int file, 1963 int insert) 1964{ 1965 cd9660node *temp; 1966 fsnode * tfsnode; 1967 1968 assert(parent != NULL); 1969 1970 temp = cd9660_allocate_cd9660node(); 1971 if (temp == NULL) 1972 return NULL; 1973 1974 if ((tfsnode = malloc(sizeof(fsnode))) == NULL) { 1975 CD9660_MEM_ALLOC_ERROR("cd9660_create_virtual_entry"); 1976 return NULL; 1977 } 1978 1979 /* Assume for now name is a valid length */ 1980 if ((tfsnode->name = malloc(strlen(name) + 1)) == NULL) { 1981 CD9660_MEM_ALLOC_ERROR("cd9660_create_virtual_entry"); 1982 return NULL; 1983 } 1984 1985 if ((temp->isoDirRecord = 1986 malloc(sizeof(iso_directory_record_cd9660))) == NULL) { 1987 CD9660_MEM_ALLOC_ERROR("cd9660_create_virtual_entry"); 1988 return NULL; 1989 } 1990 1991 strcpy(tfsnode->name, name); 1992 1993 cd9660_convert_filename(tfsnode->name, temp->isoDirRecord->name, file); 1994 1995 temp->node = tfsnode; 1996 temp->parent = parent; 1997 1998 if (insert) { 1999 if (temp->parent != NULL) { 2000 temp->level = temp->parent->level + 1; 2001 if (!TAILQ_EMPTY(&temp->parent->cn_children)) 2002 cd9660_sorted_child_insert(temp->parent, temp); 2003 else 2004 TAILQ_INSERT_HEAD(&temp->parent->cn_children, 2005 temp, cn_next_child); 2006 } 2007 } 2008 2009 if (parent->node != NULL) { 2010 tfsnode->type = parent->node->type; 2011 } 2012 2013 /* Clear out file type bits */ 2014 tfsnode->type &= ~(S_IFMT); 2015 if (file) 2016 tfsnode->type |= S_IFREG; 2017 else 2018 tfsnode->type |= S_IFDIR; 2019 2020 /* Indicate that there is no spec entry (inode) */ 2021 tfsnode->flags &= ~(FSNODE_F_HASSPEC); 2022#if 0 2023 cd9660_copy_stat_info(parent, temp, file); 2024#endif 2025 return temp; 2026} 2027 2028static cd9660node * 2029cd9660_create_file(const char * name, cd9660node *parent, cd9660node *me) 2030{ 2031 cd9660node *temp; 2032 2033 temp = cd9660_create_virtual_entry(name,parent,1,1); 2034 if (temp == NULL) 2035 return NULL; 2036 2037 temp->fileDataLength = 0; 2038 2039 temp->type = CD9660_TYPE_FILE | CD9660_TYPE_VIRTUAL; 2040 2041 if ((temp->node->inode = calloc(1, sizeof(fsinode))) == NULL) 2042 return NULL; 2043 *temp->node->inode = *me->node->inode; 2044 2045 if (cd9660_translate_node_common(temp) == 0) 2046 return NULL; 2047 return temp; 2048} 2049 2050/* 2051 * Create a new directory which does not exist on disk 2052 * @param const char * name The name to assign to the directory 2053 * @param const char * parent Pointer to the parent directory 2054 * @returns cd9660node * Pointer to the new directory 2055 */ 2056static cd9660node * 2057cd9660_create_directory(const char *name, cd9660node *parent, cd9660node *me) 2058{ 2059 cd9660node *temp; 2060 2061 temp = cd9660_create_virtual_entry(name,parent,0,1); 2062 if (temp == NULL) 2063 return NULL; 2064 temp->node->type |= S_IFDIR; 2065 2066 temp->type = CD9660_TYPE_DIR | CD9660_TYPE_VIRTUAL; 2067 2068 if ((temp->node->inode = calloc(1, sizeof(fsinode))) == NULL) 2069 return NULL; 2070 *temp->node->inode = *me->node->inode; 2071 2072 if (cd9660_translate_node_common(temp) == 0) 2073 return NULL; 2074 return temp; 2075} 2076 2077static cd9660node * 2078cd9660_create_special_directory(u_char type, cd9660node *parent) 2079{ 2080 cd9660node *temp, *first; 2081 char na[2]; 2082 2083 assert(parent != NULL); 2084 2085 if (type == CD9660_TYPE_DOT) 2086 na[0] = 0; 2087 else if (type == CD9660_TYPE_DOTDOT) 2088 na[0] = 1; 2089 else 2090 return 0; 2091 2092 na[1] = 0; 2093 if ((temp = cd9660_create_virtual_entry(na, parent, 0, 0)) == NULL) 2094 return NULL; 2095 2096 temp->parent = parent; 2097 temp->type = type; 2098 temp->isoDirRecord->length[0] = 34; 2099 /* Dot record is always first */ 2100 if (type == CD9660_TYPE_DOT) { 2101 parent->dot_record = temp; 2102 TAILQ_INSERT_HEAD(&parent->cn_children, temp, cn_next_child); 2103 /* DotDot should be second */ 2104 } else if (type == CD9660_TYPE_DOTDOT) { 2105 parent->dot_dot_record = temp; 2106 /* 2107 * If the first child is the dot record, insert 2108 * this second. Otherwise, insert it at the head. 2109 */ 2110 if ((first = TAILQ_FIRST(&parent->cn_children)) == NULL || 2111 (first->type & CD9660_TYPE_DOT) == 0) { 2112 TAILQ_INSERT_HEAD(&parent->cn_children, temp, 2113 cn_next_child); 2114 } else { 2115 TAILQ_INSERT_AFTER(&parent->cn_children, first, temp, 2116 cn_next_child); 2117 } 2118 } 2119 2120 return temp; 2121} 2122 2123int 2124cd9660_add_generic_bootimage(const char *bootimage) 2125{ 2126 struct stat stbuf; 2127 2128 assert(bootimage != NULL); 2129 2130 if (*bootimage == '\0') { 2131 warnx("Error: Boot image must be a filename"); 2132 return 0; 2133 } 2134 2135 if ((diskStructure.generic_bootimage = strdup(bootimage)) == NULL) { 2136 warn("%s: strdup", __func__); 2137 return 0; 2138 } 2139 2140 /* Get information about the file */ 2141 if (lstat(diskStructure.generic_bootimage, &stbuf) == -1) 2142 err(EXIT_FAILURE, "%s: lstat(\"%s\")", __func__, 2143 diskStructure.generic_bootimage); 2144 2145 if (stbuf.st_size > 32768) { 2146 warnx("Error: Boot image must be no greater than 32768 bytes"); 2147 return 0; 2148 } 2149 2150 if (diskStructure.verbose_level > 0) { 2151 printf("Generic boot image image has size %lld\n", 2152 (long long)stbuf.st_size); 2153 } 2154 2155 diskStructure.has_generic_bootimage = 1; 2156 2157 return 1; 2158} 2159